結果
問題 | No.1950 片道きゃっちぼーる |
ユーザー | chineristAC |
提出日時 | 2022-05-20 22:09:10 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,830 bytes |
コンパイル時間 | 227 ms |
コンパイル使用メモリ | 81,548 KB |
実行使用メモリ | 171,268 KB |
最終ジャッジ日時 | 2023-10-20 12:50:41 |
合計ジャッジ時間 | 10,069 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
56,024 KB |
testcase_01 | AC | 46 ms
56,024 KB |
testcase_02 | AC | 46 ms
56,024 KB |
testcase_03 | AC | 381 ms
169,184 KB |
testcase_04 | AC | 338 ms
170,020 KB |
testcase_05 | AC | 46 ms
56,052 KB |
testcase_06 | AC | 344 ms
163,936 KB |
testcase_07 | AC | 263 ms
152,576 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 338 ms
147,560 KB |
testcase_12 | AC | 348 ms
147,532 KB |
testcase_13 | AC | 399 ms
166,936 KB |
testcase_14 | AC | 400 ms
164,844 KB |
testcase_15 | WA | - |
testcase_16 | AC | 369 ms
164,940 KB |
testcase_17 | WA | - |
testcase_18 | AC | 337 ms
170,760 KB |
testcase_19 | WA | - |
testcase_20 | AC | 287 ms
148,952 KB |
testcase_21 | AC | 413 ms
168,764 KB |
testcase_22 | AC | 393 ms
168,776 KB |
ソースコード
import sys,random,bisect from collections import deque,defaultdict import heapq from itertools import permutations from math import gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) INF = 10**17 class UnionFindVerSize(): def __init__(self, N): self._parent = [n for n in range(0, N)] self._size = [1] * N self.group = N def find_root(self, x): if self._parent[x] == x: return x self._parent[x] = self.find_root(self._parent[x]) stack = [x] while self._parent[stack[-1]]!=stack[-1]: stack.append(self._parent[stack[-1]]) for v in stack: self._parent[v] = stack[-1] return self._parent[x] def unite(self, x, y): gx = self.find_root(x) gy = self.find_root(y) if gx == gy: return self.group -= 1 if self._size[gx] < self._size[gy]: self._parent[gx] = gy self._size[gy] += self._size[gx] else: self._parent[gy] = gx self._size[gx] += self._size[gy] def get_size(self, x): return self._size[self.find_root(x)] def is_same_group(self, x, y): return self.find_root(x) == self.find_root(y) N = int(input()) X = li() A = li() dic = {x:i for i,x in enumerate(X)} uf = UnionFindVerSize(N) for i in range(N): if X[i]+A[i] in dic: j = dic[X[i]+A[i]] uf.unite(i,j) if X[i]-A[i] in dic: j = dic[X[i]-A[i]] uf.unite(i,j) ans = [-1 for i in range(N)] p = [[] for i in range(N)] for i in range(N): p[uf.find_root(i)].append(i) for i in range(N): if not p[i]: continue M = max(X[v]+A[v] for v in p[i]) for v in p[i]: ans[v] = M-X[v] assert min(ans) > 0 print(*ans,sep="\n")