結果
問題 | No.2837 Flip Triomino |
ユーザー | syndrome |
提出日時 | 2024-08-09 21:45:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 16 ms / 2,000 ms |
コード長 | 5,634 bytes |
コンパイル時間 | 2,337 ms |
コンパイル使用メモリ | 212,656 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-08-09 21:45:57 |
合計ジャッジ時間 | 3,534 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 7 ms
6,944 KB |
testcase_08 | AC | 16 ms
6,948 KB |
testcase_09 | AC | 8 ms
6,944 KB |
testcase_10 | AC | 8 ms
6,944 KB |
testcase_11 | AC | 9 ms
6,940 KB |
testcase_12 | AC | 9 ms
6,940 KB |
testcase_13 | AC | 7 ms
6,944 KB |
testcase_14 | AC | 8 ms
6,940 KB |
testcase_15 | AC | 9 ms
6,940 KB |
testcase_16 | AC | 10 ms
6,940 KB |
testcase_17 | AC | 9 ms
6,940 KB |
testcase_18 | AC | 8 ms
6,940 KB |
testcase_19 | AC | 9 ms
6,944 KB |
testcase_20 | AC | 6 ms
6,940 KB |
testcase_21 | AC | 7 ms
6,940 KB |
testcase_22 | AC | 12 ms
6,940 KB |
testcase_23 | AC | 11 ms
6,944 KB |
testcase_24 | AC | 11 ms
6,944 KB |
testcase_25 | AC | 11 ms
6,944 KB |
testcase_26 | AC | 11 ms
6,940 KB |
testcase_27 | AC | 5 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 5 ms
6,940 KB |
testcase_31 | AC | 4 ms
6,940 KB |
testcase_32 | AC | 4 ms
6,940 KB |
testcase_33 | AC | 6 ms
6,944 KB |
testcase_34 | AC | 1 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,944 KB |
testcase_36 | AC | 5 ms
6,940 KB |
ソースコード
// (◕ᴗ◕✿) // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rep(i, n) for (ll i = 0; i < (n); i++) #define srep(i, s, n) for (ll i = s; i < (n); i++) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using vvv = vv<vc<T>>; using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>; using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>; using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>; using uint = unsigned int; using ull = unsigned long long; const ld pi = acos(-1.0); const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; // const ll mod = 1000000007; const ll mod = 998244353; inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); } #define debug(var) do{std::cout << #var << " : \n";view(var);}while(0) template<typename T> void view(T e){cout << e << endl;} template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;} template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } } struct modint { int Mod = mod; int val; using mint = modint; modint() {}; modint(ll v) { if (0 <= v && v < Mod) val = v; else{ v %= Mod; if (v < 0) v += Mod; val = v; } } mint operator++(int){ val++; if (val == Mod) val = 0; return *this; } mint operator--(int){ if (val == 0) val = Mod; val--; return *this; } mint& operator+=(const mint& v){ val += v.val; if (val >= Mod) val -= Mod; return *this; } mint& operator-=(const mint& v){ val -= v.val; if (val < 0) val += Mod; return *this; } mint& operator*=(const mint& v){ val = (int)(1ll * val * v.val % Mod); return *this; } modint inverse() const { int a = val, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b), swap(u -= t * v, v); } return modint(u); } mint pow(ll n) const { mint a = *this, ret = 1; while (n > 0){ if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; } mint& operator>>=(ll k){ *this *= mint(2).pow(k).pow(Mod - 2); return *this; } mint& operator<<=(ll k){ *this *= mint(2).pow(k); return *this; } mint operator/=(const mint& v){ *this *= v.inverse(); return *this; } mint operator-() const { return mint(-val);} friend mint operator+(const mint& u, const mint& v){return mint(u) += v;} friend mint operator-(const mint& u, const mint& v){return mint(u) -= v;} friend mint operator*(const mint& u, const mint& v){return mint(u) *= v;} friend mint operator/(const mint& u, const mint& v){return mint(u) /= v;} friend bool operator==(const mint& u, const mint& v){return u.val == v.val;} friend bool operator!=(const mint& u, const mint& v){return u.val != v.val;} friend bool operator>(const mint& u, const mint& v){return u.val > v.val;} friend bool operator<(const mint& u, const mint& v){return u.val < v.val;} friend mint operator>>(mint& u, const ll k){return u >>= k;} friend mint operator<<(mint& u, const ll k){return u <<= k;} friend ostream& operator<<(ostream& stream, mint& v){ stream << v.val; return stream; } }; using mint = modint; struct Binoms { public : Binoms(int n){ fact = vc<mint>(1, 1); inv_fact = vc<mint>(1, 1); update(n); }; void update(int n){ if (sz >= n) return; fact.resize(n + 1, 1); inv_fact.resize(n + 1, 1); for (int i = sz; i < n; i++) fact[i + 1] = fact[i] * (i + 1); inv_fact[n] = 1 / fact[n]; for (int i = n - 1; i >= sz + 1; i--) inv_fact[i] = inv_fact[i + 1] * (i + 1); sz = n; return; } mint C(int n, int k){ if (n < k || k < 0) return 0; if (sz < n) update(n); return fact[n] * inv_fact[n - k] * inv_fact[k]; } mint fac(int n){ if (sz < n) update(n); return fact[n]; } mint invfac(int n){ if (sz < n) update(n); return inv_fact[n]; } private : int sz = 0; vc<mint> fact, inv_fact; }; int main(){ int N, M; cin >> N >> M; vc<string> S(N);rep(i, N) cin >> S[i]; vi cnt(3, 0), rcnt(3, 0); rep(i, N) rep(j, M){ if (S[i][j] == 'B') cnt[(i + j) % 3]++; if (S[i][j] == '?') rcnt[(i + j) % 3]++; } mint ans1 = 1, ans2 = 1; Binoms B(1); rep(i, 3){ mint f = 0; if (cnt[i] % 2){ for (int j = 1; j <= rcnt[i]; j += 2) f += B.C(rcnt[i], j); }else{ for (int j = 0; j <= rcnt[i]; j += 2) f += B.C(rcnt[i], j); } ans1 *= f; } rep(i, 3){ mint f = 0; if (cnt[i] % 2){ for (int j = 0; j <= rcnt[i]; j += 2) f += B.C(rcnt[i], j); }else{ for (int j = 1; j <= rcnt[i]; j += 2) f += B.C(rcnt[i], j); } ans2 *= f; } cout << (ans1 + ans2).val << endl; }