結果
問題 | No.2565 はじめてのおつかい |
ユーザー | Theta |
提出日時 | 2023-12-15 16:04:10 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 577 ms / 2,000 ms |
コード長 | 1,426 bytes |
コンパイル時間 | 153 ms |
コンパイル使用メモリ | 12,032 KB |
実行使用メモリ | 48,992 KB |
最終ジャッジ日時 | 2023-12-15 16:04:28 |
合計ジャッジ時間 | 17,121 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
10,848 KB |
testcase_01 | AC | 38 ms
10,848 KB |
testcase_02 | AC | 34 ms
10,848 KB |
testcase_03 | AC | 577 ms
48,992 KB |
testcase_04 | AC | 480 ms
48,992 KB |
testcase_05 | AC | 33 ms
10,848 KB |
testcase_06 | AC | 325 ms
22,112 KB |
testcase_07 | AC | 186 ms
16,992 KB |
testcase_08 | AC | 170 ms
17,248 KB |
testcase_09 | AC | 302 ms
21,216 KB |
testcase_10 | AC | 228 ms
18,144 KB |
testcase_11 | AC | 413 ms
30,304 KB |
testcase_12 | AC | 144 ms
14,816 KB |
testcase_13 | AC | 206 ms
17,760 KB |
testcase_14 | AC | 340 ms
24,032 KB |
testcase_15 | AC | 335 ms
23,008 KB |
testcase_16 | AC | 343 ms
36,960 KB |
testcase_17 | AC | 94 ms
14,688 KB |
testcase_18 | AC | 120 ms
21,728 KB |
testcase_19 | AC | 395 ms
27,744 KB |
testcase_20 | AC | 342 ms
26,336 KB |
testcase_21 | AC | 314 ms
26,464 KB |
testcase_22 | AC | 192 ms
21,344 KB |
testcase_23 | AC | 233 ms
21,216 KB |
testcase_24 | AC | 66 ms
13,024 KB |
testcase_25 | AC | 341 ms
26,720 KB |
testcase_26 | AC | 221 ms
20,320 KB |
testcase_27 | AC | 316 ms
28,000 KB |
testcase_28 | AC | 387 ms
27,232 KB |
testcase_29 | AC | 420 ms
32,096 KB |
testcase_30 | AC | 349 ms
29,792 KB |
testcase_31 | AC | 352 ms
27,104 KB |
testcase_32 | AC | 213 ms
20,320 KB |
testcase_33 | AC | 345 ms
28,768 KB |
testcase_34 | AC | 392 ms
25,184 KB |
testcase_35 | AC | 352 ms
32,864 KB |
testcase_36 | AC | 361 ms
28,640 KB |
testcase_37 | AC | 223 ms
20,832 KB |
testcase_38 | AC | 361 ms
25,440 KB |
testcase_39 | AC | 305 ms
22,496 KB |
testcase_40 | AC | 397 ms
31,968 KB |
testcase_41 | AC | 440 ms
33,760 KB |
testcase_42 | AC | 228 ms
19,680 KB |
testcase_43 | AC | 316 ms
24,160 KB |
testcase_44 | AC | 177 ms
17,376 KB |
testcase_45 | AC | 111 ms
15,072 KB |
testcase_46 | AC | 366 ms
23,776 KB |
testcase_47 | AC | 273 ms
19,808 KB |
testcase_48 | AC | 206 ms
17,888 KB |
testcase_49 | AC | 143 ms
14,432 KB |
testcase_50 | AC | 334 ms
19,680 KB |
testcase_51 | AC | 34 ms
10,848 KB |
testcase_52 | AC | 322 ms
21,600 KB |
ソースコード
from collections import deque from math import inf, isinf from typing import Iterable import sys def printe(*args, end="\n"): print(*args, end=end, file=sys.stderr) def distance_bfs(graph: list[Iterable[int]], dep: int) -> list[int | float]: distance = [inf for _ in graph] distance[dep] = 0 queue = deque() queue.append(dep) while queue: current = queue.popleft() for neighbor in graph[current]: if distance[neighbor] > distance[current] + 1: distance[neighbor] = distance[current] + 1 queue.append(neighbor) return distance def main(): N, M = map(int, input().split()) graph: list[set[int]] = [set() for _ in range(N)] for _ in range(M): dep, dest = map(lambda n: int(n) - 1, input().split()) graph[dep].add(dest) from_1_distance = distance_bfs(graph, 0) from_N_distance = distance_bfs(graph, N - 1) from_N_1_distance = distance_bfs(graph, N - 2) # 先にN-1を通る場合 distance_cand = from_1_distance[N - 2] + \ from_N_1_distance[N - 1] + from_N_distance[0] # 先にNを通る場合 distance_cand2 = from_1_distance[N - 1] + \ from_N_distance[N - 2] + from_N_1_distance[0] min_distance = min(distance_cand, distance_cand2) if isinf(min_distance): print(-1) else: print(min_distance) if __name__ == "__main__": main()