[51nod 1851]俄罗斯方块

题目描述

结论

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
int s[10000000+10];
int i,j,k,l,t,n,m,tot,ca;
bool czy;
char ch;
char get(){
char ch=getchar();
while (ch<'0'||ch>'1') ch=getchar();
return ch;
}
int main(){
scanf("%d",&ca);
while (ca--){
scanf("%d%d",&n,&m);
if (n>m) swap(n,m);
t=tot=0;
fo(i,1,n)
fo(j,1,m)
s[++tot]=get()-'0',t+=s[tot];
if (n>=2&&m>=3){
if (t%2==0) printf("Yes\n");else printf("No\n");
//continue;
}
else if (n==2&&m==2){
if (t==0||t==4) printf("Yes\n");else printf("No\n");
//continue;
}
else{
fo(i,1,m-3)
if (s[i]){
s[i]^=1;
s[i+1]^=1;
s[i+2]^=1;
s[i+3]^=1;
}
czy=1;
fo(i,m-2,m)
if (s[i]){
czy=0;
break;
}
if (czy) printf("Yes\n");else printf("No\n");
}
}
}