#866519 (PyPy3) No.2293 無向辺 2-SAT

• 問題: No.2293 無向辺 2-SAT
• ユーザー: minimum
• 提出日時: 2023-05-05 22:27:17
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 2,684 ms / 4,000 ms
• コード長: 2,330 bytes
• コンパイル時間: 249 ms
• コンパイル使用メモリ: 82,304 KB
• 実行使用メモリ: 123,248 KB
• 最終ジャッジ日時: 2024-11-23 09:21:14
• 合計ジャッジ時間: 87,828 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 53

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
class DisjointSetUnion():
    def __init__(self, n):
        self.n = n
        self.par_or_size = [-1] * n
    
    def merge(self, a, b):
        assert(0 <= a < self.n)
        assert(0 <= b < self.n)
        la = self.leader(a)
        lb = self.leader(b)
        if la == lb:
            return la
        if -self.par_or_size[la] < -self.par_or_size[lb]:
            la, lb = lb, la
        self.par_or_size[la] += self.par_or_size[lb]
        self.par_or_size[lb] = la
        return la
    
    def same(self, a, b):
        assert(0 <= a < self.n)
        assert(0 <= b < self.n)
        return self.leader(a) == self.leader(b)
    
    def leader(self, a):
        assert(0 <= a < self.n)
        if (self.par_or_size[a] < 0):
            return a
        else:
            self.par_or_size[a] = self.leader(self.par_or_size[a])
            return self.par_or_size[a]
    def size(self, a):
        assert(0 <= a < self.n)
        return - self.par_or_size[self.leader(a)]
    def group(self):
        result = dict()
        for a in range(self.n):
            la = self.leader(a)
            if la not in result:
                result[la] = []
            result[la].append(a)
        return result
MOD = 998244353
N, Q = map(int, input().split())
cnt = N
valid = 1
dsu = DisjointSetUnion(2 * N)
done = set()
for _ in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 2:
        u, v = query[1] - 1, query[2] - 1
        if u != v:
            done.add(u)
            done.add(v)
            if not dsu.same(u, v + N):
                cnt -= 1
            dsu.merge(u, v + N)
            dsu.merge(v, u + N)
            if dsu.same(u, u + N):
                valid = 0
        else:
            valid = 0
    elif query[0] == 1:
        u, v = query[1] - 1, query[2] - 1
        if u != v:
            done.add(u)
            done.add(v)
            if not dsu.same(u, v):
                cnt -= 1
            dsu.merge(u, v)
            dsu.merge(u + N, v + N)
            if dsu.same(u, u + N):
                valid = 0
        else:
            pass
    else:
        cnt = N
        for i in done:
            dsu.par_or_size[i] = -1
            dsu.par_or_size[i + N] = -1
        done = set()
        valid = 1
    if valid:
        print(pow(2, cnt, MOD))
    else:
        print(0)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX