#866823 (C++14) No.2291 Union Find Estimate

提出ソース

結果

問題	No.2291 Union Find Estimate
ユーザー	kztasa
提出日時	2023-05-06 03:22:32
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	316 ms / 2,000 ms
コード長	6,680 bytes
コンパイル時間	5,086 ms
コンパイル使用メモリ	247,024 KB
実行使用メモリ	8,024 KB
最終ジャッジ日時	2024-05-02 20:40:31
合計ジャッジ時間	6,136 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	316 ms 5,376 KB
testcase_03	AC	16 ms 8,024 KB
testcase_04	AC	15 ms 5,376 KB
testcase_05	AC	15 ms 5,376 KB
testcase_06	AC	9 ms 5,376 KB
testcase_07	AC	6 ms 5,376 KB
testcase_08	AC	8 ms 5,376 KB
testcase_09	AC	8 ms 5,376 KB
testcase_10	AC	23 ms 5,376 KB
testcase_11	AC	37 ms 5,376 KB
testcase_12	AC	66 ms 5,376 KB
testcase_13	AC	8 ms 5,376 KB
testcase_14	AC	18 ms 5,376 KB
testcase_15	AC	17 ms 5,404 KB
testcase_16	AC	14 ms 5,376 KB
testcase_17	AC	7 ms 5,376 KB
testcase_18	AC	7 ms 5,376 KB
testcase_19	AC	23 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h> 
#include <atcoder/all>
#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define all(c) (c).begin(), (c).end()
using namespace std;
using namespace atcoder;
using ll = long long; using dd = double;
using Pll = pair<ll, ll>;
using    vll = vector<   ll>; using   vdd = vector< dd>;
using   vvll = vector<  vll>; using  vvdd = vector<vdd>;
using  vvvll = vector< vvll>; using vvvdd = vector<vvdd>;
using vvvvll = vector<vvvll>;
using  vchar = vector< char>;
using vvchar = vector<vchar>;
using mint = modint998244353;
using mint2 = modint1000000007;
using  vmint = vector< mint>; using  vmint2 = vector< mint2>;
using vvmint = vector<vmint>; using vvmint2 = vector<vmint2>;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;

//////////////////////////////////////////////////////////

template <typename T>
bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

ll rem(ll A, ll B) {
	ll t = A % B; if (t < 0) { t += B; } return t;
}

string zfill(int n, const int width)
{
	stringstream ss;
	ss << setw(width) << setfill('0') << n;
	return ss.str();
}

//1+2+3+…+N
ll OnetoN_sum(ll N) {
	return (N * (N + 1)) / 2;
}

template<typename T>
void outvec(vector<T> A) {
	ll N = A.size();
	rep(i, N) { cout << A[i] << " "; }
	cout << endl;
	return;
}
template<typename T>
void outvec(vector<vector<T>> A) {
	ll N = A.size();
	rep(i, N) { outvec(A[i]); }
	return;
}

ll max(int x, ll y) { return max((ll)x, y); }
ll max(ll x, int y) { return max(x, (ll)y); }
int min(int x, ll y) { return min((ll)x, y); }
int min(ll x, int y) { return min(x, (ll)y); }

template<typename T = int>
std::map<T, ll> factorize(T n) {
	std::map<T, ll> factor_map;
	for (T i = 2; i * i <= n; i++) {
		while (!(n % i)) {
			factor_map[i]++; n /= i;
		}
	}
	if (n > 1) factor_map[n]++;
	return factor_map;
}

template<typename T = int>
vector<long long> divisor(T n) {
	vector<long long> ret;
	for (long long i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			ret.push_back(i);
			if (i * i != n) ret.push_back(n / i);
		}
	}
	sort(ret.begin(), ret.end()); // 昇順に並べる
	return ret;
}

template<typename T = int>
vector<vector<ll>> div2(ll N) {
	vector<vector<ll>> isprime(N + 1);
	for (ll p = 1; p <= N; ++p) {
		for (ll q = p; q <= N; q += p) {
			isprime[q].eb(p);
		}
	}
	return isprime;
}

template<typename T = int>
bool isp(T num) {
	if (num < 2) return false;
	else if (num == 2) return true;
	else if (num % 2 == 0) return false;
	double sqrtNum = sqrt(num);
	for (int i = 3; i <= sqrtNum; i += 2) {
		if (num % i == 0) {
			return false;
		}
	}
	return true;
}

template<typename T = int>
vector<bool> Era(ll N) {
	vector<bool> isprime(N + 1, true);
	isprime[0] = isprime[1] = false;
	for (ll p = 2; p <= N; ++p) {
		if (!isprime[p]) continue;
		for (ll q = p * 2; q <= N; q += p) {
			isprime[q] = false;
		}
	}
	return isprime;
}

const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll LIS(const std::vector<ll>& v) {
	std::vector<ll> dp;
	for (const auto& elem : v) {
		auto it = std::lower_bound(dp.begin(), dp.end(), elem);
		if (it == dp.end()) {
			dp.push_back(elem);
		}
		else {
			*it = elem;
		}
	}
	return dp.size();
}

vll Cumlative_Sum_of_Vector(vll A) {
	ll n = A.size();
	vll S(n + 1);
	S[0] = 0;
	rep(i, n) {
		S[i + 1] = S[i] + A[i];
	}
	return S;
}

bool Isin(ll a, ll b, ll H, ll W) {
	if (a >= 0 && a < H && b >= 0 && b < W) {
		return true;
	}
	else {
		return false;
	}
}

vll BFS(vvll G, ll start) {
	queue<ll> que;
	vll dist(G.size(), -1);
	dist[start] = 0;
	que.push(start);
	while (!que.empty()) {
		ll v = que.front();
		que.pop();
		for (auto nv : G[v]) {
			if (dist[nv] != -1) {
				continue;
			}
			dist[nv] = dist[v] + 1;
			que.push(nv);
		}
	}
	return dist;
}

vvll BFS2(vvll G) {
	vvll dist(G.size(), vll(G.size(), -1));
	rep(i, G.size()) {
		queue<ll> que;
		dist[i][i] = 0;
		que.push(i);
		while (!que.empty()) {
			ll v = que.front();
			que.pop();
			for (auto nv : G[v]) {
				if (dist[i][nv] != -1) {
					continue;
				}
				dist[i][nv] = dist[i][v] + 1;
				que.push(nv);
			}
		}
	}
	return dist;
}
/////////////////////////////////////////////////////



int main() {
	//cout << fixed << setprecision(10);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll W;
	ll H;
	cin >> W >> H;
	vll num(W, -1);
	ll cnt = W;
	dsu uf(W);
	bool ok = true;
	rep(i, H) {
		string q; cin >> q;
		vector<vector<ll>> same(26);
		rep(j, W) {
			rep(k, 26) {
				if (q[j] == 'a' + k) {
					same[k].eb(j);
				}
			}
		}
		rep(j, 26) {
			if (same[j].size() <= 1) {
				continue;
			}
			rep(k, same[j].size() - 1) {
				if (!uf.same(same[j][k], same[j][k + 1])) {
					if (num[uf.leader(same[j][k])] == -1 && num[uf.leader(same[j][k + 1])] == -1) {
						uf.merge(same[j][k], same[j][k + 1]);
						cnt--;
					}
					else if (num[uf.leader(same[j][k])] != -1 && num[uf.leader(same[j][k + 1])] != -1) {
						if (num[uf.leader(same[j][k])] != num[uf.leader(same[j][k + 1])]) {
							ok = false;
						}
						uf.merge(same[j][k], same[j][k + 1]);
					}
					else if (num[uf.leader(same[j][k])] == -1 && num[uf.leader(same[j][k + 1])] != -1) {
						cnt--;
						ll n = num[uf.leader(same[j][k + 1])];
						uf.merge(same[j][k], same[j][k + 1]);
						num[uf.leader(same[j][k])] = n;
					}
					else {
						cnt--;
						ll n = num[uf.leader(same[j][k])];
						uf.merge(same[j][k], same[j][k + 1]);
						num[uf.leader(same[j][k])] = n;
					}
				}
			}
		}
		rep(j, W) {
			if (q[j] == '?') {
				continue;
			}
			rep(k, 10) {
				if (q[j] == '0' + k) {
					if (num[uf.leader(j)] == -1) {
						num[uf.leader(j)] = k;
						cnt--;
					}
					else {
						if (num[uf.leader(j)] != k) {
							ok = false;
						}
					}
				}
			}
		}
		if (ok) {
			cout << pow_mod(10, cnt, 998244353) << endl;
		}
		else {
			cout << 0 << endl;
		}
	}
}

yukicoder

結果

テストケース

ソースコード