結果

問題 No.2291 Union Find Estimate
ユーザー sten_sansten_san
提出日時 2023-05-05 21:52:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 3,712 bytes
コンパイル時間 2,299 ms
コンパイル使用メモリ 204,724 KB
最終ジャッジ日時 2025-02-12 18:02:01
ジャッジサーバーID
(参考情報)
judge4 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
struct iofast_t {
iofast_t() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} iofast;
struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
if constexpr (sizeof...(Args) == 0) return vector(arg, init);
else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
return vec(Element(), arg, args...);
}
template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
return distance(begin(c), iter);
}
template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
vector<int> i(distance(first, last));
iota(begin(i), end(i), 0);
sort(begin(i), end(i), [&](auto x, auto y) {
return comp(*(first + x), *(first + y));
});
return i;
}
template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;
template <typename T>
using has_member_sort = decltype(declval<T>().sort());
template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
if constexpr (detect_v<Container, has_member_sort>) {
c.sort(comp);
return c;
}
else {
sort(begin(c), end(c), comp);
return c;
}
}
template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
c.erase(unique(begin(c), end(c), comp), end(c));
return c;
}
template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }
template <typename F>
constexpr auto fix(F &&f) noexcept {
return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
};
}
#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include <atcoder/dsu>
int main() {
int w, h; cin >> w >> h;
atcoder::dsu dsu(w + 10);
int count = w;
while (h--) {
string q; cin >> q;
int p['z' - 'a' + 1];
fill(begin(p), end(p), -1);
for (int i = 0; i < w; ++i) {
if (q[i] == '?') {
continue;
}
if (isdigit(q[i])) {
count -= !dsu.same(i, w + (q[i] - '0'));
dsu.merge(i, w + (q[i] - '0'));
continue;
}
auto &v = p[q[i] - 'a'];
if (0 <= v) {
count -= !dsu.same(v, i);
dsu.merge(v, i);
}
v = i;
}
auto con = [&]() {
for (int i = 0; i < 10; ++i) {
for (int j = i + 1; j < 10; ++j) {
if (dsu.same(w + i, w + j)) {
return true;
}
}
}
return false;
}();
if (con) {
cout << 0 << '\n';
continue;
}
cout << mint(10).pow(count).val() << '\n';
}
cout << flush;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0