QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #401830 | #5438. Half Mixed | xjt05 | WA | 263ms | 3584kb | C++23 | 910b | 2024-04-29 15:20:35 | 2024-04-29 15:20:36 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<string.h>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#pragma GCC optimize(3,"Ofast","inline")
#define endl "\n"
using namespace std;
typedef long long ll;
ll n,m;
int main()
{
ll n,m,t;
cin>>t;
while(t--)
{
cin>>n>>m;
if((1+n)*n/2*m*(m+1)/2%2==1)
{
cout<<"No"<<endl;
}
else
{
if(m>=3)
{
cout<<"Yes"<<endl;
for(ll i=1;i<=n;i++)
{
for(ll j=1;j<=m;j++)
{
if(j%2==1)
cout<<1<<" ";
else
cout<<0<<" ";
}
cout<<endl;
}
}
if(n>=3)
{
cout<<"Yes"<<endl;
ll ans=0;
for(ll i=1;i<=n;i++)
{
ans++;
for(ll j=1;j<=m;j++)
{
if(ans%2==1)
cout<<0;
else
cout<<1;
}
cout<<endl;
}
}
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3576kb
input:
2 2 3 1 1
output:
Yes 1 0 1 1 0 1 No
result:
ok OK, Accepted. (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 263ms
memory: 3584kb
input:
5382 1 1 1 2 2 1 1 3 2 2 3 1 1 4 2 3 3 2 4 1 1 5 2 4 3 3 4 2 5 1 1 6 2 5 3 4 4 3 5 2 6 1 1 7 2 6 3 5 4 4 5 3 6 2 7 1 1 8 2 7 3 6 4 5 5 4 6 3 7 2 8 1 1 9 2 8 3 7 4 6 5 5 6 4 7 3 8 2 9 1 1 10 2 9 3 8 4 7 5 6 6 5 7 4 8 3 9 2 10 1 1 11 2 10 3 9 4 8 5 7 6 6 7 5 8 4 9 3 10 2 11 1 1 12 2 11 3 10 4 9 5 8 6 ...
output:
No No No Yes 1 0 1 No Yes 0 1 0 Yes 1 0 1 0 Yes 1 0 1 1 0 1 Yes 00 11 00 Yes 0 1 0 1 No Yes 1 0 1 0 1 0 1 0 Yes 1 0 1 1 0 1 1 0 1 Yes 000 111 000 Yes 00 11 00 11 No No No Yes 1 0 1 0 1 0 1 0 1 0 1 0 Yes 0000 1111 0000 Yes 1 0 1 1 0 1 1 0 1 1 0 1 Yes 000 111 000 111 No No Yes 1 0 1 0 ...
result:
wrong answer 6 Mixed Submatrices Found, but 5 Expected (test case 7)