提出 #72552799

ソースコード 拡げる

N,M,L,S,T=map(int,input().split())
PT=[[] for i in range(N)]
PC=[[] for i in range(N)]
ans=set()
for i in range(M) :
    u,v,c=map(int,input().split())
    u-=1
    v-=1
    PT[u].append(v)
    PC[u].append(c)
W=[]
def DFS(i,turn,cost):
    global ans
    global W
    W.append(i+1)
    if turn==0 :
        if cost>=S and cost<=T :
            ans.add(i)
    else :
        for k in range(len(PT[i])) :
            y=PT[i][k]
            z=PC[i][k]
            DFS(y,turn-1,cost+z)
    del W[-1]
DFS(0,L,0)
B=sorted(list(ans))
for i in range(len(B)) :
    print(B[i]+1,end=" ")
print()

提出情報

提出日時
問題 D - Paid Walk
ユーザ Youteru
言語 Python (PyPy 3.11-v7.3.20)
得点 400
コード長 616 Byte
結果 AC
実行時間 684 ms
メモリ 151788 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 57
セット名 テストケース
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, hand_08.txt, hand_09.txt, hand_10.txt, hand_11.txt, hand_12.txt, hand_13.txt, hand_14.txt, hand_15.txt, hand_16.txt, hand_17.txt, hand_18.txt, hand_19.txt, hand_20.txt, hand_21.txt, hand_22.txt, hand_23.txt, random_00.txt, 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
ケース名 結果 実行時間 メモリ
example_00.txt AC 56 ms 79944 KiB
example_01.txt AC 56 ms 79656 KiB
example_02.txt AC 56 ms 79844 KiB
hand_00.txt AC 491 ms 130644 KiB
hand_01.txt AC 684 ms 151000 KiB
hand_02.txt AC 434 ms 130792 KiB
hand_03.txt AC 530 ms 135616 KiB
hand_04.txt AC 461 ms 132800 KiB
hand_05.txt AC 372 ms 148296 KiB
hand_06.txt AC 131 ms 108848 KiB
hand_07.txt AC 125 ms 108896 KiB
hand_08.txt AC 437 ms 130748 KiB
hand_09.txt AC 437 ms 130948 KiB
hand_10.txt AC 63 ms 98108 KiB
hand_11.txt AC 65 ms 97696 KiB
hand_12.txt AC 449 ms 148196 KiB
hand_13.txt AC 405 ms 148300 KiB
hand_14.txt AC 416 ms 151788 KiB
hand_15.txt AC 477 ms 147552 KiB
hand_16.txt AC 456 ms 135424 KiB
hand_17.txt AC 449 ms 130980 KiB
hand_18.txt AC 471 ms 131108 KiB
hand_19.txt AC 499 ms 130824 KiB
hand_20.txt AC 456 ms 130956 KiB
hand_21.txt AC 478 ms 131140 KiB
hand_22.txt AC 440 ms 130880 KiB
hand_23.txt AC 665 ms 150964 KiB
random_00.txt AC 453 ms 139732 KiB
random_01.txt AC 403 ms 139732 KiB
random_02.txt AC 405 ms 139708 KiB
random_03.txt AC 402 ms 139844 KiB
random_04.txt AC 376 ms 139868 KiB
random_05.txt AC 391 ms 139904 KiB
random_06.txt AC 415 ms 137112 KiB
random_07.txt AC 452 ms 138448 KiB
random_08.txt AC 406 ms 138552 KiB
random_09.txt AC 370 ms 136884 KiB
random_10.txt AC 404 ms 138492 KiB
random_11.txt AC 428 ms 138764 KiB
random_12.txt AC 396 ms 130264 KiB
random_13.txt AC 459 ms 130756 KiB
random_14.txt AC 494 ms 132520 KiB
random_15.txt AC 474 ms 130684 KiB
random_16.txt AC 468 ms 130568 KiB
random_17.txt AC 602 ms 138944 KiB
random_18.txt AC 362 ms 130236 KiB
random_19.txt AC 439 ms 131148 KiB
random_20.txt AC 447 ms 130720 KiB
random_21.txt AC 399 ms 130004 KiB
random_22.txt AC 450 ms 130652 KiB
random_23.txt AC 460 ms 131364 KiB
random_24.txt AC 349 ms 139736 KiB
random_25.txt AC 340 ms 139792 KiB
random_26.txt AC 363 ms 139780 KiB
random_27.txt AC 350 ms 139688 KiB
random_28.txt AC 349 ms 139836 KiB
random_29.txt AC 414 ms 139716 KiB