結果
問題 | No.2293 無向辺 2-SAT |
ユーザー | t98slider |
提出日時 | 2023-03-17 18:49:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,501 ms / 4,000 ms |
コード長 | 1,731 bytes |
コンパイル時間 | 453 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 136,968 KB |
最終ジャッジ日時 | 2024-05-02 03:52:37 |
合計ジャッジ時間 | 49,328 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
51,968 KB |
testcase_01 | AC | 52 ms
62,592 KB |
testcase_02 | AC | 44 ms
52,608 KB |
testcase_03 | AC | 1,501 ms
136,968 KB |
testcase_04 | AC | 319 ms
82,176 KB |
testcase_05 | AC | 314 ms
80,384 KB |
testcase_06 | AC | 306 ms
79,744 KB |
testcase_07 | AC | 159 ms
81,664 KB |
testcase_08 | AC | 310 ms
82,180 KB |
testcase_09 | AC | 305 ms
82,420 KB |
testcase_10 | AC | 372 ms
84,232 KB |
testcase_11 | AC | 329 ms
83,072 KB |
testcase_12 | AC | 318 ms
81,920 KB |
testcase_13 | AC | 357 ms
79,360 KB |
testcase_14 | AC | 421 ms
79,188 KB |
testcase_15 | AC | 658 ms
83,284 KB |
testcase_16 | AC | 338 ms
82,688 KB |
testcase_17 | AC | 368 ms
86,912 KB |
testcase_18 | AC | 313 ms
82,048 KB |
testcase_19 | AC | 220 ms
79,360 KB |
testcase_20 | AC | 726 ms
89,652 KB |
testcase_21 | AC | 928 ms
91,512 KB |
testcase_22 | AC | 779 ms
92,972 KB |
testcase_23 | AC | 729 ms
92,620 KB |
testcase_24 | AC | 744 ms
93,552 KB |
testcase_25 | AC | 693 ms
93,860 KB |
testcase_26 | AC | 710 ms
92,032 KB |
testcase_27 | AC | 708 ms
92,328 KB |
testcase_28 | AC | 780 ms
92,440 KB |
testcase_29 | AC | 765 ms
94,172 KB |
testcase_30 | AC | 761 ms
92,668 KB |
testcase_31 | AC | 724 ms
92,588 KB |
testcase_32 | AC | 1,354 ms
95,456 KB |
testcase_33 | AC | 1,374 ms
95,588 KB |
testcase_34 | AC | 1,303 ms
94,616 KB |
testcase_35 | AC | 1,326 ms
96,188 KB |
testcase_36 | AC | 1,308 ms
93,888 KB |
testcase_37 | AC | 1,340 ms
95,512 KB |
testcase_38 | AC | 1,308 ms
95,728 KB |
testcase_39 | AC | 1,310 ms
95,744 KB |
testcase_40 | AC | 1,261 ms
94,992 KB |
testcase_41 | AC | 671 ms
87,712 KB |
testcase_42 | AC | 1,168 ms
94,160 KB |
testcase_43 | AC | 1,340 ms
97,680 KB |
testcase_44 | AC | 1,243 ms
94,520 KB |
testcase_45 | AC | 1,157 ms
93,464 KB |
testcase_46 | AC | 985 ms
91,416 KB |
testcase_47 | AC | 918 ms
90,376 KB |
testcase_48 | AC | 865 ms
89,240 KB |
testcase_49 | AC | 772 ms
89,000 KB |
testcase_50 | AC | 705 ms
88,480 KB |
testcase_51 | AC | 686 ms
87,776 KB |
testcase_52 | AC | 706 ms
88,568 KB |
testcase_53 | AC | 641 ms
88,980 KB |
testcase_54 | AC | 677 ms
93,508 KB |
testcase_55 | AC | 618 ms
95,052 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 x = self.parent_or_size[x] if self.parent_or_size[x] < 0: return 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])