結果
問題 | No.1868 Teleporting Cyanmond |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 18:38:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 305 ms / 2,000 ms |
コード長 | 1,808 bytes |
コンパイル時間 | 398 ms |
コンパイル使用メモリ | 87,256 KB |
実行使用メモリ | 112,392 KB |
最終ジャッジ日時 | 2023-09-24 07:31:43 |
合計ジャッジ時間 | 10,787 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,392 KB |
testcase_01 | AC | 239 ms
92,500 KB |
testcase_02 | AC | 243 ms
92,208 KB |
testcase_03 | AC | 305 ms
112,392 KB |
testcase_04 | AC | 272 ms
106,728 KB |
testcase_05 | AC | 247 ms
93,636 KB |
testcase_06 | AC | 247 ms
93,972 KB |
testcase_07 | AC | 261 ms
101,064 KB |
testcase_08 | AC | 257 ms
97,352 KB |
testcase_09 | AC | 259 ms
100,456 KB |
testcase_10 | AC | 269 ms
109,188 KB |
testcase_11 | AC | 244 ms
93,768 KB |
testcase_12 | AC | 252 ms
94,932 KB |
testcase_13 | AC | 268 ms
100,336 KB |
testcase_14 | AC | 286 ms
109,596 KB |
testcase_15 | AC | 278 ms
105,360 KB |
testcase_16 | AC | 254 ms
93,624 KB |
testcase_17 | AC | 258 ms
95,528 KB |
testcase_18 | AC | 298 ms
111,948 KB |
testcase_19 | AC | 294 ms
111,936 KB |
testcase_20 | AC | 292 ms
111,800 KB |
testcase_21 | AC | 296 ms
111,892 KB |
testcase_22 | AC | 291 ms
111,780 KB |
testcase_23 | AC | 299 ms
112,192 KB |
testcase_24 | AC | 303 ms
111,940 KB |
testcase_25 | AC | 296 ms
112,084 KB |
testcase_26 | AC | 300 ms
111,460 KB |
testcase_27 | AC | 303 ms
111,644 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): n = int(input()) r = i_list() nums = [[] for i in range(n)] now = 0 for i in range(n-1): for j in range(now+1, r[i]): nums[i].append(j) now = j que = deque() que.append(0) dist = [INF] * n dist[0] = 0 while que: point = que.popleft() for i in nums[point]: if dist[i] == INF: dist[i] = dist[point] + 1 que.append(i) print(dist[n-1]) if __name__ == '__main__': main()