QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#534478 | #5438. Half Mixed | Sound_Medium | WA | 38ms | 3624kb | C++23 | 1.4kb | 2024-08-27 11:06:12 | 2024-08-27 11:06:13 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
void solve () {
cin>>n>>m;
if(n<=2&&m<=2){
cout<<"No\n";
return;
}
if((m*m-m)%2==0&&m>=3){
int k=(m*m-m)/2;
int flag=-1;
for(int i=1;i<=m-2;i++){
if(k==1+i*i+(m-i-1)*(m-i-1)){
flag=i;
break;
}
}
if(flag>0){
vector<int>a(m+1,1);
a[flag+1]=0;
cout<<"Yes\n";
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[j]<<" ";
}cout<<"\n";
}
return ;
}
}
if((n*n-n)%2==0&&n>=3){
int k=(n*n-n)/2;
int flag=-1;
for(int i=1;i<=n-2;i++){
if(k==1+i*i+(n-i-1)*(n-i-1)){
flag=i;
break;
}
}
if(flag>0){
vector<int>a(n+1,1);
a[flag+1]=0;
cout<<"Yes\n";
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[i]<<" ";
}cout<<"\n";
}
return ;
}
}
cout<<"No\n";
}
signed main () {
int T = 1;
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>T;
while (T --) solve ();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 38ms
memory: 3572kb
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 1 0 1 Yes 1 0 1 1 Yes 1 0 1 1 0 1 Yes 1 1 0 0 1 1 Yes 1 0 1 1 No Yes 1 0 1 1 1 0 1 1 Yes 1 0 1 1 0 1 1 0 1 Yes 1 1 0 0 1 1 1 1 No No No Yes 1 0 1 1 1 0 1 1 1 0 1 1 Yes 1 0 1 1 0 1 1 0 1 1 0 1 No No Yes 1 1 0 1 1 1 1 No Yes 1 1 1 1 1 0 0 0 0 0...
result:
wrong answer Wrong Verdict (test case 29)