結果
問題 | No.2291 Union Find Estimate |
ユーザー |
|
提出日時 | 2023-05-05 21:48:40 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 4,810 bytes |
コンパイル時間 | 16,921 ms |
コンパイル使用メモリ | 244,480 KB |
最終ジャッジ日時 | 2025-02-12 17:59:02 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<atcoder/all>#include <iostream> // cout, endl, cin#include <string> // string, to_string, stoi#include <vector> // vector#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound#include <utility> // pair, make_pair#include <tuple> // tuple, make_tuple#include <cstdint> // int64_t, int*_t#include <cstdio> // printf#include <map> // map#include <queue> // queue, priority_queue#include <set> // set#include <stack> // stack#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset#include <cctype> // isupper, islower, isdigit, toupper, tolower#include <math.h>#include <iomanip>#include <functional>#include<unordered_map>using namespace std;using namespace atcoder;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)typedef long long ll;typedef unsigned long long ull;const ll inf=1e18;using graph = vector<vector<int> > ;using P= pair<ll,ll>;using vi=vector<int>;using vvi=vector<vi>;using vll=vector<ll>;using vvll=vector<vll>;using vp=vector<P>;using vvp=vector<vp>;using vd=vector<double>;using vvd =vector<vd>;//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";//string S="abcdefghijklmnopqrstuvwxyz";//g++ main.cpp -std=c++17 -I .//cout <<setprecision(20);//cout << fixed << setprecision(10);//cin.tie(0); ios::sync_with_stdio(false);const double PI = acos(-1);int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};void putsYes(bool f){cout << (f?"Yes":"No") << endl;}void putsYES(bool f){cout << (f?"YES":"NO") << endl;}void putsFirst(bool f){cout << (f?"First":"Second") << endl;}void debug(int test){cout << "TEST" << " " << test << endl;}ll pow_pow(ll x,ll n,ll mod){if(n==0) return 1;x%=mod;ll res=pow_pow(x*x%mod,n/2,mod);if(n&1)res=res*x%mod;return res;}ll gcd(ll x,ll y){if(y==0)return x;return gcd(y,x%y);}ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}template<class T> bool chmin(T& a, T b) {if (a > b) {a = b;return true;}else return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b;return true;}else return false;}using mint=modint998244353;using vm=vector<mint>;using vvm=vector<vm>;int mod = 998244353;vll fact, fact_inv, inv;void init_nCk(int n) {fact.resize(n+1);fact_inv.resize(n+1);inv.resize(n+1);fact[0] = fact[1] = 1;fact_inv[0] = fact_inv[1] = 1;inv[1] = 1;for (int i = 2; i<=n; i++) {fact[i] = fact[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;}}ll c(int n, int k) {if(n<k)return 0;if(n<0 || k<0)return 0;return fact[n] * (fact_inv[k] * fact_inv[n - k] % mod) % mod;}struct edge{int to; ll cost;edge(int to,ll cost) : to(to),cost(cost){}};using ve=vector<edge>;using vve=vector<ve>;struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;else return par[x] = root(par[x]);}bool issame(int x, int y) {return root(x) == root(y);}bool unite(int x, int y) {x = root(x), y = root(y);if (x == y) return false;if (siz[x] < siz[y]) swap(x, y);par[y] = x;siz[x] += siz[y];return true;}int size(int x) {return siz[root(x)];}};vll anss;string S="abcdefghijklmnopqrstuvwxyz";void solve(int test){int n,h; cin>> n >> h;UnionFind uf(n+10);rep(qi,h){string s; cin >> s;vvi g(26);rep(i,n){if(s[i]=='?')continue;int is=0;rep(j,26)if(s[i]==S[j]){g[s[i]-'a'].push_back(i);is=1;break;}if(!is){uf.unite(i,n+s[i]-'0');}}rep(i,26)repi(j,1,g[i].size())uf.unite(g[i][0],g[i][j]);int is=1;rep(i,10)repi(j,i+1,10)if(uf.issame(n+i,n+j)){is=0;continue;}if(!is){anss.push_back(0);continue;}vi done(n+10);mint ans=1;rep(i,10){done[uf.root(n+i)]=1;}rep(i,n)if(i==uf.root(i) && !done[i]){ans*=10;}anss.push_back(ans.val());}}//python3 expander.py main.cpp//g++ cf.cpp -std=c++17 -I .int main(){cin.tie(0);ios::sync_with_stdio(false);int t=1;//cin >> t;rep(test,t)solve(test);for(auto u:anss)cout << u << endl;}