結果
問題 | No.2293 無向辺 2-SAT |
ユーザー | t98slider |
提出日時 | 2023-03-16 08:11:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,384 ms / 4,000 ms |
コード長 | 1,914 bytes |
コンパイル時間 | 430 ms |
コンパイル使用メモリ | 82,312 KB |
実行使用メモリ | 145,872 KB |
最終ジャッジ日時 | 2024-05-02 03:48:26 |
合計ジャッジ時間 | 47,220 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
53,760 KB |
testcase_01 | AC | 49 ms
64,384 KB |
testcase_02 | AC | 40 ms
53,376 KB |
testcase_03 | AC | 1,320 ms
145,872 KB |
testcase_04 | AC | 255 ms
83,384 KB |
testcase_05 | AC | 245 ms
81,036 KB |
testcase_06 | AC | 236 ms
80,640 KB |
testcase_07 | AC | 137 ms
81,280 KB |
testcase_08 | AC | 244 ms
83,292 KB |
testcase_09 | AC | 248 ms
82,732 KB |
testcase_10 | AC | 292 ms
83,940 KB |
testcase_11 | AC | 260 ms
83,200 KB |
testcase_12 | AC | 258 ms
83,712 KB |
testcase_13 | AC | 308 ms
80,256 KB |
testcase_14 | AC | 418 ms
82,568 KB |
testcase_15 | AC | 646 ms
88,176 KB |
testcase_16 | AC | 270 ms
83,800 KB |
testcase_17 | AC | 309 ms
89,356 KB |
testcase_18 | AC | 246 ms
83,456 KB |
testcase_19 | AC | 179 ms
80,512 KB |
testcase_20 | AC | 693 ms
92,176 KB |
testcase_21 | AC | 914 ms
96,464 KB |
testcase_22 | AC | 774 ms
102,944 KB |
testcase_23 | AC | 679 ms
98,388 KB |
testcase_24 | AC | 708 ms
101,060 KB |
testcase_25 | AC | 680 ms
99,916 KB |
testcase_26 | AC | 698 ms
99,344 KB |
testcase_27 | AC | 714 ms
100,172 KB |
testcase_28 | AC | 757 ms
100,024 KB |
testcase_29 | AC | 720 ms
99,812 KB |
testcase_30 | AC | 730 ms
98,736 KB |
testcase_31 | AC | 709 ms
101,420 KB |
testcase_32 | AC | 1,342 ms
104,168 KB |
testcase_33 | AC | 1,323 ms
104,628 KB |
testcase_34 | AC | 1,322 ms
105,216 KB |
testcase_35 | AC | 1,346 ms
108,504 KB |
testcase_36 | AC | 1,369 ms
108,220 KB |
testcase_37 | AC | 1,383 ms
104,924 KB |
testcase_38 | AC | 1,380 ms
107,388 KB |
testcase_39 | AC | 1,356 ms
105,280 KB |
testcase_40 | AC | 1,327 ms
105,256 KB |
testcase_41 | AC | 760 ms
95,096 KB |
testcase_42 | AC | 1,230 ms
103,276 KB |
testcase_43 | AC | 1,384 ms
108,196 KB |
testcase_44 | AC | 1,225 ms
101,956 KB |
testcase_45 | AC | 1,148 ms
103,360 KB |
testcase_46 | AC | 1,027 ms
101,028 KB |
testcase_47 | AC | 885 ms
97,128 KB |
testcase_48 | AC | 784 ms
94,512 KB |
testcase_49 | AC | 766 ms
92,776 KB |
testcase_50 | AC | 704 ms
93,012 KB |
testcase_51 | AC | 666 ms
94,176 KB |
testcase_52 | AC | 670 ms
95,328 KB |
testcase_53 | AC | 652 ms
96,564 KB |
testcase_54 | AC | 686 ms
99,964 KB |
testcase_55 | AC | 675 ms
102,644 KB |
ソースコード
from sys import stdin from collections import deque class UnionFind(): def __init__(self, n): self.N = n self.siz = n self.parent_or_size = [-1] * n self.stack = deque() self.used_list = [] def leader(self, x): if self.parent_or_size[x] < 0: return x self.stack.append(x) x = self.parent_or_size[x] while self.parent_or_size[x] >= 0: self.stack.append(x) x = self.parent_or_size[x] while len(self.stack): self.parent_or_size[self.stack.pop()] = x return 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() if is_zero == 1: print(0) else: print(pow2[uf.siz >> 1])