結果
問題 | No.1170 Never Want to Walk |
ユーザー | terasa |
提出日時 | 2022-05-24 11:45:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 852 ms / 2,000 ms |
コード長 | 2,349 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 81,844 KB |
実行使用メモリ | 106,892 KB |
最終ジャッジ日時 | 2023-10-20 17:56:34 |
合計ジャッジ時間 | 13,759 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,888 KB |
testcase_01 | AC | 46 ms
55,888 KB |
testcase_02 | AC | 43 ms
55,888 KB |
testcase_03 | AC | 43 ms
55,888 KB |
testcase_04 | AC | 43 ms
55,888 KB |
testcase_05 | AC | 44 ms
55,888 KB |
testcase_06 | AC | 43 ms
55,888 KB |
testcase_07 | AC | 44 ms
55,888 KB |
testcase_08 | AC | 44 ms
55,888 KB |
testcase_09 | AC | 43 ms
55,888 KB |
testcase_10 | AC | 42 ms
55,888 KB |
testcase_11 | AC | 42 ms
55,888 KB |
testcase_12 | AC | 67 ms
72,304 KB |
testcase_13 | AC | 78 ms
75,792 KB |
testcase_14 | AC | 78 ms
75,856 KB |
testcase_15 | AC | 69 ms
72,308 KB |
testcase_16 | AC | 70 ms
72,668 KB |
testcase_17 | AC | 78 ms
75,760 KB |
testcase_18 | AC | 67 ms
72,304 KB |
testcase_19 | AC | 71 ms
72,896 KB |
testcase_20 | AC | 79 ms
75,840 KB |
testcase_21 | AC | 69 ms
72,304 KB |
testcase_22 | AC | 77 ms
75,864 KB |
testcase_23 | AC | 80 ms
75,848 KB |
testcase_24 | AC | 77 ms
75,836 KB |
testcase_25 | AC | 77 ms
75,888 KB |
testcase_26 | AC | 78 ms
75,780 KB |
testcase_27 | AC | 794 ms
106,196 KB |
testcase_28 | AC | 800 ms
104,248 KB |
testcase_29 | AC | 768 ms
106,892 KB |
testcase_30 | AC | 828 ms
106,368 KB |
testcase_31 | AC | 778 ms
104,276 KB |
testcase_32 | AC | 803 ms
106,220 KB |
testcase_33 | AC | 817 ms
103,748 KB |
testcase_34 | AC | 820 ms
106,416 KB |
testcase_35 | AC | 852 ms
106,368 KB |
testcase_36 | AC | 832 ms
104,264 KB |
testcase_37 | AC | 761 ms
104,304 KB |
testcase_38 | AC | 785 ms
106,500 KB |
ソースコード
import sys import pypyjit import itertools import heapq import math from collections import deque, defaultdict, Counter import bisect input = sys.stdin.readline sys.setrecursionlimit(10 ** 6) pypyjit.set_param('max_unroll_recursion=-1') class UnionFind: def __init__(self, N): self.N = N self.par = [-1] * N self.l = [i for i in range(N)] self.r = [i for i in range(N)] def find(self, x): if self.par[x] < 0: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def left(self, x): return self.l[self.find(x)] def right(self, x): return self.r[self.find(x)] def unite(self, x, y): x = self.find(x) y = self.find(y) if x == y: return False if x > y: x, y = y, x self.par[x] += self.par[y] self.l[x] = min(self.l[x], self.l[y]) self.r[x] = max(self.r[x], self.r[y]) self.par[y] = x return True def unite_range(self, x, y): if x > y: return while self.right(x) < y: self.unite(self.right(x), self.right(x) + 1) def same(self, x, y): return self.find(x) == self.find(y) def size(self, x): return -self.par[self.find(x)] def roots(self): return [i for i in range(self.N) if self.par[i] < 0] def members(self, x): p = self.find(x) return [i for i in range(self.N) if self.find(i) == p] def index_lt(a, x): 'return largest index s.t. A[i] < x or -1 if it does not exist' return bisect.bisect_left(a, x) - 1 def index_le(a, x): 'return largest index s.t. A[i] <= x or -1 if it does not exist' return bisect.bisect_right(a, x) - 1 def index_gt(a, x): 'return smallest index s.t. A[i] > x or len(a) if it does not exist' return bisect.bisect_right(a, x) def index_ge(a, x): 'return smallest index s.t. A[i] >= x or len(a) if it does not exist' return bisect.bisect_left(a, x) N, A, B = map(int, input().split()) X = list(map(int, input().split())) uf = UnionFind(N) cnt = N for i, x in enumerate(X): a = index_ge(X, x + A) b = index_le(X, x + B) if a > b: continue uf.unite_range(a, b) uf.unite(i, a) for i in range(N): print(uf.size(i))