結果
問題 |
No.2293 無向辺 2-SAT
|
ユーザー |
|
提出日時 | 2023-03-25 15:15:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 774 ms / 4,000 ms |
コード長 | 1,699 bytes |
コンパイル時間 | 493 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 96,824 KB |
最終ジャッジ日時 | 2024-11-22 14:17:10 |
合計ジャッジ時間 | 30,306 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 |
ソースコード
from sys import stdin from collections import deque class UnionFind(): def __init__(self, n): self.N = n self.num_component = n self.parent_or_size = [-1] * n self.weight = [0] * n self.stack = deque() self.is_zero = False def leader(self, x): if self.parent_or_size[x] < 0: return x root = self.leader(self.parent_or_size[x]) self.weight[x] ^= self.weight[self.parent_or_size[x]] self.parent_or_size[x] = root return root def merge(self, x, y, w): rx, ry = self.leader(x), self.leader(y) w ^= self.weight[x] ^ self.weight[y] if rx == ry: if w: self.is_zero = True 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.weight[ry] = w self.num_component -= 1 self.stack.append(ry) self.stack.append(rx) def reset(self): self.num_component = self.N self.is_zero = False while len(self.stack): pos = self.stack.pop() self.parent_or_size[pos] = -1 self.weight[pos] = 0 N, Q = map(int, stdin.readline().split()) uf = UnionFind(N) pow2 = [0] * (N + 1) pow2[0] = 1 for i in range(N): pow2[i + 1] = pow2[i] + pow2[i] if pow2[i + 1] >= 998244353: pow2[i + 1] -= 998244353 for _ in range(Q): query = list(map(int, stdin.readline().split())) if query[0] <= 2: uf.merge(query[1] - 1, query[2] - 1, query[0] - 1) else: uf.reset() print(0 if uf.is_zero else pow2[uf.num_component])