Submission #66759882

Source Code Expand

Copy
n,h,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
dp=[-1]*(h+1)
dp[0]=m
for i in range(n):
    a,b=ab[i]
    ndp=[-1]*(h+1)
    for j in range(h+1):
        if dp[j]<0:continue
        if j+a<=h:
            if ndp[j+a]<dp[j]:
                ndp[j+a]=dp[j]
        if dp[j]>=b:
            nm=dp[j]-b
            if ndp[j]<nm:
                ndp[j]=nm
    if max(ndp)<0:
        print(i)
        exit()
    dp=ndp
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
n,h,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]

dp=[-1]*(h+1)
dp[0]=m
for i in range(n):
    a,b=ab[i]
    ndp=[-1]*(h+1)
    for j in range(h+1):
        if dp[j]<0:continue
        if j+a<=h:
            if ndp[j+a]<dp[j]:
                ndp[j+a]=dp[j]
        if dp[j]>=b:
            nm=dp[j]-b
            if ndp[j]<nm:
                ndp[j]=nm
    if max(ndp)<0:
        print(i)
        exit()
    dp=ndp
print(n)

Submission Info

Submission Time
Task E - Battles in a Row
User juten
Language Python (PyPy 3.10-v7.3.12)
Score 450
Code Size 481 Byte
Status AC
Exec Time 160 ms
Memory 84316 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 3
AC × 40
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 AC 86 ms 83704 KiB
random_02.txt AC 108 ms 84244 KiB
random_03.txt AC 113 ms 83716 KiB
random_04.txt AC 80 ms 81740 KiB
random_05.txt AC 102 ms 83912 KiB
random_06.txt AC 94 ms 83176 KiB
random_07.txt AC 103 ms 83912 KiB
random_08.txt AC 110 ms 83684 KiB
random_09.txt AC 130 ms 84080 KiB
random_10.txt AC 89 ms 82476 KiB
random_11.txt AC 109 ms 83592 KiB
random_12.txt AC 120 ms 83656 KiB
random_13.txt AC 75 ms 81352 KiB
random_14.txt AC 97 ms 83208 KiB
random_15.txt AC 115 ms 83604 KiB
random_16.txt AC 87 ms 82160 KiB
random_17.txt AC 94 ms 82980 KiB
random_18.txt AC 83 ms 83048 KiB
random_19.txt AC 88 ms 83044 KiB
random_20.txt AC 97 ms 84076 KiB
random_21.txt AC 126 ms 83636 KiB
random_22.txt AC 87 ms 82360 KiB
random_23.txt AC 100 ms 83344 KiB
random_24.txt AC 104 ms 83520 KiB
random_25.txt AC 66 ms 81284 KiB
random_26.txt AC 65 ms 81516 KiB
random_27.txt AC 72 ms 81360 KiB
random_28.txt AC 60 ms 76436 KiB
random_29.txt AC 59 ms 76640 KiB
random_30.txt AC 62 ms 81028 KiB
random_31.txt AC 110 ms 83976 KiB
random_32.txt AC 110 ms 83592 KiB
random_33.txt AC 145 ms 83772 KiB
random_34.txt AC 160 ms 83712 KiB
random_35.txt AC 152 ms 84316 KiB
random_36.txt AC 159 ms 83744 KiB
random_37.txt AC 160 ms 83864 KiB
sample_01.txt AC 61 ms 76760 KiB
sample_02.txt AC 63 ms 80764 KiB
sample_03.txt AC 59 ms 76824 KiB
Facebook Twitter Telegram Share

2025-06-14 (Sat)
22:44:17 +09:00

More…