結果

問題 No.2319 Friends+
ユーザー ShirotsumeShirotsume
提出日時 2023-05-26 22:46:33
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,708 bytes
コンパイル時間 600 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 86,656 KB
最終ジャッジ日時 2024-06-07 08:12:54
合計ジャッジ時間 16,730 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
54,528 KB
testcase_01 AC 44 ms
54,272 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 254 ms
84,992 KB
testcase_05 WA -
testcase_06 AC 248 ms
84,608 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 54 ms
57,984 KB
testcase_13 AC 55 ms
57,856 KB
testcase_14 AC 55 ms
57,728 KB
testcase_15 AC 55 ms
57,856 KB
testcase_16 AC 56 ms
58,240 KB
testcase_17 AC 47 ms
54,272 KB
testcase_18 AC 210 ms
79,616 KB
testcase_19 AC 244 ms
86,656 KB
testcase_20 AC 302 ms
80,044 KB
testcase_21 AC 288 ms
80,056 KB
testcase_22 AC 303 ms
79,916 KB
testcase_23 AC 257 ms
83,456 KB
testcase_24 AC 270 ms
81,536 KB
testcase_25 AC 285 ms
81,152 KB
testcase_26 AC 279 ms
81,024 KB
testcase_27 AC 293 ms
80,512 KB
testcase_28 AC 281 ms
80,548 KB
testcase_29 AC 289 ms
80,384 KB
testcase_30 AC 289 ms
80,048 KB
testcase_31 AC 296 ms
79,968 KB
testcase_32 AC 306 ms
80,808 KB
testcase_33 AC 300 ms
80,548 KB
testcase_34 AC 291 ms
79,784 KB
testcase_35 AC 298 ms
80,384 KB
testcase_36 AC 235 ms
86,400 KB
testcase_37 AC 214 ms
84,864 KB
testcase_38 AC 304 ms
85,040 KB
testcase_39 AC 291 ms
85,376 KB
testcase_40 AC 294 ms
84,992 KB
testcase_41 AC 298 ms
85,120 KB
testcase_42 AC 312 ms
85,956 KB
testcase_43 AC 310 ms
85,676 KB
testcase_44 AC 307 ms
85,568 KB
testcase_45 AC 290 ms
85,248 KB
testcase_46 AC 225 ms
84,480 KB
権限があれば一括ダウンロードができます

ソースコード

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()
if m > 100000:
    nowworld = [v - 1 for v in li()] #n人の今いるワールド

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

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

    for _ in range(ii()):
        x, y = mi()
        x -= 1; y -= 1
        if nowworld[x] != nowworld[y] and worldleaderlist[nowworld[y]][U.leader(x)] > 0:
            print('Yes')
            worldleaderlist[nowworld[x]][U.leader(x)] -= 1
            nowworld[x] = nowworld[y]
            worldleaderlist[nowworld[x]][U.leader(x)] += 1
        else:
            print('No')
else:
    nowworld = [v - 1 for v in li()] #n人の今いるワールド

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

    for i in range(n):
        worldlist[nowworld[i]].add(i)
    graph = [set() for _ in range(n)]

    for _ in range(m):
        u, v = mi()
        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
    for _ in range(ii()):
        x, y = mi()
        x -= 1; y -= 1
        if nowworld[x] != nowworld[y] and common(x, y):
            worldlist[nowworld[x]].discard(x)
            nowworld[x] = nowworld[y]
            worldlist[nowworld[x]].add(x)
            print('Yes')
        else:
            print('No')
0