結果
問題 | No.2290 UnUnion Find |
ユーザー | buey_t |
提出日時 | 2023-05-08 11:49:30 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,077 bytes |
コンパイル時間 | 714 ms |
コンパイル使用メモリ | 82,852 KB |
実行使用メモリ | 124,288 KB |
最終ジャッジ日時 | 2024-11-25 05:29:27 |
合計ジャッジ時間 | 24,463 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
89,344 KB |
testcase_01 | AC | 141 ms
89,084 KB |
testcase_02 | AC | 202 ms
90,232 KB |
testcase_03 | AC | 266 ms
105,500 KB |
testcase_04 | AC | 276 ms
105,272 KB |
testcase_05 | AC | 266 ms
105,224 KB |
testcase_06 | AC | 280 ms
105,080 KB |
testcase_07 | AC | 274 ms
105,448 KB |
testcase_08 | AC | 265 ms
105,104 KB |
testcase_09 | AC | 280 ms
105,216 KB |
testcase_10 | AC | 276 ms
105,352 KB |
testcase_11 | AC | 274 ms
105,088 KB |
testcase_12 | AC | 275 ms
105,728 KB |
testcase_13 | AC | 276 ms
105,088 KB |
testcase_14 | AC | 273 ms
105,088 KB |
testcase_15 | AC | 280 ms
105,416 KB |
testcase_16 | AC | 279 ms
105,216 KB |
testcase_17 | AC | 272 ms
105,216 KB |
testcase_18 | AC | 288 ms
105,088 KB |
testcase_19 | WA | - |
testcase_20 | AC | 481 ms
123,776 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 515 ms
118,400 KB |
testcase_27 | AC | 598 ms
114,944 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 607 ms
109,776 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 524 ms
124,288 KB |
testcase_35 | AC | 511 ms
118,016 KB |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 500 ms
115,404 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 568 ms
105,472 KB |
testcase_44 | AC | 286 ms
104,960 KB |
testcase_45 | AC | 274 ms
105,344 KB |
testcase_46 | AC | 288 ms
105,216 KB |
ソースコード
from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsumfrom heapq import heapify, heappop, heappushfrom bisect import bisect_left, bisect_rightfrom copy import deepcopyimport copyimport randomfrom random import randrangefrom collections import deque,Counter,defaultdictfrom itertools import permutations,combinationsfrom decimal import Decimal,ROUND_HALF_UP#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)from functools import lru_cache, reduce#@lru_cache(maxsize=None)from operator import add,sub,mul,xor,and_,or_,itemgetterimport sysinput = sys.stdin.readline# .rstrip()INF = 10**18mod1 = 10**9+7mod2 = 998244353#DecimalならPython#再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!class UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * n#親だけself.edge = [0]*nself.count = ndef find(self, x):if self.parents[x] < 0:return xelse:self.parents[x] = self.find(self.parents[x])return self.parents[x]def union(self, x, y):x = self.find(x)y = self.find(y)if self.parents[x] > self.parents[y]:x, y = y, xself.edge[x] += 1if x == y:returnself.count -= 1self.parents[x] += self.parents[y]self.edge[x] += self.edge[y]self.parents[y] = xdef size(self, x):return -self.parents[self.find(x)]def same(self, x, y):return self.find(x) == self.find(y)def members(self, x):root = self.find(x)return [i for i in range(self.n) if self.find(i) == root]def roots(self):return [i for i, x in enumerate(self.parents) if x < 0]def all_group_members(self):group_members = defaultdict(list)for member in range(self.n):group_members[self.find(member)].append(member)return group_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())''''''N,Q = map(int, input().split())uf = UnionFind(N+1)l = 1r = Nf = 0s = 0st = set()for i in range(1,N+1):st.add(i)for i in range(Q):tmp = list(map(int, input().split()))if tmp[0] == 1:t,u,v = tmpuf.union(u,v)st.discard(u)st.discard(v)if f == 0:f = uelse:if not uf.same(f,u) and s == 0:s = uelse:t,v = tmpif uf.count == 2:print(-1)elif uf.same(f,v):if s == 0:print(next(iter(st)))else:print(s)elif uf.same(s,v):print(f)else:if f == 0:for z in st:if z != v:print(z)breakelse:print(f)