xxxxxxxxxx
import collections
N, M = map(int, input().split())
ABST = [list(map(int, input().split())) for i in range(M)]
ABST = sorted(ABST, key=lambda x: x[2])
d = collections.defaultdict(lambda: float('inf'))
d[1]=0
for a,b,s,t in ABST:
if d[a]<=s:
d[b] = min(d[b],t)
if d[N]==float('inf'):
print(-1)
else:
print(d[N])
提出日時 | |
ユーザー | ![]() |
言語 | Python3 (pypy3 7.3.1) |
結果 | AC |
実行時間 | 437 ms |
メモリ | 102120 kb |
テストケース名 | 結果 | 実行時間 | メモリ |
---|---|---|---|
hand-01.txt | AC | 74 ms | 64644 kb |
hand-02.txt | AC | 57 ms | 64556 kb |
hand-03.txt | AC | 56 ms | 64288 kb |
hand-04.txt | AC | 57 ms | 64492 kb |
hand-05.txt | AC | 61 ms | 64496 kb |
large-01.txt | AC | 290 ms | 86768 kb |
large-02.txt | AC | 308 ms | 88420 kb |
sample-01.txt | AC | 56 ms | 64480 kb |
sample-02.txt | AC | 60 ms | 64396 kb |
sample-03.txt | AC | 56 ms | 64312 kb |
small-01.txt | AC | 60 ms | 65116 kb |
small-02.txt | AC | 58 ms | 64740 kb |
small-03.txt | AC | 58 ms | 65248 kb |
small-04.txt | AC | 58 ms | 65176 kb |
sparse-01.txt | AC | 421 ms | 102120 kb |
sparse-02.txt | AC | 315 ms | 92644 kb |
tree-01.txt | AC | 161 ms | 80756 kb |
tree-02.txt | AC | 437 ms | 94188 kb |