結果
問題 | No.2293 無向辺 2-SAT |
ユーザー | t98slider |
提出日時 | 2023-03-17 18:47:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,130 ms / 4,000 ms |
コード長 | 1,738 bytes |
コンパイル時間 | 742 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 135,308 KB |
最終ジャッジ日時 | 2024-05-02 03:51:30 |
合計ジャッジ時間 | 39,293 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
52,352 KB |
testcase_01 | AC | 47 ms
62,720 KB |
testcase_02 | AC | 38 ms
52,096 KB |
testcase_03 | AC | 1,130 ms
135,308 KB |
testcase_04 | AC | 255 ms
82,432 KB |
testcase_05 | AC | 273 ms
80,000 KB |
testcase_06 | AC | 244 ms
79,872 KB |
testcase_07 | AC | 132 ms
81,408 KB |
testcase_08 | AC | 248 ms
82,560 KB |
testcase_09 | AC | 247 ms
82,424 KB |
testcase_10 | AC | 306 ms
84,104 KB |
testcase_11 | AC | 276 ms
82,688 KB |
testcase_12 | AC | 256 ms
82,560 KB |
testcase_13 | AC | 297 ms
79,360 KB |
testcase_14 | AC | 357 ms
79,320 KB |
testcase_15 | AC | 515 ms
83,224 KB |
testcase_16 | AC | 278 ms
82,688 KB |
testcase_17 | AC | 282 ms
87,168 KB |
testcase_18 | AC | 235 ms
82,176 KB |
testcase_19 | AC | 180 ms
79,360 KB |
testcase_20 | AC | 560 ms
88,584 KB |
testcase_21 | AC | 725 ms
90,132 KB |
testcase_22 | AC | 593 ms
94,192 KB |
testcase_23 | AC | 544 ms
91,648 KB |
testcase_24 | AC | 588 ms
93,380 KB |
testcase_25 | AC | 538 ms
91,828 KB |
testcase_26 | AC | 541 ms
92,292 KB |
testcase_27 | AC | 592 ms
93,072 KB |
testcase_28 | AC | 589 ms
93,584 KB |
testcase_29 | AC | 556 ms
91,456 KB |
testcase_30 | AC | 590 ms
93,452 KB |
testcase_31 | AC | 542 ms
91,676 KB |
testcase_32 | AC | 1,034 ms
95,620 KB |
testcase_33 | AC | 967 ms
95,124 KB |
testcase_34 | AC | 990 ms
94,316 KB |
testcase_35 | AC | 1,006 ms
94,768 KB |
testcase_36 | AC | 976 ms
93,736 KB |
testcase_37 | AC | 977 ms
94,324 KB |
testcase_38 | AC | 979 ms
95,780 KB |
testcase_39 | AC | 989 ms
95,012 KB |
testcase_40 | AC | 988 ms
94,028 KB |
testcase_41 | AC | 523 ms
87,576 KB |
testcase_42 | AC | 864 ms
92,060 KB |
testcase_43 | AC | 1,001 ms
96,164 KB |
testcase_44 | AC | 918 ms
94,036 KB |
testcase_45 | AC | 834 ms
92,184 KB |
testcase_46 | AC | 765 ms
90,432 KB |
testcase_47 | AC | 721 ms
90,612 KB |
testcase_48 | AC | 827 ms
90,184 KB |
testcase_49 | AC | 639 ms
89,428 KB |
testcase_50 | AC | 588 ms
88,728 KB |
testcase_51 | AC | 532 ms
87,268 KB |
testcase_52 | AC | 526 ms
88,432 KB |
testcase_53 | AC | 545 ms
90,180 KB |
testcase_54 | AC | 553 ms
92,984 KB |
testcase_55 | AC | 504 ms
95,128 KB |
ソースコード
from sys import stdin class UnionFind(): def __init__(self, n): self.N = n self.siz = n self.parent_or_size = [-1] * n self.used_list = [] def leader(self, x): if self.parent_or_size[x] < 0: return x if self.parent_or_size[self.parent_or_size[x]] < 0: return self.parent_or_size[x] self.parent_or_size[x] = self.leader(self.parent_or_size[x]) return self.parent_or_size[x] def same(self, x, y): return self.leader(x) == self.leader(y) def merge(self, x, y): rx, ry = self.leader(x), self.leader(y) if rx == ry: return if self.parent_or_size[rx] > self.parent_or_size[ry]: rx, ry = ry, rx self.parent_or_size[rx] += self.parent_or_size[ry] self.parent_or_size[ry] = rx self.siz -= 1 self.used_list.append(rx) self.used_list.append(ry) def reset(self): self.siz = self.N for pos in self.used_list: self.parent_or_size[pos] = -1 self.used_list.clear() N, Q = map(int, input().split()) is_zero = 0 uf = UnionFind(2 * N) pow2 = [0] * (N + 1) pow2[0] = 1 for i in range(N): pow2[i + 1] = (pow2[i] + pow2[i]) % 998244353 for _ in range(Q): query = list(map(int, stdin.readline().split())) if query[0] <= 2: query[1] -= 1 query[2] -= 1 if query[0] == 1: uf.merge(query[1], query[2]) uf.merge(query[1] + N, query[2] + N) else: uf.merge(query[1], query[2] + N) uf.merge(query[1] + N, query[2]) if uf.same(query[1], query[1] + N): is_zero = 1 else: is_zero = 0 uf.reset() print(0 if is_zero else pow2[uf.siz >> 1])