結果

問題 No.2319 Friends+
コンテスト
ユーザー Shirotsume
提出日時 2023-05-26 22:54:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,272 ms / 3,000 ms
コード長 3,725 bytes
コンパイル時間 495 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 153,600 KB
最終ジャッジ日時 2024-12-25 09:43:47
合計ジャッジ時間 32,468 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
class dsu():
    n=1
    parent_or_size=[-1 for i in range(n)]
    def __init__(self,N):
        self.n=N
        self.num = N
        self.parent_or_size=[-1 for i in range(N)]
    def merge(self,a,b):
        assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
        assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n)
        x=self.leader(a)
        y=self.leader(b)
        if x==y:
            return x
        self.num -= 1
        if (-self.parent_or_size[x]<-self.parent_or_size[y]):
            x,y=y,x
        self.parent_or_size[x]+=self.parent_or_size[y]
        self.parent_or_size[y]=x
        return x
    def same(self,a,b):
        assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
        assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n)
        return self.leader(a)==self.leader(b)
    def leader(self,a):
        assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
        if (self.parent_or_size[a]<0):
            return a
        self.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.n, "0<=a<n,a={0},n={1}".format(a,self.n)
        return -self.parent_or_size[self.leader(a)]
    def groups(self):
        leader_buf=[0 for i in range(self.n)]
        group_size=[0 for i in range(self.n)]
        for i in range(self.n):
            leader_buf[i]=self.leader(i)
            group_size[leader_buf[i]]+=1
        result=[[] for i in range(self.n)]
        for i in range(self.n):
            result[leader_buf[i]].append(i)
        result2=[]
        for i in range(self.n):
            if len(result[i])>0:
                result2.append(result[i])
        return result2
    def count(self):
        return self.num

n, m = mi()
P = li()
AB = [li() for _ in range(m)]
Q = [li() for _ in range(ii())]
nowworld = [v - 1 for v in P] #n人の今いるワールド

worldlist = [set() for _ in range(n)]

for i in range(n):
    worldlist[nowworld[i]].add(i)
graph = [set() for _ in range(n)]
ans = []
for u, v in AB:
    u -= 1; v -= 1
    graph[u].add(v)
    graph[v].add(u)

def common(x, y):
    if len(graph[x]) < len(worldlist[nowworld[y]]):
        for v in graph[x]:
            if v in worldlist[nowworld[y]]:
                return True
        return False
    else:
        for v in worldlist[nowworld[y]]:
            if v in graph[x]:
                return True
        return False
ans = []
import time
t1 = time.time()
for i in range(len(Q)):
    x, y = Q[i]
    x -= 1; y -= 1
    if time.time() - t1 >= 1.7:
        ans = []
        break
    if nowworld[x] != nowworld[y] and common(x, y):
        worldlist[nowworld[x]].discard(x)
        nowworld[x] = nowworld[y]
        worldlist[nowworld[x]].add(x)
        ans.append('Yes')
    else:
        ans.append('No')
else:
    for v in ans:
        print(v)
    exit()
nowworld = [v - 1 for v in P] #n人の今いるワールド

worldleaderlist = [Counter() for _ in range(n)]
U = dsu(n)
for u, v in AB:
    u -= 1; v -= 1
    U.merge(u, v)

for i in range(n):
    worldleaderlist[nowworld[i]][U.leader(i)] += 1

for _ in range(len(Q)):
    x, y = Q[i]
    x -= 1; y -= 1
    if nowworld[x] != nowworld[y] and worldleaderlist[nowworld[y]][U.leader(x)] > 0:
        ans.append('Yes')
        worldleaderlist[nowworld[x]][U.leader(x)] -= 1
        nowworld[x] = nowworld[y]
        worldleaderlist[nowworld[x]][U.leader(x)] += 1
    else:
        ans.append('No')

for v in ans:
    print(v)
0