結果

問題 No.2290 UnUnion Find
ユーザー timitimi
提出日時 2024-02-12 20:11:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 715 ms / 2,000 ms
コード長 5,199 bytes
コンパイル時間 457 ms
コンパイル使用メモリ 82,800 KB
実行使用メモリ 113,080 KB
最終ジャッジ日時 2024-09-28 18:11:59
合計ジャッジ時間 28,232 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
68,652 KB
testcase_01 AC 55 ms
67,648 KB
testcase_02 AC 141 ms
79,668 KB
testcase_03 AC 308 ms
88,400 KB
testcase_04 AC 324 ms
88,524 KB
testcase_05 AC 321 ms
88,912 KB
testcase_06 AC 310 ms
89,416 KB
testcase_07 AC 336 ms
89,168 KB
testcase_08 AC 335 ms
88,912 KB
testcase_09 AC 335 ms
88,856 KB
testcase_10 AC 337 ms
88,580 KB
testcase_11 AC 342 ms
89,684 KB
testcase_12 AC 324 ms
89,052 KB
testcase_13 AC 312 ms
88,524 KB
testcase_14 AC 337 ms
89,676 KB
testcase_15 AC 357 ms
89,928 KB
testcase_16 AC 323 ms
89,040 KB
testcase_17 AC 313 ms
88,656 KB
testcase_18 AC 331 ms
89,684 KB
testcase_19 AC 654 ms
98,872 KB
testcase_20 AC 665 ms
113,076 KB
testcase_21 AC 328 ms
83,028 KB
testcase_22 AC 491 ms
89,304 KB
testcase_23 AC 504 ms
89,712 KB
testcase_24 AC 687 ms
102,100 KB
testcase_25 AC 459 ms
87,272 KB
testcase_26 AC 691 ms
108,296 KB
testcase_27 AC 686 ms
102,640 KB
testcase_28 AC 554 ms
92,744 KB
testcase_29 AC 676 ms
100,904 KB
testcase_30 AC 358 ms
84,196 KB
testcase_31 AC 627 ms
98,172 KB
testcase_32 AC 466 ms
88,072 KB
testcase_33 AC 559 ms
94,028 KB
testcase_34 AC 683 ms
113,080 KB
testcase_35 AC 715 ms
106,292 KB
testcase_36 AC 472 ms
87,776 KB
testcase_37 AC 542 ms
92,804 KB
testcase_38 AC 467 ms
88,512 KB
testcase_39 AC 491 ms
89,624 KB
testcase_40 AC 703 ms
106,376 KB
testcase_41 AC 458 ms
87,272 KB
testcase_42 AC 620 ms
96,460 KB
testcase_43 AC 617 ms
96,716 KB
testcase_44 AC 327 ms
88,656 KB
testcase_45 AC 310 ms
91,660 KB
testcase_46 AC 338 ms
92,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import Counter, defaultdict, deque
import sys
input=sys.stdin.readline
N,Q=map(int,input().split())
import sys
input = sys.stdin.readline

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]

    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i: yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i): yield j

    def __len__(self) -> int:
        return self.size

    def __repr__(self) -> str:
        return "SortedMultiset" + str(self.a)

    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def count(self, x: T) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    def add(self, x: T) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Union[T, None]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Union[T, None]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Union[T, None]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]

    def __getitem__(self, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans

st = SortedMultiset()
par=[i for i in range(N)]
rank=[0]*(N)
friend=[0]*N
block=[0]*N
size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
 
for i in range(N):
  st.add(i)
  
for i in range(Q):
  A=list(map(int, input().split())) 
  if A[0]==1:
    u,v=A[1]-1,A[2]-1
    p,q=find(u),find(v)
    union(u,v)
    if find(u)==p:
      st.discard(q)
    else:
      st.discard(p)
  else:
    a=find(A[1]-1)
    if len(st)==1:
      print(-1)
    else:
      p,q=st[0],st[1]
      if a==p:
        print(q+1)
      else:
        print(p+1)
0