#884791 (C++17) No.226 0-1パズル

• 問題: No.226 0-1パズル
• ユーザー: batasanblog
• 提出日時: 2023-06-25 20:43:03
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 34 ms / 5,000 ms
• コード長: 2,607 bytes
• コンパイル時間: 4,259 ms
• コンパイル使用メモリ: 255,552 KB
• 最終ジャッジ日時: 2025-02-15 02:17:40
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = static_modint<998244353>;
//using mint = modint;
using mint = static_modint<1000000007>;
using vm = vector<mint>;
using vvm = vector<vm>;
ostream &operator<<(ostream &o,const mint &m){cout<<m.val();return o;}
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll,ll>;
using vp = vector<pl>;
#define rep(i,n) for(ll i=0;i<(ll)(n);++i)
#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)
template<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}
template<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
const long long INF = 1e18;
#ifdef DEBUG
#include <debug.hpp>
random_device rd;
mt19937 gen(rd());
ll random(ll l,ll h){
    uniform_int_distribution<ll> dist(l,h);
    return dist(gen);
}
#endif
ll H,W;
vector<string> S,R;
void input(){
    cin>>H>>W;
    S.assign(H,string());
    R.assign(W,string());
    rep(h,H){
        cin>>S.at(h);
        rep(w,W){
            R.at(w).pb(S.at(h).at(w));
        }
    }
}
#ifdef DEBUG
void showall(){
    show(H,W,S,R);
}
#endif
ll ichimatsu(vector<string> vs){
    bool od=false, ev=false;
    rep(i,vs.size())rep(j,vs.at(i).size()){
        char c = vs.at(i).at(j);
        if(c == '0'){
            if((i + j)%2) ev=true;
            else od=true;
        }else if(c == '1'){
            if((i + j)%2) od=true;
            else ev=true;
        }
    }
    if(od && ev) return 0;
    if(!od && !ev) return 2;
    else return 1;  
}
mint check(vector<string> vs){
    ll cnt=0;
    for(auto s:vs){
        bool od=false, ev=false;
        rep(i,s.size()){
            if(s.at(i) == '0'){
                if(i%2) ev=true;
                else od=true;
            }else if(s.at(i) == '1'){
                if(i%2) od=true;
                else ev=true;
            }
        }
        if(od && ev) return 0;
        if(!od && !ev) ++cnt;
    }
    return mint(2).pow(cnt);
}
void logic(){
    mint ans = check(S);
    ans += check(R);
    ans -= ichimatsu(S);
    cout<<ans<<endl;
}
#ifdef DEBUG
ll naive(){
    return 1;
}
#endif
int main(){
    #ifdef DEBUG
    cout << "--- Input ---" << endl;
    #endif
    input();
    #ifdef DEBUG
    showall();
    cout << "--- Logic ---" << endl;
    #endif
    logic();
    #ifdef DEBUG
    cout << "--- Answer ---" << endl;
    #endif
    //cout<<ans<<endl;
    //while(input())logic();
    #ifdef DEBUG
    //show("naive=",naive());
    #endif
    #ifdef DEBUG
    /*
    rep(q,100){
        N=random(1LL,1000LL);
        ll lans=logic(),nans=naive();
        showall();
        if(lans!=nans){ show(" WA",lans,nans); break; }
        else{ show(" AC",lans,nans); }
    }
    */
    #endif
    return 0;
}
//cout << fixed << setprecision(9);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX