結果
問題 | No.2837 Flip Triomino |
ユーザー | woodywoody |
提出日時 | 2024-08-10 01:19:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 128 ms / 2,000 ms |
コード長 | 5,528 bytes |
コンパイル時間 | 4,390 ms |
コンパイル使用メモリ | 269,492 KB |
実行使用メモリ | 81,784 KB |
最終ジャッジ日時 | 2024-08-10 01:20:04 |
合計ジャッジ時間 | 9,958 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 104 ms
81,340 KB |
testcase_01 | AC | 113 ms
81,368 KB |
testcase_02 | AC | 107 ms
81,364 KB |
testcase_03 | AC | 106 ms
81,324 KB |
testcase_04 | AC | 105 ms
81,520 KB |
testcase_05 | AC | 106 ms
81,380 KB |
testcase_06 | AC | 108 ms
81,364 KB |
testcase_07 | AC | 108 ms
81,652 KB |
testcase_08 | AC | 107 ms
81,628 KB |
testcase_09 | AC | 106 ms
81,784 KB |
testcase_10 | AC | 108 ms
81,720 KB |
testcase_11 | AC | 109 ms
81,692 KB |
testcase_12 | AC | 117 ms
81,568 KB |
testcase_13 | AC | 106 ms
81,588 KB |
testcase_14 | AC | 109 ms
81,688 KB |
testcase_15 | AC | 109 ms
81,596 KB |
testcase_16 | AC | 109 ms
81,592 KB |
testcase_17 | AC | 109 ms
81,688 KB |
testcase_18 | AC | 106 ms
81,596 KB |
testcase_19 | AC | 113 ms
81,564 KB |
testcase_20 | AC | 109 ms
81,640 KB |
testcase_21 | AC | 110 ms
81,600 KB |
testcase_22 | AC | 121 ms
81,584 KB |
testcase_23 | AC | 115 ms
81,580 KB |
testcase_24 | AC | 112 ms
81,676 KB |
testcase_25 | AC | 118 ms
81,636 KB |
testcase_26 | AC | 114 ms
81,784 KB |
testcase_27 | AC | 107 ms
81,408 KB |
testcase_28 | AC | 112 ms
81,348 KB |
testcase_29 | AC | 111 ms
81,408 KB |
testcase_30 | AC | 109 ms
81,472 KB |
testcase_31 | AC | 128 ms
81,504 KB |
testcase_32 | AC | 104 ms
81,428 KB |
testcase_33 | AC | 106 ms
81,624 KB |
testcase_34 | AC | 104 ms
81,344 KB |
testcase_35 | AC | 104 ms
81,316 KB |
testcase_36 | AC | 105 ms
81,456 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,b) for(int i=0;i<b;i++) #define rrep(i,b) for(int i=b-1;i>=0;i--) #define rep1(i,b) for(int i=1;i<b;i++) #define repx(i,x,b) for(int i=x;i<b;i++) #define rrepx(i,x,b) for(int i=b-1;i>=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>; template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define retval(x) {cout << #x << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outmv fore(yans , ans) cout << yans.val() << "\n"; #define assertmle(x) if (!(x)) {vi v(3e8);} #define asserttle(x) if (!(x)) {while(1){}} #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>; using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>; using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>; using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>; using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector<mint>; using vvm = vector<vector<mint>>; vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<<endl;} #define no {cout <<"No"<<endl;} const double eps = 1e-10; const ll LINF = 2001002003004005006ll; const int INF = 1001001001; #ifdef MY_LOCAL_DEBUG #include "./debug/localDebug.cpp" #define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl #define show1(a) cerr<<#a<<" = "<<a<<endl #define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl #define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl #define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl #define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl #define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl #define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;} #define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";} #define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";} #define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}} #define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}} #else #define showp(p) #define show1(a) #define show2(a,b) #define show3(a,b,c) #define show4(a,b,c,d) #define show5(a,b,c,d,e) #define DEBUG_LINE #define showv(v) #define showv2(v) #define showvm(v) #define showvm2(v) #define showmat(v) #define showmatm(v) #endif #define overload5(a,b,c,d,e,f, ...) f #define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__) struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } } com(10000005); void solve(){ int n,m; cin>>n>>m; vi cnt(3); vi now(3); vs s(n); rep(i,n) cin>>s[i]; rep(i,n) rep(j,m){ int a = (i+j)%3; if (s[i][j]=='?'){ cnt[a]++; }else if(s[i][j]=='B'){ now[a]++; } } vvm dp(3,vm(2)); rep(i,3){ rep(j,cnt[i]+1){ int k = j + now[i]; k = k%2; dp[i][k] += com(cnt[i], j); } } mint ans = 0; rep(i,2){ mint tmp = 1; rep(j,3) tmp *= dp[j][i]; ans += tmp; } outm; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }