結果
問題 | No.1170 Never Want to Walk |
ユーザー | Kiri8128 |
提出日時 | 2020-08-16 18:05:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,633 ms / 2,000 ms |
コード長 | 2,028 bytes |
コンパイル時間 | 136 ms |
コンパイル使用メモリ | 82,328 KB |
実行使用メモリ | 478,356 KB |
最終ジャッジ日時 | 2024-04-19 18:27:04 |
合計ジャッジ時間 | 19,316 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
54,244 KB |
testcase_01 | AC | 37 ms
54,320 KB |
testcase_02 | AC | 36 ms
54,848 KB |
testcase_03 | AC | 36 ms
55,812 KB |
testcase_04 | AC | 36 ms
55,832 KB |
testcase_05 | AC | 36 ms
55,268 KB |
testcase_06 | AC | 39 ms
54,936 KB |
testcase_07 | AC | 37 ms
54,928 KB |
testcase_08 | AC | 37 ms
55,264 KB |
testcase_09 | AC | 35 ms
54,864 KB |
testcase_10 | AC | 39 ms
55,108 KB |
testcase_11 | AC | 36 ms
54,940 KB |
testcase_12 | AC | 75 ms
77,420 KB |
testcase_13 | AC | 77 ms
77,392 KB |
testcase_14 | AC | 83 ms
77,448 KB |
testcase_15 | AC | 78 ms
77,484 KB |
testcase_16 | AC | 79 ms
77,280 KB |
testcase_17 | AC | 84 ms
77,400 KB |
testcase_18 | AC | 80 ms
77,432 KB |
testcase_19 | AC | 78 ms
77,380 KB |
testcase_20 | AC | 86 ms
77,392 KB |
testcase_21 | AC | 79 ms
77,252 KB |
testcase_22 | AC | 92 ms
77,408 KB |
testcase_23 | AC | 97 ms
77,556 KB |
testcase_24 | AC | 98 ms
77,340 KB |
testcase_25 | AC | 97 ms
77,556 KB |
testcase_26 | AC | 97 ms
77,356 KB |
testcase_27 | AC | 1,112 ms
313,560 KB |
testcase_28 | AC | 1,077 ms
296,316 KB |
testcase_29 | AC | 1,002 ms
278,744 KB |
testcase_30 | AC | 1,066 ms
280,820 KB |
testcase_31 | AC | 1,113 ms
298,504 KB |
testcase_32 | AC | 1,551 ms
465,176 KB |
testcase_33 | AC | 1,633 ms
434,612 KB |
testcase_34 | AC | 1,416 ms
448,020 KB |
testcase_35 | AC | 1,601 ms
470,784 KB |
testcase_36 | AC | 1,354 ms
454,016 KB |
testcase_37 | AC | 1,377 ms
478,356 KB |
testcase_38 | AC | 1,447 ms
456,800 KB |
ソースコード
from bisect import bisect_right as br from collections import deque class range_edge: def __init__(self, n): self.k = (n-1).bit_length() self.K = 1 << self.k self.KK = self.K * 3 self.E = [[] for _ in range(self.KK)] for i in range(2, self.K * 2): self.E[i >> 1].append(i) for i in range(self.K, self.KK - 2): self.E[i].append(i + self.KK >> 1) self.c = self.KK # Number of Vertices def add_range_edge(self, a, b, c, d): # from [a, b) to [c, d) if a >= b or c >= d: return a -= self.K * 2 b -= self.K * 2 while a < b: if a & 1: self.E[a + self.KK].append(self.c) a += 1 a >>= 1 if b & 1: b -= 1 self.E[b + self.KK].append(self.c) b >>= 1 self.c += 1 self.E.append([self.c]) # cost = 0 self.E.append([]) c += self.K d += self.K while c < d: if c & 1: self.E[self.c].append(c) c += 1 c >>= 1 if d & 1: d -= 1 self.E[self.c].append(d) d >>= 1 self.c += 1 def BFS0(self, i0=0): K = self.K i0 += K Q = deque([i0]) n = self.c done = {i0} while Q: i = Q.popleft() for j in self.E[i]: if j not in done: done.add(j) Q.append(j) return [a - K for a in done if K <= a < 2 * K] N, A, B = map(int, input().split()) re = range_edge(N) X = [int(a) for a in input().split()] for i in range(N): l = br(X, X[i] + A - 1) r = br(X, X[i] + B) re.add_range_edge(i, i + 1, l, r) re.add_range_edge(l, r, i, i + 1) ANS = [0] * N for i in range(N): if ANS[i]: continue bfs = re.BFS0(i) ans = len(bfs) for j in bfs: ANS[j] = ans print(*ANS, sep = "\n")