結果
問題 | No.2290 UnUnion Find |
ユーザー |
![]() |
提出日時 | 2023-05-05 21:45:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,185 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 81,920 KB |
実行使用メモリ | 114,984 KB |
最終ジャッジ日時 | 2024-11-23 06:45:58 |
合計ジャッジ時間 | 26,937 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 12 WA * 34 |
ソースコード
import sysclass UnionFind(object):def __init__(self, n=1):self.par = [i for i in range(n)]self.rank = [0 for _ in range(n)]self.size = [1 for _ in range(n)]def find(self, x):if self.par[x] == x:return xelse:self.par[x] = self.find(self.par[x])return self.par[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x != y:if self.rank[x] < self.rank[y]:x, y = y, xif self.rank[x] == self.rank[y]:self.rank[x] += 1self.par[y] = xself.size[x] += self.size[y]def is_same(self, x, y):return self.find(x) == self.find(y)def get_size(self, x):x = self.find(x)return self.size[x]N, Q = map(int, input().split())query = [None] * QU = UnionFind(N)for i in range(Q):query[i] = list(map(int, input().split()))if query[i][0] == 1:u, v = query[i][1:]u, v = u - 1, v - 1U.union(u, v)else:if U.get_size(0) == N:query[i].append(-1)else:query[i].append(1)p, q = 0, -1flag = 1U = UnionFind(N)for i in range(Q):if query[i][0] == 2:if query[i][-1] == -1:flag = 0else:if flag:u, v = query[i][1:]u, v = u - 1, v - 1p = uq = vfor i in range(Q):if query[i][0] == 2:continueelse:u, v = query[i][1:]u, v = u - 1, v - 1if u == p and v == q:breakelse:U.union(u, v)ans = []for i in range(Q - 1, -1, -1):if query[i][0] == 2:if query[i][-1] != -1:flag = 0u = query[i][1] - 1if U.is_same(u, p):ans.append(q + 1)else:ans.append(p + 1)else:ans.append(-1)else:if flag:u, v = query[i][1:]u, v = u - 1, v - 1p = uq = vans.reverse()for a in ans:print(a)