結果
問題 | No.2319 Friends+ |
ユーザー | Shirotsume |
提出日時 | 2023-05-26 22:54:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,226 ms / 3,000 ms |
コード長 | 3,725 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 87,392 KB |
実行使用メモリ | 155,176 KB |
最終ジャッジ日時 | 2023-08-26 13:13:53 |
合計ジャッジ時間 | 30,107 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,392 KB |
testcase_01 | AC | 92 ms
71,680 KB |
testcase_02 | AC | 569 ms
144,676 KB |
testcase_03 | AC | 569 ms
146,204 KB |
testcase_04 | AC | 568 ms
145,360 KB |
testcase_05 | AC | 565 ms
146,168 KB |
testcase_06 | AC | 573 ms
145,308 KB |
testcase_07 | AC | 679 ms
147,300 KB |
testcase_08 | AC | 671 ms
147,424 KB |
testcase_09 | AC | 670 ms
148,064 KB |
testcase_10 | AC | 662 ms
147,476 KB |
testcase_11 | AC | 670 ms
147,740 KB |
testcase_12 | AC | 110 ms
76,980 KB |
testcase_13 | AC | 109 ms
76,744 KB |
testcase_14 | AC | 108 ms
76,832 KB |
testcase_15 | AC | 107 ms
76,860 KB |
testcase_16 | AC | 107 ms
76,800 KB |
testcase_17 | AC | 91 ms
71,636 KB |
testcase_18 | AC | 2,226 ms
149,412 KB |
testcase_19 | AC | 519 ms
151,984 KB |
testcase_20 | AC | 634 ms
142,936 KB |
testcase_21 | AC | 597 ms
141,596 KB |
testcase_22 | AC | 703 ms
142,808 KB |
testcase_23 | AC | 561 ms
144,088 KB |
testcase_24 | AC | 560 ms
143,420 KB |
testcase_25 | AC | 572 ms
142,756 KB |
testcase_26 | AC | 552 ms
142,032 KB |
testcase_27 | AC | 568 ms
142,128 KB |
testcase_28 | AC | 573 ms
142,120 KB |
testcase_29 | AC | 576 ms
142,268 KB |
testcase_30 | AC | 659 ms
143,760 KB |
testcase_31 | AC | 635 ms
142,704 KB |
testcase_32 | AC | 589 ms
142,704 KB |
testcase_33 | AC | 584 ms
142,580 KB |
testcase_34 | AC | 580 ms
141,748 KB |
testcase_35 | AC | 557 ms
141,048 KB |
testcase_36 | AC | 506 ms
155,176 KB |
testcase_37 | AC | 471 ms
154,940 KB |
testcase_38 | AC | 541 ms
151,216 KB |
testcase_39 | AC | 556 ms
151,156 KB |
testcase_40 | AC | 525 ms
151,248 KB |
testcase_41 | AC | 536 ms
151,644 KB |
testcase_42 | AC | 540 ms
152,276 KB |
testcase_43 | AC | 532 ms
152,532 KB |
testcase_44 | AC | 516 ms
153,828 KB |
testcase_45 | AC | 493 ms
152,268 KB |
testcase_46 | AC | 470 ms
153,360 KB |
ソースコード
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)