結果

問題 No.2319 Friends+
ユーザー ShirotsumeShirotsume
提出日時 2023-05-26 22:32:43
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,609 bytes
コンパイル時間 395 ms
コンパイル使用メモリ 87,268 KB
実行使用メモリ 88,356 KB
最終ジャッジ日時 2023-08-26 12:37:31
合計ジャッジ時間 18,304 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
71,872 KB
testcase_01 AC 84 ms
71,552 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 274 ms
86,508 KB
testcase_05 WA -
testcase_06 AC 272 ms
86,552 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 82 ms
71,632 KB
testcase_18 AC 248 ms
82,184 KB
testcase_19 AC 254 ms
88,048 KB
testcase_20 AC 328 ms
83,000 KB
testcase_21 AC 321 ms
82,980 KB
testcase_22 AC 311 ms
82,364 KB
testcase_23 AC 272 ms
84,884 KB
testcase_24 AC 288 ms
83,516 KB
testcase_25 AC 295 ms
82,392 KB
testcase_26 AC 302 ms
82,760 KB
testcase_27 AC 312 ms
82,304 KB
testcase_28 AC 303 ms
82,436 KB
testcase_29 AC 311 ms
82,388 KB
testcase_30 AC 320 ms
82,320 KB
testcase_31 AC 319 ms
82,300 KB
testcase_32 AC 389 ms
83,012 KB
testcase_33 AC 387 ms
83,240 KB
testcase_34 AC 321 ms
82,012 KB
testcase_35 AC 321 ms
82,884 KB
testcase_36 AC 265 ms
87,976 KB
testcase_37 AC 290 ms
86,284 KB
testcase_38 AC 332 ms
86,656 KB
testcase_39 AC 338 ms
87,176 KB
testcase_40 AC 325 ms
87,116 KB
testcase_41 AC 333 ms
87,124 KB
testcase_42 AC 405 ms
87,256 KB
testcase_43 AC 338 ms
87,084 KB
testcase_44 AC 327 ms
87,048 KB
testcase_45 AC 325 ms
86,576 KB
testcase_46 AC 256 ms
86,316 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()

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')
0