結果
問題 | No.2290 UnUnion Find |
ユーザー | minimum |
提出日時 | 2023-05-05 21:39:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,025 ms / 2,000 ms |
コード長 | 1,857 bytes |
コンパイル時間 | 1,858 ms |
コンパイル使用メモリ | 86,896 KB |
実行使用メモリ | 112,028 KB |
最終ジャッジ日時 | 2023-08-15 03:23:27 |
合計ジャッジ時間 | 40,311 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,260 KB |
testcase_01 | AC | 76 ms
71,440 KB |
testcase_02 | AC | 578 ms
78,796 KB |
testcase_03 | AC | 478 ms
93,424 KB |
testcase_04 | AC | 487 ms
93,300 KB |
testcase_05 | AC | 487 ms
93,308 KB |
testcase_06 | AC | 484 ms
93,472 KB |
testcase_07 | AC | 503 ms
93,224 KB |
testcase_08 | AC | 498 ms
93,360 KB |
testcase_09 | AC | 498 ms
93,280 KB |
testcase_10 | AC | 481 ms
93,320 KB |
testcase_11 | AC | 495 ms
93,452 KB |
testcase_12 | AC | 479 ms
93,216 KB |
testcase_13 | AC | 483 ms
93,448 KB |
testcase_14 | AC | 501 ms
93,528 KB |
testcase_15 | AC | 504 ms
93,196 KB |
testcase_16 | AC | 487 ms
93,472 KB |
testcase_17 | AC | 489 ms
93,380 KB |
testcase_18 | AC | 498 ms
93,196 KB |
testcase_19 | AC | 1,025 ms
95,444 KB |
testcase_20 | AC | 892 ms
112,028 KB |
testcase_21 | AC | 794 ms
82,768 KB |
testcase_22 | AC | 891 ms
87,620 KB |
testcase_23 | AC | 914 ms
88,148 KB |
testcase_24 | AC | 821 ms
102,632 KB |
testcase_25 | AC | 868 ms
84,364 KB |
testcase_26 | AC | 792 ms
106,280 KB |
testcase_27 | AC | 914 ms
103,092 KB |
testcase_28 | AC | 921 ms
91,756 KB |
testcase_29 | AC | 975 ms
100,100 KB |
testcase_30 | AC | 846 ms
84,772 KB |
testcase_31 | AC | 918 ms
97,672 KB |
testcase_32 | AC | 883 ms
85,484 KB |
testcase_33 | AC | 973 ms
89,720 KB |
testcase_34 | AC | 844 ms
111,884 KB |
testcase_35 | AC | 1,006 ms
106,464 KB |
testcase_36 | AC | 901 ms
86,060 KB |
testcase_37 | AC | 991 ms
88,644 KB |
testcase_38 | AC | 909 ms
85,668 KB |
testcase_39 | AC | 890 ms
86,860 KB |
testcase_40 | AC | 959 ms
103,216 KB |
testcase_41 | AC | 943 ms
85,392 KB |
testcase_42 | AC | 1,001 ms
95,440 KB |
testcase_43 | AC | 1,008 ms
93,796 KB |
testcase_44 | AC | 485 ms
93,384 KB |
testcase_45 | AC | 516 ms
93,208 KB |
testcase_46 | AC | 540 ms
93,580 KB |
ソースコード
class DisjointSetUnion(): def __init__(self, n): self.n = n self.par_or_size = [-1] * n def merge(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) la = self.leader(a) lb = self.leader(b) if la == lb: return la if -self.par_or_size[la] < -self.par_or_size[lb]: la, lb = lb, la self.par_or_size[la] += self.par_or_size[lb] self.par_or_size[lb] = la return la def same(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) return self.leader(a) == self.leader(b) def leader(self, a): assert(0 <= a < self.n) if (self.par_or_size[a] < 0): return a else: self.par_or_size[a] = self.leader(self.par_or_size[a]) return self.par_or_size[a] def size(self, a): assert(0 <= a < self.n) return - self.par_or_size[self.leader(a)] def group(self): result = dict() for a in range(self.n): la = self.leader(a) if la not in result: result[la] = [] result[la].append(a) return result N, Q = map(int, input().split()) dsu = DisjointSetUnion(N) ls = set(list(range(N))) for _ in range(Q): query = list(map(int, input().split())) if query[0] == 1: u, v = query[1] - 1, query[2] - 1 lu, lv = dsu.leader(u), dsu.leader(v) if lu == lv: continue dsu.merge(u, v) if lu == dsu.leader(v): ls.remove(lv) else: ls.remove(lu) else: u = query[1] - 1 lu = dsu.leader(u) ans = -2 for l in ls: if l == lu: continue ans = l break print(ans + 1)