QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #298005 | #6309. Aqre | PlentyOfPenalty# | WA | 2ms | 3592kb | C++20 | 1.1kb | 2024-01-05 15:34:57 | 2024-01-05 15:34:57 |
Judging History
answer
#include<bits/stdc++.h>
#define all(x) begin(x),end(x)
using namespace std;
const int N=1e3+9;
int T,n,m,fl,ans,sx,px,py,prt[N][N];
int main(){
#ifndef ONLINE_JUDGE
//freopen(".in","r",stdin);
#endif
cin.tie(0)->sync_with_stdio(0);
cin>>T;
while(T--){
cin>>n>>m;
if(n<=3&&m<=3){
cout<<n*m<<"\n";
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j)cout<<1;
cout<<"\n";
}
continue;
}
if(n>m)swap(n,m),fl=1;
else fl=0;
ans=n*m;
if(n==3){
for(int i=0;i<n;++i)for(int j=0;j<m;++j){
if(((i==0||i==2)&&(j&3)==3)||(i==1&&(j&3)==1))--ans,prt[i][j]=0;
else prt[i][j]=1;
}
}else{
if(m%4==0)swap(n,m),fl^=1;
if(n==2||(n&3)==1)sx=2;
else if(!(n&3))sx=0;
else sx=1;
for(int i=0;i<n;++i)for(int j=0;j<m;++j){
px=(i+sx&3),py=(j&3);
if((px==0&&py==0)||(px==1&&py==2)||(px==2&&py==3)||(px==3&&py==1))--ans,prt[i][j]=0;
else prt[i][j]=1;
}
}
cout<<ans<<"\n";
if(fl)for(int i=0;i<m;++i,cout<<"\n")for(int j=0;j<n;++j)cout<<prt[j][i];
else for(int i=0;i<n;++i,cout<<"\n")for(int j=0;j<m;++j)cout<<prt[i][j];
}
}
/*
9
2 2
3 4
3 8
4 3
8 3
5 5
5 6
6 6
7 6
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3460kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1011 1110 18 11101110 10111011 11101110
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3592kb
input:
361 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 4 12 4 13 4 14 4 15 4 16 4 17 4 18 4 19 4 20 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 1...
output:
4 11 11 6 111 111 6 0111 1110 8 11101 10111 9 111011 101110 11 1110111 1011101 12 01110111 11101110 14 111011101 101110111 15 1110111011 1011101110 17 11101110111 10111011101 18 011101110111 111011101110 20 1110111011101 1011101110111 21 11101110111011 10111011101110 23 111011101110111 1011101110111...
result:
wrong answer 1s are not connected. (test case 7)