結果
問題 | No.2565 はじめてのおつかい |
ユーザー | 21kazu13 |
提出日時 | 2023-12-04 14:56:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 1,521 bytes |
コンパイル時間 | 360 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 90,812 KB |
最終ジャッジ日時 | 2023-12-04 14:56:32 |
合計ジャッジ時間 | 9,122 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
65,796 KB |
testcase_01 | AC | 56 ms
65,796 KB |
testcase_02 | AC | 59 ms
65,796 KB |
testcase_03 | AC | 191 ms
90,812 KB |
testcase_04 | AC | 130 ms
90,812 KB |
testcase_05 | AC | 55 ms
65,796 KB |
testcase_06 | AC | 140 ms
80,764 KB |
testcase_07 | AC | 111 ms
78,564 KB |
testcase_08 | AC | 126 ms
80,376 KB |
testcase_09 | AC | 133 ms
80,228 KB |
testcase_10 | AC | 130 ms
80,260 KB |
testcase_11 | AC | 201 ms
85,036 KB |
testcase_12 | AC | 99 ms
78,052 KB |
testcase_13 | AC | 124 ms
79,972 KB |
testcase_14 | AC | 152 ms
82,572 KB |
testcase_15 | AC | 154 ms
81,884 KB |
testcase_16 | AC | 121 ms
85,900 KB |
testcase_17 | AC | 82 ms
77,924 KB |
testcase_18 | AC | 85 ms
79,888 KB |
testcase_19 | AC | 181 ms
83,680 KB |
testcase_20 | AC | 144 ms
83,396 KB |
testcase_21 | AC | 132 ms
83,276 KB |
testcase_22 | AC | 109 ms
81,008 KB |
testcase_23 | AC | 124 ms
81,248 KB |
testcase_24 | AC | 86 ms
77,928 KB |
testcase_25 | AC | 157 ms
83,672 KB |
testcase_26 | AC | 127 ms
81,088 KB |
testcase_27 | AC | 153 ms
83,968 KB |
testcase_28 | AC | 160 ms
83,532 KB |
testcase_29 | AC | 161 ms
85,728 KB |
testcase_30 | AC | 134 ms
84,524 KB |
testcase_31 | AC | 151 ms
83,672 KB |
testcase_32 | AC | 122 ms
81,100 KB |
testcase_33 | AC | 145 ms
84,380 KB |
testcase_34 | AC | 187 ms
82,836 KB |
testcase_35 | AC | 135 ms
85,636 KB |
testcase_36 | AC | 172 ms
84,376 KB |
testcase_37 | AC | 136 ms
81,240 KB |
testcase_38 | AC | 145 ms
82,836 KB |
testcase_39 | AC | 153 ms
81,892 KB |
testcase_40 | AC | 171 ms
85,084 KB |
testcase_41 | AC | 163 ms
86,288 KB |
testcase_42 | AC | 123 ms
80,680 KB |
testcase_43 | AC | 136 ms
82,440 KB |
testcase_44 | AC | 124 ms
79,860 KB |
testcase_45 | AC | 99 ms
78,308 KB |
testcase_46 | AC | 155 ms
82,148 KB |
testcase_47 | AC | 123 ms
79,204 KB |
testcase_48 | AC | 132 ms
79,976 KB |
testcase_49 | AC | 99 ms
78,052 KB |
testcase_50 | AC | 127 ms
79,716 KB |
testcase_51 | AC | 56 ms
65,796 KB |
testcase_52 | AC | 98 ms
78,032 KB |
ソースコード
#!/usr/bin/env python3 import sys from bisect import bisect_left, bisect_right, insort_left, insort_right # type: ignore from collections import Counter, defaultdict, deque # type: ignore from math import gcd, sqrt, ceil, factorial # type: ignore from heapq import heapify, heappop, heappush, heappushpop, heapreplace, merge # type: ignore from itertools import accumulate, combinations, permutations, product # type: ignore from string import ascii_lowercase, ascii_uppercase # type: ignore def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def I(): return int(sys.stdin.buffer.readline()) def LS(): return sys.stdin.buffer.readline().rstrip().decode("utf-8").split() def S(): return sys.stdin.buffer.readline().rstrip().decode("utf-8") def IR(n): return [I() for _ in range(n)] def LIR(n): return [LI() for _ in range(n)] def SR(n): return [S() for _ in range(n)] def LSR(n): return [LS() for _ in range(n)] def SRL(n): return [list(S()) for _ in range(n)] N,M = LI() G = [[] for _ in range(N)] for _ in range(M): u,v = LI() u-=1 v-=1 G[u].append(v) INF = 10**9 def bfs(s): dist = [INF]*N dist[s] = 0 q = deque([s]) while q: v = q.popleft() cur = dist[v] for nex in G[v]: if dist[nex]<INF: continue dist[nex] = cur+1 q.append(nex) return dist d0 = bfs(0) dn2 = bfs(N-2) dn1 = bfs(N-1) ans = min( INF, d0[N-2]+dn2[N-1]+dn1[0], d0[N-1]+dn1[N-2]+dn2[0] ) print(ans if ans<INF else -1)