QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#98984 | #6309. Aqre | CharlieVinnie | WA | 6ms | 20096kb | C++14 | 1.9kb | 2023-04-21 07:39:46 | 2023-04-21 07:39:48 |
Judging History
answer
#include "bits/stdc++.h"
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
using namespace std;
const int N=2e3+5; typedef long long ll;
int n,m,mp[N][N],ans[N][N];
void solve(){
cin>>n>>m; int sw=0; if(n>m) swap(n,m),sw=1;
if(m<4){
For(i,1,n) For(j,1,m) ans[i][j]=1;
}
else if(n==2){
For(i,1,m) ans[1][i]=(i%4!=0);
For(i,1,m) ans[2][i]=(i%4!=2);
}
else if(n==3){
For(i,1,m) ans[1][i]=(i%4!=0);
For(i,1,m) ans[2][i]=(i%4!=2);
For(i,1,m) ans[3][i]=(i%4!=0);
}
else{
int dx=0,dy=0;
if(n%4>m%4) swap(n,m),sw^=1;
if(n%4==0){
dx=1; dy=1;
}
else if(n%4==1){
dx=1; dy=1;
}
else if(n%4==2){
dx=2; dy=4;
}
else{
dx=1; dy=1;
}
For(i,1,n) For(j,1,m) ans[i][j]=mp[i+dx-1][j+dy-1];
}
int res=0; For(i,1,n) For(j,1,m) res+=ans[i][j];
cout<<res<<'\n';
if(!sw){
For(i,1,n){
For(j,1,m) cout<<ans[i][j];; cout<<'\n';
}
}
else{
For(j,1,m){
For(i,1,n) cout<<ans[i][j];; cout<<'\n';
}
}
}
signed main(){
For(i,1,4) For(j,1,4) mp[i][j]=1;
mp[1][4]=mp[2][2]=mp[3][3]=mp[4][1]=0;
For(i,1,4) For(j,5,2000) mp[i][j]=mp[i][j-4];
For(i,5,2000) For(j,1,2000) mp[i][j]=mp[i-4][j];
int T; cin>>T; while(T--) solve();
cerr<<"Time = "<<clock()<<" ms"<<endl;
return 0;
}
// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 19988kb
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: 6ms
memory: 20096kb
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 1110 1011 8 11101 10111 9 111011 101110 11 1110111 1011101 12 11101110 10111011 14 111011101 101110111 15 1110111011 1011101110 17 11101110111 10111011101 18 111011101110 101110111011 20 1110111011101 1011101110111 21 11101110111011 10111011101110 23 111011101110111 1011101110111...
result:
wrong answer 1s are not connected. (test case 61)