結果

問題 No.226 0-1パズル
コンテスト
ユーザー anta
提出日時 2015-06-12 22:33:18
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 3,422 bytes
コンパイル時間 604 ms
コンパイル使用メモリ 85,212 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-26 14:23:16
合計ジャッジ時間 1,265 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt(): x(0) { }
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }
	
	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
	ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
	
	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
	ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
	
	ModInt inverse() const {
		signed a = x, b = MOD, u = 1, v = 0;
		while(b) {
			signed t = a / b;
			a -= t * b; std::swap(a, b);
			u -= t * v; std::swap(u, v);
		}
		if(u < 0) u += Mod;
		ModInt res; res.x = (unsigned)u;
		return res;
	}
	
	bool operator==(ModInt that) const { return x == that.x; }
	bool operator!=(ModInt that) const { return x != that.x; }
	ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
typedef ModInt<1000000007> mint;

int main() {
	int H, W;
	while(cin >> H >> W) {
		vector<string> S(H);
		rep(i, H)
			cin >> S[i];
		mint rows = 1, cols = 1;
		rep(i, H) {
			bool ok0 = true, ok1 = true;
			rep(j, W) {
				char c = S[i][j];
				ok0 &= c == '?' || c == '0' + (j % 2);
				ok1 &= c == '?' || c == '0' + (1 - j % 2);
			}
			rows *= ok0 + ok1;
		}
		rep(j, W) {
			bool ok0 = true, ok1 = true;
			rep(i, H) {
				char c = S[i][j];
				ok0 &= c == '?' || c == '0' + (i % 2);
				ok1 &= c == '?' || c == '0' + (1 - i % 2);
			}
			cols *= ok0 + ok1;
		}
		mint both;
		{	bool ok0 = true, ok1 = true;
			rep(i, H) rep(j, W) {
				char c = S[i][j];
				ok0 &= c == '?' || c == '0' + ((i + j) % 2);
				ok1 &= c == '?' || c == '0' + (1 - (i + j) % 2);
			}
			both = ok0 + ok1;
		}
		mint ans = rows + cols - both;
		cout << ans.get() << endl;
	}
	return 0;
}
0