結果
問題 | No.2319 Friends+ |
ユーザー | Shirotsume |
提出日時 | 2023-05-26 22:46:33 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,708 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,248 KB |
実行使用メモリ | 88,132 KB |
最終ジャッジ日時 | 2023-08-26 12:59:05 |
合計ジャッジ時間 | 19,892 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
71,572 KB |
testcase_01 | AC | 92 ms
71,944 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 325 ms
86,604 KB |
testcase_05 | WA | - |
testcase_06 | AC | 322 ms
86,696 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 105 ms
72,492 KB |
testcase_13 | AC | 105 ms
72,324 KB |
testcase_14 | AC | 105 ms
72,716 KB |
testcase_15 | AC | 104 ms
72,316 KB |
testcase_16 | AC | 106 ms
72,312 KB |
testcase_17 | AC | 96 ms
71,444 KB |
testcase_18 | AC | 276 ms
82,092 KB |
testcase_19 | AC | 316 ms
88,092 KB |
testcase_20 | AC | 374 ms
82,340 KB |
testcase_21 | AC | 366 ms
81,664 KB |
testcase_22 | AC | 375 ms
82,148 KB |
testcase_23 | AC | 328 ms
84,984 KB |
testcase_24 | AC | 335 ms
83,760 KB |
testcase_25 | AC | 343 ms
82,360 KB |
testcase_26 | AC | 351 ms
82,016 KB |
testcase_27 | AC | 355 ms
81,808 KB |
testcase_28 | AC | 342 ms
81,764 KB |
testcase_29 | AC | 358 ms
81,704 KB |
testcase_30 | AC | 357 ms
81,776 KB |
testcase_31 | AC | 357 ms
81,676 KB |
testcase_32 | AC | 362 ms
82,888 KB |
testcase_33 | AC | 367 ms
83,120 KB |
testcase_34 | AC | 352 ms
82,432 KB |
testcase_35 | AC | 369 ms
83,104 KB |
testcase_36 | AC | 308 ms
88,132 KB |
testcase_37 | AC | 276 ms
86,556 KB |
testcase_38 | AC | 369 ms
87,584 KB |
testcase_39 | AC | 369 ms
87,128 KB |
testcase_40 | AC | 368 ms
87,104 KB |
testcase_41 | AC | 373 ms
87,200 KB |
testcase_42 | AC | 375 ms
87,276 KB |
testcase_43 | AC | 379 ms
86,796 KB |
testcase_44 | AC | 363 ms
86,784 KB |
testcase_45 | AC | 358 ms
86,848 KB |
testcase_46 | AC | 276 ms
86,368 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() 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')