#866403 (C++17) No.2293 無向辺 2-SAT

• 問題: No.2293 無向辺 2-SAT
• ユーザー: shobonvip
• 提出日時: 2023-05-05 22:06:17
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 568 ms / 4,000 ms
• コード長: 2,894 bytes
• コンパイル時間: 4,268 ms
• コンパイル使用メモリ: 255,896 KB
• 最終ジャッジ日時: 2025-02-12 18:18:44
• ジャッジサーバーID （参考情報）: judge4 / judge4

ファイルパターン	結果
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
namespace shobon {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
  public:
    dsu() : _n(0) {}
    explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}
    int _n;
    std::vector<int> parent_or_size;
    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }
    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }
    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }
    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }
    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
};
}  // namespace atcoder
typedef modint998244353 mint;
typedef long long ll;
int main(){
    int n, q; cin >> n >> q;
    vector<pair<int,int>> stack;
    shobon::dsu uf(2*n);
    mint ans = mint(2).pow(n);
    mint inv2 = mint(2).inv();
    for (int i=0; i<q; i++){
        int t; cin >> t;
        if (t == 2){
            int x, y; cin >> x >> y;
            x--; y--;
            stack.push_back(pair(x, n+y));
            stack.push_back(pair(y, n+x));
            if (!uf.same(x, n+y)) ans *= inv2;
            uf.merge(x, n+y);
            uf.merge(y, n+x);
            if (uf.same(x, n+x)) ans = 0;
            if (uf.same(y, n+y)) ans = 0;           
        }else if(t == 1){
            int x,y; cin >> x >> y;
            x--; y--;
            stack.push_back(pair(x, y));
            stack.push_back(pair(n+y, n+x));
            if (!uf.same(x, y)) ans *= inv2;
            uf.merge(x, y);
            uf.merge(n+y, n+x);
            if (uf.same(x, n+x)) ans = 0;
            if (uf.same(y, n+y)) ans = 0;   
        }else{
            for (auto [u,v]: stack){
                uf.parent_or_size[u] = -1;
                uf.parent_or_size[v] = -1;
            }
            stack.clear();
            ans = mint(2).pow(n);
        }
        cout << ans.val() << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX