結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー | mkawa2 |
提出日時 | 2021-11-12 01:42:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 813 ms / 2,000 ms |
コード長 | 2,287 bytes |
コンパイル時間 | 844 ms |
コンパイル使用メモリ | 85,952 KB |
実行使用メモリ | 106,304 KB |
最終ジャッジ日時 | 2023-08-15 18:07:46 |
合計ジャッジ時間 | 21,814 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
71,296 KB |
testcase_01 | AC | 63 ms
71,480 KB |
testcase_02 | AC | 64 ms
71,324 KB |
testcase_03 | AC | 64 ms
71,296 KB |
testcase_04 | AC | 69 ms
71,388 KB |
testcase_05 | AC | 72 ms
71,320 KB |
testcase_06 | AC | 68 ms
71,380 KB |
testcase_07 | AC | 68 ms
71,324 KB |
testcase_08 | AC | 66 ms
71,364 KB |
testcase_09 | AC | 63 ms
71,544 KB |
testcase_10 | AC | 64 ms
71,228 KB |
testcase_11 | AC | 64 ms
71,468 KB |
testcase_12 | AC | 66 ms
71,460 KB |
testcase_13 | AC | 277 ms
81,708 KB |
testcase_14 | AC | 261 ms
83,204 KB |
testcase_15 | AC | 148 ms
78,740 KB |
testcase_16 | AC | 87 ms
77,764 KB |
testcase_17 | AC | 240 ms
81,400 KB |
testcase_18 | AC | 201 ms
80,088 KB |
testcase_19 | AC | 257 ms
81,952 KB |
testcase_20 | AC | 155 ms
78,444 KB |
testcase_21 | AC | 269 ms
81,968 KB |
testcase_22 | AC | 222 ms
81,712 KB |
testcase_23 | AC | 385 ms
93,000 KB |
testcase_24 | AC | 531 ms
95,048 KB |
testcase_25 | AC | 722 ms
98,316 KB |
testcase_26 | AC | 556 ms
96,400 KB |
testcase_27 | AC | 543 ms
87,672 KB |
testcase_28 | AC | 402 ms
84,212 KB |
testcase_29 | AC | 403 ms
85,800 KB |
testcase_30 | AC | 726 ms
100,128 KB |
testcase_31 | AC | 813 ms
106,304 KB |
testcase_32 | AC | 601 ms
101,768 KB |
testcase_33 | AC | 636 ms
92,904 KB |
testcase_34 | AC | 552 ms
92,888 KB |
testcase_35 | AC | 563 ms
95,036 KB |
testcase_36 | AC | 662 ms
105,264 KB |
testcase_37 | AC | 401 ms
84,664 KB |
testcase_38 | AC | 346 ms
98,328 KB |
testcase_39 | AC | 688 ms
94,964 KB |
testcase_40 | AC | 671 ms
95,072 KB |
testcase_41 | AC | 691 ms
100,292 KB |
testcase_42 | AC | 664 ms
87,252 KB |
testcase_43 | AC | 66 ms
71,364 KB |
testcase_44 | AC | 263 ms
104,680 KB |
testcase_45 | AC | 253 ms
79,492 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = 18446744073709551615 inf = 4294967295 md = 10**9+7 # md = 998244353 class UnionFind: def __init__(self, n, dd, ip): self.state = [-1]*n self.size_table = [1]*n self.dd = dd self.ip = ip # cntはグループ数 self.cnt = n def root(self, u): stack = [] while self.state[u] >= 0: stack.append(u) u = self.state[u] for v in stack: self.state[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v): u = self.root(u) v = self.root(v) if u == v: return False du = -self.state[u] dv = -self.state[v] if du < dv: u, v = v, u if du == dv: self.state[u] -= 1 self.state[v] = u self.cnt -= 1 self.size_table[u] += self.size_table[v] self.dd[u] += self.dd[v] if self.ip[u] == inf or self.ip[v] == inf: self.ip[u] = inf else: self.ip[u] += self.ip[v] return True # グループの要素数 def size(self, u): return self.size_table[self.root(u)] def get_dp(self, u): u = self.root(u) return self.dd[u], self.ip[u] n = II() aa = LI() bb = LI() pp = LI() uf = UnionFind(n, [a-b for a, b in zip(aa, bb)], [1/p if p else inf for p in pp]) s = sum(p*(a-b)**2 for a, b, p in zip(aa, bb, pp)) for _ in range(II()): x, y = LI1() if not uf.same(x, y): d, p = uf.get_dp(x) if p < inf: s -= d**2/p d, p = uf.get_dp(y) if p < inf: s -= d**2/p uf.merge(x, y) d, p = uf.get_dp(x) if p < inf: s += d**2/p print(s)