Submission #73162334

Source Code Expand

import numpy as np

n, m, k = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]

dp = np.full((n, m), -1)
for i in range(n):
    if i == 0:
        dp[0][l[0][1]-1] = l[0][0]
    else:
        top = max(0, i-k)
        bottom = n-1
        t = dp[top:bottom+1].max(axis=0)
        for j in range(len(t)):
            if t[j] != -1:
                try:
                    dp[i][j+l[i][1]] = t[j]+l[i][0]
                except:
                    break
            dp[i][l[i][1]-1] = l[i][0]
print(dp.max())

Submission Info

Submission Time
Task D - Merchant on the Highway
User chachamusics
Language Python (CPython 3.13.7)
Score 0
Code Size 563 Byte
Status WA
Exec Time 100 ms
Memory 26788 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 66
WA × 3
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt
Case Name Status Exec Time Memory
in01.txt AC 70 ms 26424 KiB
in02.txt AC 72 ms 26272 KiB
in03.txt AC 71 ms 26496 KiB
in04.txt AC 70 ms 26464 KiB
in05.txt AC 74 ms 26232 KiB
in06.txt AC 86 ms 26548 KiB
in07.txt AC 71 ms 26576 KiB
in08.txt AC 71 ms 26412 KiB
in09.txt AC 71 ms 26472 KiB
in10.txt AC 76 ms 26456 KiB
in11.txt AC 86 ms 26708 KiB
in12.txt AC 81 ms 26756 KiB
in13.txt WA 71 ms 26280 KiB
in14.txt WA 71 ms 26360 KiB
in15.txt WA 70 ms 26436 KiB
in16.txt AC 92 ms 26788 KiB
in17.txt AC 92 ms 26544 KiB
in18.txt AC 70 ms 26468 KiB
in19.txt AC 85 ms 26624 KiB
in20.txt AC 86 ms 26544 KiB
in21.txt AC 93 ms 26784 KiB
in22.txt AC 93 ms 26604 KiB
in23.txt AC 93 ms 26540 KiB
in24.txt AC 93 ms 26452 KiB
in25.txt AC 93 ms 26604 KiB
in26.txt AC 82 ms 26556 KiB
in27.txt AC 84 ms 26628 KiB
in28.txt AC 84 ms 26684 KiB
in29.txt AC 71 ms 26484 KiB
in30.txt AC 71 ms 26424 KiB
in31.txt AC 72 ms 26444 KiB
in32.txt AC 72 ms 26616 KiB
in33.txt AC 70 ms 26472 KiB
in34.txt AC 71 ms 26580 KiB
in35.txt AC 71 ms 26512 KiB
in36.txt AC 72 ms 26360 KiB
in37.txt AC 94 ms 26760 KiB
in38.txt AC 93 ms 26684 KiB
in39.txt AC 71 ms 26424 KiB
in40.txt AC 71 ms 26564 KiB
in41.txt AC 71 ms 26396 KiB
in42.txt AC 71 ms 26496 KiB
in43.txt AC 71 ms 26556 KiB
in44.txt AC 79 ms 26580 KiB
in45.txt AC 95 ms 26616 KiB
in46.txt AC 96 ms 26548 KiB
in47.txt AC 97 ms 26556 KiB
in48.txt AC 89 ms 26540 KiB
in49.txt AC 80 ms 26576 KiB
in50.txt AC 96 ms 26784 KiB
in51.txt AC 100 ms 26712 KiB
in52.txt AC 94 ms 26660 KiB
in53.txt AC 71 ms 26484 KiB
in54.txt AC 71 ms 26356 KiB
in55.txt AC 70 ms 26292 KiB
in56.txt AC 71 ms 26284 KiB
in57.txt AC 71 ms 26460 KiB
in58.txt AC 71 ms 26356 KiB
in59.txt AC 70 ms 26308 KiB
in60.txt AC 70 ms 26472 KiB
in61.txt AC 70 ms 26384 KiB
in62.txt AC 70 ms 26448 KiB
in63.txt AC 71 ms 26468 KiB
in64.txt AC 71 ms 26392 KiB
in65.txt AC 70 ms 26532 KiB
in66.txt AC 70 ms 26364 KiB
sample01.txt AC 71 ms 26460 KiB
sample02.txt AC 71 ms 26572 KiB
sample03.txt AC 71 ms 26472 KiB