結果

問題 No.226 0-1パズル
ユーザー fumiphysfumiphys
提出日時 2019-10-07 21:24:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 5,109 bytes
コンパイル時間 1,441 ms
コンパイル使用メモリ 170,964 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-26 14:24:51
合計ジャッジ時間 2,109 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}


string s[101];

bool z[101], o[101];

int main(int argc, char const* argv[])
{
  int h, w; cin >> h >> w;
  rep(i, h)cin >> s[i];
  bool con = false;
  rep(i, h){
    rep(j, w - 1){
      if(s[i][j] != '?' && s[i][j] == s[i][j+1])con = true;
    }
  }
  if(con){
    rep(i, h){
      rep(j, w){
        if(s[i][j] == '?')continue;
        char c = (((s[i][j] == '0') ^ (i % 2 == 0)) ? '1': '0');
        if(s[0][j] != '?' && s[0][j] != c){
          cout << 0 << endl;
          return 0;
        }
        s[0][j] = c;
      }
    }
    ll cnt = 0;
    rep(i, w)cnt += (s[0][i] == '?');
    cout << power<ll>(2, cnt, mod) << endl;
    return 0;
  }

  //
  ll res = 0;
  rep(i, h){
    z[i] = true, o[i] = true;
    rep(j, w){
      if(j % 2 == 0 && s[i][j] == '1')z[i] = false;
      if(j % 2 == 1 && s[i][j] == '0')z[i] = false;
      if(j % 2 == 0 && s[i][j] == '0')o[i] = false;
      if(j % 2 == 1 && s[i][j] == '1')o[i] = false;
    }
  }
  ll t[2] = {(z[0] ? 1: 0), (o[0] ? 1: 0)};
  for(int i = 1; i < h; i++){
    ll tmp1 = 0, tmp2 = 0;
    if(z[i-1] && z[i])(tmp1 += t[0]) %= mod;
    if(z[i-1] && o[i])(tmp2 += t[0]) %= mod;
    if(o[i-1] && z[i])(tmp1 += t[1]) %= mod;
    if(o[i-1] && o[i])(tmp2 += t[1]) %= mod;
    t[0] = tmp1;
    t[1] = tmp2;
  }
  res = (t[0] + t[1]) % mod;

  // continous
  rep(i, h){
    rep(j, w){
      if(s[i][j] == '?')continue;
      char c = (((s[i][j] == '0') ^ (i % 2 == 0)) ? '1': '0');
      if(s[0][j] != '?' && s[0][j] != c){
        cout << res << endl;
        return 0;
      }
      s[0][j] = c;
    }
  }
  bool ok1 = true, ok2 = true;
  rep(i, w){
    if(i % 2 == 0 && s[0][i] == '1')ok1 = false;
    if(i % 2 == 1 && s[0][i] == '0')ok1 = false;
    if(i % 2 == 0 && s[0][i] == '0')ok2 = false;
    if(i % 2 == 1 && s[0][i] == '1')ok2 = false;
  }
  if(ok1)--res;
  if(ok2)--res;
  res = (res + mod) % mod;
  ll cnt = 0;
  rep(i, w)cnt += (s[0][i] == '?');
  res = (res + power<ll>(2, cnt, mod)) % mod;
  cout << res << endl;
  return 0;
}
0