結果

問題 No.2291 Union Find Estimate
ユーザー jabeejabee
提出日時 2023-05-05 23:41:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 181 ms / 2,000 ms
コード長 7,929 bytes
コンパイル時間 5,353 ms
コンパイル使用メモリ 287,832 KB
実行使用メモリ 41,856 KB
最終ジャッジ日時 2024-05-02 18:59:09
合計ジャッジ時間 7,405 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
19,072 KB
testcase_01 AC 33 ms
19,072 KB
testcase_02 AC 117 ms
18,944 KB
testcase_03 AC 181 ms
41,856 KB
testcase_04 AC 40 ms
19,072 KB
testcase_05 AC 40 ms
19,072 KB
testcase_06 AC 37 ms
19,072 KB
testcase_07 AC 34 ms
19,200 KB
testcase_08 AC 34 ms
18,944 KB
testcase_09 AC 38 ms
19,072 KB
testcase_10 AC 41 ms
19,072 KB
testcase_11 AC 44 ms
18,944 KB
testcase_12 AC 51 ms
19,072 KB
testcase_13 AC 64 ms
24,448 KB
testcase_14 AC 47 ms
19,200 KB
testcase_15 AC 134 ms
30,640 KB
testcase_16 AC 52 ms
20,236 KB
testcase_17 AC 49 ms
20,248 KB
testcase_18 AC 49 ms
20,352 KB
testcase_19 AC 41 ms
19,072 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
void _main() {
  ll w,h;
  cin >> w >> h;
  dsu d(w);
  vector<mint>v(w+5);
  v[0] = 1;
  rep(i,1,w+5)v[i] = v[i-1] * 10;
  map<ll,ll>mp;
  bool ok = true;
  rep(i,0,w)mp[i] = -1;
  ll tot = w;
  ll kaku = 0;
  rep(hi,0,h){
  //  if(hi == 5)cout << hi << " " << d.leader(8) << " " << mp[d.leader(8)] << "\n";
    
    string q;
    cin >> q;
    vector<vector<ll>>pos(26),pos2(10);

    rep(i,0,w){
        if(q[i] == '?')continue;
        if('a' <= q[i] && q[i] <= 'z'){
            pos[q[i] - 'a'].push_back(i);
        }
        if('0' <= q[i] && q[i] <= '9'){
            pos2[q[i] - '0'].push_back(i);
        }        
    }
//    if(hi == 5)cout << hi << " " << d.leader(8) << " " << mp[d.leader(8)] << "\n";
    
    rep(i,0,26){
        rep(j,1,pos[i].size()){
        ll l1 = d.leader(pos[i][j]);
        ll l2 = d.leader(pos[i][j-1]);
        ll l1siz = d.size(l1);
        ll l2siz = d.size(l2);
        ll val1 = mp[l1];
        ll val2 = mp[l2];
//        if(hi == 5)cout << l1 << " " << l2 << " " << val1 << " " << val2 << "\n";
        if(val1 != -1 && val2 != -1 && val1 != val2)ok = false;
        else {
            if(val1 == -1 && val2 == -1){
                d.merge(l1,l2);
                mp[d.leader(l1)] = val1;
            }else if(val1 != -1){
                //kaku -= l2;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l1)] = val1;
            }else if(val2 != -1){
                //kaku -= l1;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l2)] = val2;
            }else{
                //kaku -= l1 + l2;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l1)] = val2;
            }
        }
    }
    }
  // if(hi == 5)cout << hi << " " << d.leader(8) << " " << mp[d.leader(8)] << "\n";
     
   rep(i,0,10){
    bool newval = true;
    //   

    rep(j,1,pos2[i].size()){
        
        ll l1 = d.leader(pos2[i][j]);
        ll l2 = d.leader(pos2[i][j-1]);
        ll l1siz = d.size(l1);
        ll l2siz = d.size(l2);
        ll val1 = mp[l1];
        ll val2 = mp[l2];
        if(val1 != -1 || val2 != -1)newval = false;
        if(val1 != -1 && val2 != -1 && val1 != val2)ok = false;
        else {
            if(val1 == -1 && val2 == -1){
                d.merge(l1,l2);
                mp[d.leader(l1)] = val1;
            }else if(val1 != -1){
                //kaku -= l2;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l1)] = val2;
            }else if(val2 != -1){
                //kaku -= l1;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l2)] = val1;
            }else{
                //kaku -= l1 + l2;
                d.merge(l1,l2);
                //kaku += d.size(d.leader(l1));
                mp[d.leader(l1)] = val2;
            }
        }
        
   }
 //  if(hi == 5)cout << hi << " " << d.leader(8) << " " << mp[d.leader(8)] << "\n";

   if(pos2[i].size()){
   ll l1 = d.leader(pos2[i][0]);
   ll val1 = mp[l1];
   if(val1 != -1)newval = false;
   if(val1 != -1 && val1 != i)ok = false;
   if(newval){
  //  cout << hi << " " << pos2[i][0] << " " << i <<" " << l1 << " " << val1 << "\n";
   // rep(wi,0,w)if(d.same(wi,pos2[i][0]))cout << wi << " ";
   // cout << "\n";
    kaku++;
   }
   mp[l1] = i;
   }
   }
  // if(hi == 5)cout << d.leader(8) << " " << mp[d.leader(8)] << "\n";
    if(ok == false)cout << 0 << "\n";
    else{
        ll siz = d.groups().size();
    //    cout << siz << " " << kaku << "\n";
        cout << v[siz - kaku] << "\n";
    }
   // rep(wi,0,w)cout << d.leader(wi) << " ";
   // cout << "\n";
   // rep(wi,0,w)cout << mp[d.leader(wi)] << " ";
  //  cout << "\n";
  }
}
0