Submission #1605970
Source Code Expand
N,M = map(int,input().split()) es = [] for i in range(M): a,b,c = map(int,input().split()) a,b = a-1, b-1 c *= -1 es.append((a,b,c)) INF = 10**10 def solve(): d = [INF for i in range(N)] d[0] = 0 for i in range(N): for fr,to,cost in es: if d[to] > d[fr] + cost: d[to] = d[fr] + cost if i == N-1 and to == N-1: return 'inf' return -d[N-1] print(solve())
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | prd_xxx |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 459 Byte |
Status | WA |
Exec Time | 454 ms |
Memory | 3316 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 16 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_1.txt | WA | 37 ms | 3064 KB |
subtask_1_10.txt | AC | 17 ms | 3064 KB |
subtask_1_11.txt | AC | 55 ms | 3064 KB |
subtask_1_12.txt | AC | 261 ms | 3308 KB |
subtask_1_13.txt | AC | 19 ms | 3064 KB |
subtask_1_14.txt | AC | 269 ms | 3188 KB |
subtask_1_15.txt | AC | 454 ms | 3312 KB |
subtask_1_16.txt | AC | 17 ms | 3064 KB |
subtask_1_17.txt | AC | 18 ms | 3064 KB |
subtask_1_18.txt | AC | 100 ms | 3316 KB |
subtask_1_19.txt | AC | 158 ms | 3312 KB |
subtask_1_2.txt | WA | 122 ms | 3188 KB |
subtask_1_20.txt | AC | 21 ms | 3064 KB |
subtask_1_21.txt | AC | 97 ms | 3188 KB |
subtask_1_22.txt | AC | 230 ms | 3316 KB |
subtask_1_23.txt | AC | 17 ms | 3064 KB |
subtask_1_24.txt | AC | 130 ms | 3188 KB |
subtask_1_25.txt | AC | 58 ms | 3064 KB |
subtask_1_26.txt | AC | 117 ms | 3188 KB |
subtask_1_27.txt | AC | 265 ms | 3188 KB |
subtask_1_3.txt | AC | 78 ms | 3188 KB |
subtask_1_4.txt | AC | 120 ms | 3188 KB |
subtask_1_5.txt | AC | 96 ms | 3064 KB |
subtask_1_6.txt | AC | 252 ms | 3188 KB |
subtask_1_7.txt | AC | 98 ms | 3064 KB |
subtask_1_8.txt | AC | 109 ms | 3188 KB |
subtask_1_9.txt | AC | 17 ms | 3064 KB |