結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー |
|
提出日時 | 2024-07-06 18:27:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 790 ms / 2,000 ms |
コード長 | 2,403 bytes |
コンパイル時間 | 240 ms |
コンパイル使用メモリ | 82,584 KB |
実行使用メモリ | 108,556 KB |
最終ジャッジ日時 | 2024-07-06 18:28:01 |
合計ジャッジ時間 | 29,760 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
ソースコード
# import pypyjit# pypyjit.set_param("max_unroll_recursion=-1")from collections import *from functools import *from itertools import *from heapq import *import sys, math# sys.setrecursionlimit(10**4)input = sys.stdin.readlineclass DSU:def __init__(self, n , B, P, A):self._n = nself.parent_or_size = [-1] * nself.P = Pself.B = Bself.SE = Aself.SPB = [p*b*b for p,b in zip(P,B)]self.SB = Bself.IP = [1/(p+0.000000000000001) for p in P]def merge(self, a, b):assert 0 <= a < self._nassert 0 <= b < self._nx, y = self.leader(a), self.leader(b)if x == y: return xif -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, xself.parent_or_size[x] += self.parent_or_size[y]self.SB[x] += self.SB[y]self.SPB[x] += self.SPB[y]self.SE[x] += self.SE[y]self.IP[x] += self.IP[y]self.parent_or_size[y] = xreturn xdef same(self, a, b):assert 0 <= a < self._nassert 0 <= b < self._nreturn self.leader(a) == self.leader(b)def leader(self, a):assert 0 <= a < self._nif self.parent_or_size[a] < 0: return aself.parent_or_size[a] = self.leader(self.parent_or_size[a])return self.parent_or_size[a]def size(self, a):assert 0 <= a < self._nreturn -self.parent_or_size[self.leader(a)]def groups(self):leader_buf = [self.leader(i) for i in range(self._n)]result = [[] for _ in range(self._n)]for i in range(self._n): result[leader_buf[i]].append(i)return [r for r in result if r != []]N = int(input())A = list(map(int,input().split()))B = list(map(int,input().split()))P = list(map(int,input().split()))D = DSU(N,B,P,A)Q = int(input())ans = sum(p*(e-b)**2 for p,e,b in zip(P,A,B))for _ in range(Q):x,y = map(int,input().split())x -= 1y -= 1lx = D.leader(x)ly = D.leader(y)if D.same(x,y):print(ans)continueelse:bef = (-D.SPB[lx] + (D.SE[lx] - D.SB[lx])**2/D.IP[lx]-D.SPB[ly] + (D.SE[ly] - D.SB[ly])**2/D.IP[ly])D.merge(x,y)lx = D.leader(x)aft = -D.SPB[lx] + (D.SE[lx] - D.SB[lx])**2/D.IP[lx]ans += aft-befprint(ans)# print(D.SB)