PARIGAME - VOI 2011 Trò chơi chẵn lẻ
Tác giả: happyboy99x
Ngôn ngữ: C++
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)
#define INF 1000000000
#define N 505
int sr[N][N], sc[N][N], n, k;
bool f[N][N];
int main() {
#ifndef ONLINE_JUDGE
freopen( "input.txt", "r", stdin );
//freopen( "output.txt", "w", stdout );
#endif
scanf("%d",&k); int t;
while(k--) {
scanf("%d",&n);
fo(i,1,n) fo(j,1,n) {
scanf("%d",&t);
sr[i][j] = (sr[i][j-1] + t)&1;
sc[j][i] = (sc[j][i-1] + t)&1;
}
fo(i,1,n) fo(j,1,n) {
f[i][j] = (sr[i][j] == 0 ? !f[i-1][j] : 0)
|| (sc[j][i] == 0 ? !f[i][j-1] : 0);
//f[i][j] = (sr[i][j] == 0 && ((i > 1 && sr[i-1][j] == 0) ? f[i-2][j] : 1) && (sc[j][i-1] == 0 ? f[i-1][j-1] : 1)) || (sc[j][i] == 0 && ((j > 1 && sc[j-1][i] == 0) ? f[i][j-2] : 1) && (sr[i][j-1] == 0 ? f[i-1][j-1] : 1));
}
printf(f[n][n] ? "YES\n" : "NO\n");
}
return 0;
}