Submission #66743737


Source Code Expand

Copy
N,H,M=map(int,input().split())
A=[]
B=[]
for _ in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
# dp[h][m]=hm
dp=set()
dp.add((H,M))
ans=0
for i in range(N):
next_dp=set()
for h,m in dp:
did=False
if h >= A[i]:
next_dp.add((h-A[i],m))
did=True
if m >= B[i]:
next_dp.add((h,m-B[i]))
did=True
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
N,H,M=map(int,input().split())
A=[]
B=[]
for _ in range(N):
    a,b=map(int,input().split())
    A.append(a)
    B.append(b)
# dp[h][m]=現在の体力h、魔力mで到達可能か?
dp=set()
dp.add((H,M))
ans=0
for i in range(N):
    next_dp=set()
    for h,m in dp:
        did=False
        if h >= A[i]:
            next_dp.add((h-A[i],m))
            did=True
        if m >= B[i]:
            next_dp.add((h,m-B[i]))
            did=True
    if not next_dp:
        break
    dp=next_dp
    ans+=1
print(ans)

Submission Info

Submission Time
Task E - Battles in a Row
User Untitle
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 542 Byte
Status TLE
Exec Time 2236 ms
Memory 416756 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 450
Status
AC × 3
AC × 12
TLE × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, random_31.txt, random_32.txt, random_33.txt, random_34.txt, random_35.txt, random_36.txt, random_37.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
random_01.txt TLE 2233 ms 404684 KiB
random_02.txt TLE 2233 ms 385336 KiB
random_03.txt TLE 2232 ms 378020 KiB
random_04.txt TLE 2232 ms 408964 KiB
random_05.txt TLE 2232 ms 399052 KiB
random_06.txt TLE 2233 ms 375324 KiB
random_07.txt TLE 2234 ms 401148 KiB
random_08.txt TLE 2233 ms 400396 KiB
random_09.txt TLE 2231 ms 372436 KiB
random_10.txt TLE 2236 ms 416756 KiB
random_11.txt TLE 2232 ms 397256 KiB
random_12.txt TLE 2232 ms 372800 KiB
random_13.txt TLE 2235 ms 404852 KiB
random_14.txt TLE 2231 ms 385876 KiB
random_15.txt TLE 2232 ms 373352 KiB
random_16.txt TLE 2233 ms 407828 KiB
random_17.txt TLE 2232 ms 385412 KiB
random_18.txt TLE 2232 ms 377472 KiB
random_19.txt TLE 2232 ms 401600 KiB
random_20.txt TLE 2233 ms 398532 KiB
random_21.txt TLE 2231 ms 372112 KiB
random_22.txt TLE 2234 ms 402988 KiB
random_23.txt TLE 2232 ms 383240 KiB
random_24.txt TLE 2231 ms 382808 KiB
random_25.txt AC 63 ms 81160 KiB
random_26.txt AC 65 ms 81288 KiB
random_27.txt AC 71 ms 81348 KiB
random_28.txt AC 59 ms 76452 KiB
random_29.txt AC 58 ms 76492 KiB
random_30.txt AC 58 ms 76376 KiB
random_31.txt AC 81 ms 82248 KiB
random_32.txt AC 80 ms 82400 KiB
random_33.txt AC 489 ms 89420 KiB
random_34.txt TLE 2232 ms 369536 KiB
random_35.txt TLE 2232 ms 370804 KiB
random_36.txt TLE 2232 ms 367904 KiB
random_37.txt TLE 2232 ms 380716 KiB
sample_01.txt AC 64 ms 76496 KiB
sample_02.txt AC 64 ms 76348 KiB
sample_03.txt AC 64 ms 76432 KiB


2025-06-18 (Wed)
14:37:26 +09:00