結果
問題 | No.1170 Never Want to Walk |
ユーザー | qumazaki |
提出日時 | 2020-09-05 20:00:15 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,173 bytes |
コンパイル時間 | 351 ms |
コンパイル使用メモリ | 87,248 KB |
実行使用メモリ | 138,048 KB |
最終ジャッジ日時 | 2023-08-19 13:00:17 |
合計ジャッジ時間 | 11,138 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
71,048 KB |
testcase_01 | AC | 69 ms
71,044 KB |
testcase_02 | AC | 67 ms
71,412 KB |
testcase_03 | AC | 68 ms
71,456 KB |
testcase_04 | AC | 69 ms
71,332 KB |
testcase_05 | WA | - |
testcase_06 | AC | 67 ms
71,040 KB |
testcase_07 | AC | 69 ms
71,268 KB |
testcase_08 | AC | 68 ms
71,208 KB |
testcase_09 | AC | 70 ms
71,448 KB |
testcase_10 | AC | 70 ms
71,292 KB |
testcase_11 | AC | 70 ms
71,372 KB |
testcase_12 | AC | 80 ms
75,464 KB |
testcase_13 | AC | 85 ms
75,516 KB |
testcase_14 | AC | 87 ms
75,732 KB |
testcase_15 | AC | 82 ms
75,572 KB |
testcase_16 | AC | 82 ms
75,496 KB |
testcase_17 | AC | 86 ms
75,820 KB |
testcase_18 | AC | 82 ms
75,468 KB |
testcase_19 | AC | 84 ms
75,504 KB |
testcase_20 | AC | 86 ms
75,708 KB |
testcase_21 | AC | 81 ms
75,828 KB |
testcase_22 | AC | 84 ms
75,568 KB |
testcase_23 | AC | 85 ms
75,468 KB |
testcase_24 | AC | 85 ms
75,460 KB |
testcase_25 | AC | 84 ms
75,692 KB |
testcase_26 | AC | 87 ms
75,676 KB |
testcase_27 | AC | 386 ms
136,628 KB |
testcase_28 | AC | 334 ms
135,140 KB |
testcase_29 | AC | 401 ms
136,912 KB |
testcase_30 | AC | 333 ms
136,752 KB |
testcase_31 | AC | 324 ms
134,720 KB |
testcase_32 | AC | 255 ms
135,304 KB |
testcase_33 | AC | 289 ms
135,224 KB |
testcase_34 | AC | 283 ms
136,872 KB |
testcase_35 | AC | 274 ms
136,880 KB |
testcase_36 | AC | 268 ms
135,400 KB |
testcase_37 | AC | 284 ms
136,144 KB |
testcase_38 | AC | 277 ms
138,048 KB |
ソースコード
import sys sys.setrecursionlimit(10**9) class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self,x): if(self.parents[x] < 0): return x self.parents[x] = self.find(self.parents[x]) return self.parents[x] def size(self, x): return self.parents[ self.find(x) ] * -1 def same(self, x, y): x_root = self.find(x) y_root = self.find(y) return (x_root == y_root) def union(self,x,y): x_root = self.find(x) y_root = self.find(y) if(x_root == y_root): return if( self.parents[x_root] <= self.parents[y_root] ): self.parents[x_root] += self.parents[y_root] self.parents[y_root] = x_root else: self.parents[y_root] += self.parents[x_root] self.parents[x_root] = y_root def members(self,x): root = self.find(x) ret = [ i for i in range(self.n) if self.find(i) == root ] return ret def roots(self): ret = [ i for i in range(self.n) if self.parents[i] < 0] return ret def group_count(self): return len(self.roots()) def all_group_members(self): return {r: self.members(r) for r in self.roots()} n,a,b = map(int,input().split()) x = list(map(int,input().split())) cango = [[0,0,0,0] for _ in range(n)] ll,l,r,rr = 0,0,0,0 for i,xi in enumerate(x): while(x[ll] < xi-b): ll += 1 while(x[l] < xi-a): l += 1 if(r < n): while(x[r] < xi+a): r += 1 if(r==n): break if(rr < n): while(x[rr] < xi+b): rr += 1 if(rr==n): break cango[i] = [ll,l,r,rr] uf = UnionFind(n) for i in range(n): r,rr = cango[i][2:4] for j in range(rr-1,r-1,-1): if(uf.same(i,j)): break uf.union(i,j) for i in range(n-1,-1,-1): ll,l = cango[i][0:2] for j in range(ll,l): if(uf.same(i,j)): break uf.union(i,j) ans = [0] * n for i in range(n): ans[i] = uf.size(i) print('\n'.join(map(str,ans)))