QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #398588 | #3767. 奇矩阵 | sycqwq# | AC ✓ | 161ms | 7632kb | C++14 | 603b | 2024-04-25 15:26:52 | 2024-04-25 15:26:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3+5;
int n,m,a[maxn][maxn];
int main()
{
while(cin>>n>>m)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
int qwq=-1,pd=1;
for(int i=1;i<=n;i++)
{
int t=0;
for(int j=1;j<=m;j++)
t+=a[i][j]&1;
// cout<<t<<'\n';
if(qwq==-1)
qwq=t;
else if((t&1)==(qwq&1))
pd=0;
}
cout<<(pd?"Yes":"No")<<'\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 161ms
memory: 7632kb
input:
1 2 0 0 2 3 1 2 3 2 1 4 3 3 1 2 3 4 5 6 7 8 9 1 1000 8 9 1 7 4 2 0 5 3 7 8 3 4 7 2 3 0 1 7 5 2 8 0 4 9 2 0 9 6 8 3 5 2 6 0 2 6 0 9 3 4 8 5 4 2 2 4 4 6 7 8 1 1 8 0 7 2 0 3 2 6 1 9 1 5 0 0 5 6 7 3 6 1 0 8 2 5 7 0 7 3 8 6 3 1 5 2 1 8 4 1 0 1 2 3 3 6 3 5 6 7 0 7 7 3 2 0 9 9 1 6 0 1 6 3 7 6 3 6 7 4 3 7 7...
output:
Yes Yes No Yes No No Yes No Yes Yes No Yes No Yes Yes Yes Yes No No No Yes Yes Yes No No No Yes Yes Yes Yes Yes Yes No No No Yes Yes No Yes Yes Yes Yes No Yes Yes No Yes Yes Yes No No Yes No No Yes Yes Yes Yes No No Yes No No No No No Yes Yes No Yes No No Yes Yes Yes Yes No Yes No Yes Yes No Yes No ...
result:
ok 257 lines