結果

問題 No.2290 UnUnion Find
ユーザー buey_tbuey_t
提出日時 2023-05-08 11:40:08
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,979 bytes
コンパイル時間 1,938 ms
コンパイル使用メモリ 86,496 KB
実行使用メモリ 118,824 KB
最終ジャッジ日時 2023-08-16 15:36:47
合計ジャッジ時間 33,051 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 240 ms
83,292 KB
testcase_01 AC 241 ms
83,244 KB
testcase_02 AC 330 ms
86,588 KB
testcase_03 AC 383 ms
100,268 KB
testcase_04 AC 391 ms
100,248 KB
testcase_05 AC 390 ms
100,716 KB
testcase_06 AC 386 ms
100,504 KB
testcase_07 AC 400 ms
100,584 KB
testcase_08 AC 386 ms
100,760 KB
testcase_09 AC 388 ms
100,544 KB
testcase_10 AC 391 ms
100,756 KB
testcase_11 AC 393 ms
100,720 KB
testcase_12 AC 384 ms
100,288 KB
testcase_13 AC 405 ms
100,624 KB
testcase_14 AC 394 ms
100,760 KB
testcase_15 AC 400 ms
100,548 KB
testcase_16 AC 385 ms
100,572 KB
testcase_17 AC 393 ms
100,508 KB
testcase_18 AC 402 ms
100,724 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 648 ms
113,384 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 646 ms
113,228 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 728 ms
100,252 KB
testcase_44 AC 395 ms
100,312 KB
testcase_45 AC 386 ms
100,512 KB
testcase_46 AC 404 ms
100,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from random import randrange
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from 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_,itemgetter
import sys
input = sys.stdin.readline
# .rstrip()
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353

#DecimalならPython
#再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        #親だけ
        self.edge = [0]*n
        self.count = n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            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, x
        
        self.edge[x] += 1
        
        if x == y:
            return
        
        self.count -= 1

        self.parents[x] += self.parents[y]
        self.edge[x] += self.edge[y]
        self.parents[y] = x

    def 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_members

    def __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 = 1
r = N

f = 0
s = 0

st = 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 = tmp
        
        uf.union(u,v)
        st.discard(u)
        st.discard(v)
        
        if f == 0:
            f = u
        else:
            if not uf.same(f,u) and s == 0:
                s = u
    
    else:
        t,v = tmp
        
        if 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 v == 1:
                print(2)
            else:
                print(1)
0