結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー | chineristAC |
提出日時 | 2021-01-22 22:52:02 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,165 bytes |
コンパイル時間 | 460 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 109,896 KB |
最終ジャッジ日時 | 2023-08-28 11:30:27 |
合計ジャッジ時間 | 20,361 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,716 KB |
testcase_01 | AC | 74 ms
71,416 KB |
testcase_02 | AC | 74 ms
71,860 KB |
testcase_03 | RE | - |
testcase_04 | AC | 77 ms
71,720 KB |
testcase_05 | AC | 76 ms
71,936 KB |
testcase_06 | AC | 74 ms
71,844 KB |
testcase_07 | AC | 75 ms
71,868 KB |
testcase_08 | AC | 75 ms
71,624 KB |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | AC | 75 ms
71,776 KB |
testcase_12 | AC | 75 ms
71,680 KB |
testcase_13 | AC | 255 ms
81,812 KB |
testcase_14 | AC | 240 ms
81,420 KB |
testcase_15 | AC | 128 ms
78,408 KB |
testcase_16 | AC | 91 ms
77,008 KB |
testcase_17 | AC | 217 ms
80,468 KB |
testcase_18 | AC | 161 ms
79,968 KB |
testcase_19 | AC | 254 ms
81,920 KB |
testcase_20 | RE | - |
testcase_21 | AC | 228 ms
81,052 KB |
testcase_22 | AC | 217 ms
81,328 KB |
testcase_23 | AC | 329 ms
94,460 KB |
testcase_24 | AC | 487 ms
95,596 KB |
testcase_25 | AC | 648 ms
103,924 KB |
testcase_26 | AC | 527 ms
96,784 KB |
testcase_27 | AC | 549 ms
95,616 KB |
testcase_28 | AC | 388 ms
87,512 KB |
testcase_29 | AC | 383 ms
87,308 KB |
testcase_30 | AC | 737 ms
109,896 KB |
testcase_31 | AC | 688 ms
107,576 KB |
testcase_32 | AC | 516 ms
99,904 KB |
testcase_33 | AC | 626 ms
100,680 KB |
testcase_34 | AC | 547 ms
96,040 KB |
testcase_35 | AC | 477 ms
95,636 KB |
testcase_36 | AC | 632 ms
105,552 KB |
testcase_37 | AC | 328 ms
84,384 KB |
testcase_38 | AC | 272 ms
98,756 KB |
testcase_39 | AC | 707 ms
107,280 KB |
testcase_40 | AC | 686 ms
105,404 KB |
testcase_41 | AC | 593 ms
102,788 KB |
testcase_42 | RE | - |
testcase_43 | AC | 72 ms
71,624 KB |
testcase_44 | AC | 217 ms
101,796 KB |
testcase_45 | AC | 213 ms
91,728 KB |
ソースコード
class UnionFindVerSize(): def __init__(self, N,init_P,init_S): self._parent = [n for n in range(0, N)] self.P_sum = [0 for i in range(N)] for i in range(N): if init_P[i]: self.P_sum[i] = 1/init_P[i] else: self.P_sum[i] = float("inf") self.S_sum = [init_S[i] for i in range(N)] self._size = [1]*N self.group = N self.ans = 0 for i in range(N): self.ans += (self.S_sum[i]**2)/self.P_sum[i] 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]: gx,gy = gy,gx self._parent[gx] = gy self._size[gy] += self._size[gx] self.ans -= self.S_sum[gx]**2 / self.P_sum[gx] self.ans -= self.S_sum[gy]**2 / self.P_sum[gy] assert self.ans>=0 or abs(ans)<=10**-7 self.S_sum[gy] += self.S_sum[gx] self.P_sum[gy] += self.P_sum[gx] self.ans += self.S_sum[gy]**2 / self.P_sum[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) import sys input = sys.stdin.readline N = int(input()) A = list(map(int,input().split())) B = list(map(int,input().split())) P = list(map(int,input().split())) #A = [0 for i in range(N)] #A[0] = 1 #B = [0 for i in range(N)] #P = [1 for i in range(N)] S = [A[i]-B[i] for i in range(N)] uf = UnionFindVerSize(N,P,S) ans = [] for _ in range(int(input())): x,y = map(int,input().split()) uf.unite(x-1,y-1) ans.append(uf.ans) print(*ans,sep="\n") #for i in range(len(ans)): #if ans[i] < 10**-7 and ans[i]!=0: #assert False