結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー vwxyzvwxyz
提出日時 2023-11-30 17:09:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,137 ms / 2,000 ms
コード長 5,162 bytes
コンパイル時間 346 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 130,920 KB
最終ジャッジ日時 2024-09-26 14:11:29
合計ジャッジ時間 28,036 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 146 ms
89,472 KB
testcase_01 AC 152 ms
89,600 KB
testcase_02 AC 153 ms
89,472 KB
testcase_03 AC 152 ms
89,344 KB
testcase_04 AC 148 ms
89,472 KB
testcase_05 AC 161 ms
89,472 KB
testcase_06 AC 150 ms
89,344 KB
testcase_07 AC 153 ms
89,472 KB
testcase_08 AC 153 ms
89,472 KB
testcase_09 AC 148 ms
89,472 KB
testcase_10 AC 149 ms
89,472 KB
testcase_11 AC 161 ms
89,472 KB
testcase_12 AC 148 ms
89,344 KB
testcase_13 AC 410 ms
96,652 KB
testcase_14 AC 394 ms
97,908 KB
testcase_15 AC 221 ms
92,672 KB
testcase_16 AC 170 ms
90,240 KB
testcase_17 AC 329 ms
94,860 KB
testcase_18 AC 291 ms
94,760 KB
testcase_19 AC 435 ms
97,560 KB
testcase_20 AC 254 ms
92,160 KB
testcase_21 AC 387 ms
96,476 KB
testcase_22 AC 324 ms
94,064 KB
testcase_23 AC 683 ms
111,744 KB
testcase_24 AC 862 ms
114,472 KB
testcase_25 AC 1,029 ms
117,632 KB
testcase_26 AC 906 ms
114,432 KB
testcase_27 AC 830 ms
105,828 KB
testcase_28 AC 570 ms
98,524 KB
testcase_29 AC 667 ms
103,680 KB
testcase_30 AC 1,119 ms
120,832 KB
testcase_31 AC 1,137 ms
124,032 KB
testcase_32 AC 933 ms
120,576 KB
testcase_33 AC 959 ms
112,640 KB
testcase_34 AC 900 ms
111,232 KB
testcase_35 AC 841 ms
116,044 KB
testcase_36 AC 1,048 ms
123,904 KB
testcase_37 AC 609 ms
102,460 KB
testcase_38 AC 666 ms
117,376 KB
testcase_39 AC 1,059 ms
115,440 KB
testcase_40 AC 1,035 ms
115,776 KB
testcase_41 AC 1,003 ms
120,704 KB
testcase_42 AC 818 ms
103,552 KB
testcase_43 AC 150 ms
89,344 KB
testcase_44 AC 397 ms
130,920 KB
testcase_45 AC 274 ms
92,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

class UnionFind:
    def __init__(self,N,label=None,f=None,weighted=False,rollback=False):
        self.N=N
        self.parents=[None]*self.N
        self.size=[1]*self.N
        self.roots={i for i in range(self.N)}
        self.label=label
        if self.label!=None:
            self.label=[x for x in label]
        self.f=f
        self.weighted=weighted
        if self.weighted:
            self.weight=[0]*self.N
        self.rollback=rollback
        if self.rollback:
            self.operate_list=[]
            self.operate_set=[]

    def Find(self,x):
        stack=[]
        while self.parents[x]!=None:
            stack.append(x)
            x=self.parents[x]
        if not self.rollback:
            if self.weighted:
                w=0
                for y in stack[::-1]:
                    self.parents[y]=x
                    w+=self.weight[y]
                    self.weight[y]=w
            else:
                for y in stack[::-1]:
                    self.parents[y]=x
        return x

    def Union(self,x,y,w=None):
        root_x=self.Find(x)
        root_y=self.Find(y)
        if self.rollback:
            self.operate_list.append([])
            self.operate_set.append([])
        if root_x==root_y:
            if self.weighted:
                if self.weight[y]-self.weight[x]==w:
                    return True
                else:
                    return False
        else:
            if self.size[root_x]<self.size[root_y]:
                x,y=y,x
                root_x,root_y=root_y,root_x
                if self.weighted:
                    w=-w
            if self.rollback:
                self.operate_list[-1].append((self.parents,root_y,self.parents[root_y]))
                self.operate_list[-1].append((self.size,root_x,self.size[root_x]))
                self.operate_set[-1].append(root_y)
                if self.label!=None:
                    self.operate_list[-1]((self.label,root_x,self.label[root_x]))
                if self.weighted:
                    self.operate_list[-1].append((self.weight,root_y,self.weight[root_y]))
            self.parents[root_y]=root_x
            self.size[root_x]+=self.size[root_y]
            self.roots.remove(root_y)
            if self.label!=None:
                self.label[root_x]=self.f(self.label[root_x],self.label[root_y])
            if self.weighted:
                self.weight[root_y]=w+self.weight[x]-self.weight[y]

    def Size(self,x):
        return self.size[self.Find(x)]

    def Same(self,x,y):
        return self.Find(x)==self.Find(y)

    def Label(self,x):
        return self.label[self.Find(x)]

    def Weight(self,x,y):
        root_x=self.Find(x)
        root_y=self.Find(y)
        if root_x!=root_y:
            return None
        return self.weight[y]-self.weight[x]

    def Roots(self):
        return list(self.roots)

    def Linked_Components_Count(self):
        return len(self.roots)

    def Linked_Components(self):
        linked_components=defaultdict(list)
        for x in range(self.N):
            linked_components[self.Find(x)].append(x)
        return linked_components
    
    def Rollback(self):
        assert self.rollback
        if self.operate_list:
            for lst,x,v in self.operate_list.pop():
                lst[x]=v
            for x in self.operate_set.pop():
                self.roots.add(x)            
            return True
        else:
            return False

    def __str__(self):
        linked_components=defaultdict(list)
        for x in range(self.N):
            linked_components[self.Find(x)].append(x)
        return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys())))

N=int(readline())
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
P=list(map(int,readline().split()))
def f(tpl0,tpl1):
    a0,b0,ip0=tpl0
    a1,b1,ip1=tpl1
    return (a0+a1,b0+b1,ip0+ip1)
UF=UnionFind(N,label=[(A[x],B[x],(1/P[x] if P[x] else 1e20)) for x in range(N)],f=f)
Q=int(readline())
ans=sum(p*(a-b)**2 for p,a,b in zip(P,A,B))
for q in range(Q):
    X,Y=map(int,readline().split())
    X-=1;Y-=1
    if not UF.Same(X,Y):
        a,b,ip=UF.Label(X)
        ans-=abs(a-b)**2/ip
        a,b,ip=UF.Label(Y)
        ans-=abs(a-b)**2/ip
        UF.Union(X,Y)
        a,b,ip=UF.Label(X)
        ans+=abs(a-b)**2/ip
    print(ans)
0