結果

問題 No.2290 UnUnion Find
ユーザー 👑 timitimi
提出日時 2024-02-12 20:11:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 814 ms / 2,000 ms
コード長 5,199 bytes
コンパイル時間 287 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 112,132 KB
最終ジャッジ日時 2024-02-12 20:12:27
合計ジャッジ時間 31,628 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
67,860 KB
testcase_01 AC 59 ms
67,860 KB
testcase_02 AC 151 ms
78,656 KB
testcase_03 AC 338 ms
87,752 KB
testcase_04 AC 339 ms
87,880 KB
testcase_05 AC 343 ms
87,880 KB
testcase_06 AC 337 ms
88,728 KB
testcase_07 AC 383 ms
88,136 KB
testcase_08 AC 389 ms
88,136 KB
testcase_09 AC 409 ms
88,136 KB
testcase_10 AC 361 ms
87,880 KB
testcase_11 AC 375 ms
89,288 KB
testcase_12 AC 373 ms
88,404 KB
testcase_13 AC 339 ms
87,880 KB
testcase_14 AC 394 ms
88,904 KB
testcase_15 AC 412 ms
88,900 KB
testcase_16 AC 348 ms
88,392 KB
testcase_17 AC 337 ms
87,880 KB
testcase_18 AC 390 ms
88,772 KB
testcase_19 AC 677 ms
98,260 KB
testcase_20 AC 774 ms
112,132 KB
testcase_21 AC 358 ms
82,400 KB
testcase_22 AC 553 ms
89,008 KB
testcase_23 AC 558 ms
89,180 KB
testcase_24 AC 755 ms
101,328 KB
testcase_25 AC 494 ms
86,464 KB
testcase_26 AC 770 ms
108,400 KB
testcase_27 AC 745 ms
102,632 KB
testcase_28 AC 615 ms
92,476 KB
testcase_29 AC 745 ms
100,252 KB
testcase_30 AC 392 ms
83,100 KB
testcase_31 AC 716 ms
97,640 KB
testcase_32 AC 496 ms
87,852 KB
testcase_33 AC 658 ms
92,912 KB
testcase_34 AC 728 ms
112,040 KB
testcase_35 AC 814 ms
105,904 KB
testcase_36 AC 544 ms
87,204 KB
testcase_37 AC 611 ms
91,896 KB
testcase_38 AC 507 ms
87,360 KB
testcase_39 AC 557 ms
89,484 KB
testcase_40 AC 741 ms
106,236 KB
testcase_41 AC 515 ms
87,076 KB
testcase_42 AC 663 ms
95,948 KB
testcase_43 AC 655 ms
95,048 KB
testcase_44 AC 370 ms
88,008 KB
testcase_45 AC 334 ms
90,884 KB
testcase_46 AC 359 ms
91,264 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