結果
問題 | No.819 Enjapma game |
ユーザー |
![]() |
提出日時 | 2019-04-08 23:24:17 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,169 bytes |
コンパイル時間 | 1,346 ms |
コンパイル使用メモリ | 160,072 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-01 22:55:27 |
合計ジャッジ時間 | 2,425 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>#define ADD(a, b) a = (a + ll(b)) % mod#define MUL(a, b) a = (a * ll(b)) % mod#define MAX(a, b) a = max(a, b)#define MIN(a, b) a = min(a, b)#define rep(i, a, b) for(int i = int(a); i < int(b); i++)#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)#define all(a) (a).begin(), (a).end()#define sz(v) (int)(v).size()#define pb push_back#define sec second#define fst first#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<int, int> pi;typedef pair<ll, ll> pl;typedef pair<int, pi> ppi;typedef vector<int> vi;typedef vector<ll> vl;typedef vector<vl> mat;typedef complex<double> comp;void Debug() {cout << '\n'; }template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){cout<<arg<<" ";Debug(rest...);}template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){out<<"("<<v.first<<", "<<v.second<<")";return out;}const int MAX_N = 300010;const int MAX_V = 100010;const double eps = 1e-6;const ll mod = 1000000007;const int inf = 1 << 30;const ll linf = 1LL << 60;const double PI = 3.14159265358979323846;///////////////////////////////////////////////////////////////////////////////////////////////////// const int N = 2;// const int M = 5;// int dp[(1 << 20)];// int B[N][M];//// int trans() {// int bit = 0;// rep(i, 0, N) {// rep(j, 0, M) {// if(!B[i][j]) continue;// bit |= (1 << (i * M + j));// }// }// return bit;// }//// void solve() {// dp[0] = 0;// rep(bit, 1, (1 << (N * M))) {// memset(B, 0, sizeof(B));// rep(i, 0, N * M) {// if(bit & (1 << i)) B[i / M][i % M] = 1;// }// rep(i, 0, N * M) {// if(bit & (1 << i)) dp[bit] |= (dp[bit ^ (1 << i)] ^ 1);// }// rep(i, 0, N) {// rep(j, 0, M) {// if(!B[i][j]) continue;// if(i - 1 >= 0 && !B[i - 1][j]) {// B[i][j] = 0;// B[i - 1][j] = 1;// dp[bit] |= (dp[trans()] ^ 1);// B[i][j] = 1;// B[i - 1][j] = 0;// }// if(j - 1 >= 0 && !B[i][j - 1]) {// B[i][j] = 0;// B[i][j - 1] = 1;// dp[bit] |= (dp[trans()] ^ 1);// B[i][j] = 1;// B[i][j - 1] = 0;// }// }// }// debug("omo", dp[bit]);// // rep(i, 0, N) debug(vi(B[i], B[i] + M));// }// }int N, M;string S;void solve() {cin >> N >> M;int res = 0;rep(i, 0, N) {cin >> S;rep(j, 0, M) {if(S[j] != 'o') continue;if((i + j) % 2) res = (res + 2) % 3;else res = (res + 1) % 3;}}if(!res) cout << "YES\n";else cout << "NO\n";}int main() {#ifndef LOCALios::sync_with_stdio(false);cin.tie(0);#endifcout << fixed;cout.precision(20);srand((unsigned int)time(NULL));#ifdef LOCAL//freopen("in.txt", "wt", stdout); //for testerfreopen("in.txt", "rt", stdin);#endifsolve();#ifdef LOCALcerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";#endifreturn 0;}