QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #398301 | #3767. 奇矩阵 | Graphcity# | AC ✓ | 70ms | 7584kb | C++20 | 612b | 2024-04-25 10:30:53 | 2024-04-25 10:30:56 |
Judging History
answer
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e3;
int n,m,a[Maxn+5][Maxn+5];
inline void Solve()
{
For(i,1,n) For(j,1,m) cin>>a[i][j];
if(n>2) {cout<<"No"<<endl; return;}
if(n==1) {cout<<"Yes"<<endl; return;}
long long s1=0,s2=0;
For(j,1,m) s1+=a[1][j],s2+=a[2][j];
if((s1^s2)&1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main()
{
// freopen("1.in","r",stdin);
ios::sync_with_stdio(false);
while(cin>>n>>m) Solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 70ms
memory: 7584kb
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