結果
問題 | No.1013 〇マス進む |
ユーザー | toyuzuko |
提出日時 | 2023-01-20 18:38:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 494 ms / 2,000 ms |
コード長 | 2,140 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 86,784 KB |
実行使用メモリ | 149,652 KB |
最終ジャッジ日時 | 2023-09-05 11:30:19 |
合計ジャッジ時間 | 23,762 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 179 ms
80,148 KB |
testcase_01 | AC | 174 ms
80,120 KB |
testcase_02 | AC | 180 ms
80,168 KB |
testcase_03 | AC | 190 ms
81,752 KB |
testcase_04 | AC | 186 ms
81,644 KB |
testcase_05 | AC | 189 ms
81,772 KB |
testcase_06 | AC | 186 ms
81,680 KB |
testcase_07 | AC | 191 ms
82,064 KB |
testcase_08 | AC | 188 ms
81,656 KB |
testcase_09 | AC | 192 ms
82,168 KB |
testcase_10 | AC | 194 ms
82,088 KB |
testcase_11 | AC | 191 ms
81,672 KB |
testcase_12 | AC | 195 ms
82,160 KB |
testcase_13 | AC | 217 ms
82,876 KB |
testcase_14 | AC | 294 ms
113,288 KB |
testcase_15 | AC | 366 ms
134,864 KB |
testcase_16 | AC | 339 ms
129,632 KB |
testcase_17 | AC | 279 ms
108,752 KB |
testcase_18 | AC | 305 ms
116,172 KB |
testcase_19 | AC | 257 ms
100,480 KB |
testcase_20 | AC | 392 ms
146,940 KB |
testcase_21 | AC | 267 ms
106,540 KB |
testcase_22 | AC | 300 ms
117,312 KB |
testcase_23 | AC | 233 ms
92,220 KB |
testcase_24 | AC | 395 ms
148,544 KB |
testcase_25 | AC | 383 ms
147,744 KB |
testcase_26 | AC | 237 ms
92,004 KB |
testcase_27 | AC | 270 ms
104,684 KB |
testcase_28 | AC | 238 ms
92,480 KB |
testcase_29 | AC | 381 ms
145,644 KB |
testcase_30 | AC | 268 ms
102,264 KB |
testcase_31 | AC | 321 ms
123,304 KB |
testcase_32 | AC | 277 ms
112,016 KB |
testcase_33 | AC | 289 ms
111,936 KB |
testcase_34 | AC | 365 ms
132,028 KB |
testcase_35 | AC | 378 ms
128,328 KB |
testcase_36 | AC | 214 ms
83,128 KB |
testcase_37 | AC | 208 ms
82,820 KB |
testcase_38 | AC | 381 ms
136,116 KB |
testcase_39 | AC | 266 ms
97,752 KB |
testcase_40 | AC | 407 ms
131,656 KB |
testcase_41 | AC | 245 ms
93,024 KB |
testcase_42 | AC | 307 ms
110,344 KB |
testcase_43 | AC | 270 ms
98,988 KB |
testcase_44 | AC | 310 ms
112,556 KB |
testcase_45 | AC | 292 ms
108,332 KB |
testcase_46 | AC | 250 ms
93,840 KB |
testcase_47 | AC | 297 ms
110,280 KB |
testcase_48 | AC | 311 ms
116,524 KB |
testcase_49 | AC | 395 ms
130,328 KB |
testcase_50 | AC | 341 ms
123,212 KB |
testcase_51 | AC | 340 ms
118,500 KB |
testcase_52 | AC | 232 ms
88,252 KB |
testcase_53 | AC | 242 ms
91,388 KB |
testcase_54 | AC | 335 ms
128,044 KB |
testcase_55 | AC | 251 ms
94,440 KB |
testcase_56 | AC | 414 ms
141,052 KB |
testcase_57 | AC | 363 ms
121,968 KB |
testcase_58 | AC | 494 ms
149,624 KB |
testcase_59 | AC | 450 ms
149,580 KB |
testcase_60 | AC | 422 ms
149,616 KB |
testcase_61 | AC | 375 ms
149,420 KB |
testcase_62 | AC | 354 ms
149,652 KB |
testcase_63 | AC | 179 ms
80,156 KB |
testcase_64 | AC | 179 ms
80,156 KB |
ソースコード
from typing import List, Generic, Optional, Callable, TypeVar S = TypeVar('S') class FunctionalGraph(Generic[S]): def __init__(self, n: int, edge_to: List[S], node_val: Optional[List[S]] = None, nxt_node_val: Optional[List[S]] = None, op: Optional[Callable[[int, int], int]] = lambda fr, to: to) -> None: if node_val is None: node_val = list(range(n)) if nxt_node_val is None: nxt_node_val = [node_val[edge_to[i]] for i in range(n)] self.n = n self.edge_to = edge_to self.node_val = node_val self.nxt_node_val = nxt_node_val self.op = op self.built = False def build_doubling(self, bit_max: int = 31): self.built = True self.bit_max = bit_max self.dub = [[-1] * self.n for _ in range(self.bit_max)] self.dp = [[-1] * self.n for _ in range(self.bit_max)] for i in range(self.n): self.dub[0][i] = self.edge_to[i] self.dp[0][i] = self.nxt_node_val[i] for i in range(1, self.bit_max): for j in range(self.n): if self.dub[i - 1][j] != -1: self.dub[i][j] = self.dub[i - 1][self.dub[i - 1][j]] self.dp[i][j] = self.op(self.dp[i - 1][j], self.dp[i - 1][self.dub[i - 1][j]]) def get(self, v: int, k: int) -> int: if not self.built: self.build_doubling() for i in range(1, self.bit_max): if k & (1 << i): v = self.dub[i][v] return v def prod(self, v: int, k: int) -> S: if not self.built: self.build_doubling() res = self.node_val[v] for i in range(self.bit_max): if k & (1 << i): res = self.op(res, self.dp[i][v]) v = self.dub[i][v] return res N, K = map(int, input().split()) P = list(map(int, input().split())) edge_to = [(i + P[i]) % N for i in range(N)] node_val = list(range(N)) nxt_node_val = [i + P[i] for i in range(N)] op = lambda fr, to: to + fr // N * N F = FunctionalGraph(N, edge_to, node_val, nxt_node_val, op) for i in range(N): res = F.prod(i, K) print(res + 1)