#866445 (C++17) No.2291 Union Find Estimate

• 問題: No.2291 Union Find Estimate
• ユーザー: kwm_t
• 提出日時: 2023-05-05 22:14:14
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 88 ms / 2,000 ms
• コード長: 2,163 bytes
• コンパイル時間: 4,362 ms
• コンパイル使用メモリ: 258,752 KB
• 最終ジャッジ日時: 2025-02-12 18:31:01
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 18

ソースコード

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
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int w, h; cin >> w >> h;
    map<int, char>mp;
    int num = w;//未決定
    rep(i, w) mp[i] = '.';
    dsu uf(w);
    bool chk = true;
    rep(_, h) {
        string s; cin >> s;
        vector<int>alp(26, -1);
        rep(j, w) {
            if ('?' == s[j])continue;
            if (('0' <= s[j]) && (s[j] <= '9')) {
                char x = s[j];
                int l = uf.leader(j);
                if ('.' != mp[l]) {
                    if (x != mp[l]) {
                        chk = false;
                    }
                }
                else {
                    mp[l] = x;
                    num--;
                }
            }
            else {
                int x = s[j] - 'a';
                if (-1 != alp[x]) {
                    int l0 = uf.leader(alp[x]);
                    int l1 = uf.leader(j);
                    if (l0 != l1) {
                        char c0 = mp[l0];
                        char c1 = mp[l1];
                        int sz0 = uf.size(l0);
                        int sz1 = uf.size(l1);
                        uf.merge(alp[x], j);
                        int nl = uf.leader(j);
                        if (('.' == c0) && ('.' == c1)) {
                            num--;
                        }
                        else if ('.' == c0) {
                            num--;
                            mp[nl] = c1;
                        }
                        else if ('.' == c1) {
                            num--;
                            mp[nl] = c0;
                        }
                        else {
                            if (c0 != c1) {
                                chk = false;
                            }
                        }
                    }
                }
                alp[x] = j;
            }
        }
        //rep(j, w) cout << j <<" " << uf.leader(j) <<" " << mp[uf.leader(j)] << endl;
        if (!chk) {
            cout << 0 << endl;
            continue;
        }
        mint ans = pow_mod(10, num, mod);
        cout << ans.val() << endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX