結果

問題 No.2293 無向辺 2-SAT
ユーザー mkawa2
提出日時 2025-04-24 14:35:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 446 ms / 4,000 ms
コード長 2,754 bytes
コンパイル時間 524 ms
コンパイル使用メモリ 82,320 KB
実行使用メモリ 97,216 KB
最終ジャッジ日時 2025-04-24 14:36:09
合計ジャッジ時間 26,773 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class UnionFind:
    def __init__(self, n, op, inv, e=0):
        self._tree = [-1]*n
        self._weight = [e]*n
        self._op = op
        self._inv = inv
        self._e = e
        self.cnt = n
        self.log = set()

    def root(self, u):
        stack = []
        while self._tree[u] >= 0:
            stack.append(u)
            u = self._tree[u]
        pre = self._e
        while stack:
            v = stack.pop()
            self._tree[v] = u
            self._weight[v] = self._op(self._weight[v], pre)
            pre = self._weight[v]
        return u

    def same(self, u, v):
        return self.root(u) == self.root(v)

    # w(u)+d=w(v)
    # 成功:1 済み:0 矛盾:-1 を返す
    def merge(self, u, v, d):
        ru, rv = self.root(u), self.root(v)
        if ru == rv: return -1*(self._op(self._weight[u], d) != self._weight[v])
        self.log.add(u)
        self.log.add(v)
        if self._tree[ru] > self._tree[rv]: ru, rv, u, v, d = rv, ru, v, u, self._inv(d)
        self._tree[ru] += self._tree[rv]
        self._tree[rv] = ru
        self._weight[rv] = self._op(self._op(self._weight[u], d), self._inv(self._weight[v]))
        self.cnt -= 1
        return 1

    # size of connected component
    def size(self, u):
        return -self._tree[self.root(u)]

    def dist(self, u, v):
        ru, rv = self.root(u), self.root(v)
        if ru != rv: return None
        return self._op(self._weight[v], self._inv(self._weight[u]))

    def back(self):
        for u in self.log:
            self._tree[u] = -1
            self._weight[u] = self._e
        self.cnt = len(self._tree)
        self.log = set()

pw = [1]
for _ in range(200005): pw.append(pw[-1]*2%md)

n, q = LI()
uf = UnionFind(n, lambda a, b: a ^ b, lambda a: a)
ng = 0
for _ in range(q):
    t, *uv = LI()
    if t == 3:
        uf.back()
        ng = 0
    elif ng == 0:
        u, v = uv
        if uf.merge(u-1, v-1, t-1) == -1: ng = 1
    print(0 if ng else pw[uf.cnt])
0