QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#203316 | #6309. Aqre | ___ | WA | 0ms | 1664kb | C11 | 1.4kb | 2023-10-06 16:45:49 | 2023-10-06 16:45:50 |
Judging History
answer
#include<stdio.h>
int s1[4][4]={
{1,1,1,0},{0,1,1,1},{1,1,0,1},{1,0,1,1}
};
int s4[4][4]={
{1,1,1,0},{1,0,1,1},{0,1,1,1},{1,1,0,1}
};
int s3[4][4];
int s2[4][4]={
{1,1,1,0},
{1,0,1,1},
{1,1,1,0},
{0,1,0,0}
};
int a[1000][1000];
int main(){
int t;scanf("%d",&t);
for(int i=0;i<4;i++)for(int j=0;j<4;j++)
s3[i][j]=s1[j][i];
for(int pwp=1;pwp<=t;pwp++){
int n,m;
scanf("%d%d",&n,&m);
// printf("PPP%d %d %d\n",pwp,n,m);
int cnt=0;
if(n<=3&&m<=3){
printf("%d\n",n*m);
for(int i=1;i<=n;i++){
for(int i=1;i<=m;i++)putchar('1');
putchar('\n');
}
continue;
}
int (*s)[4];
if(n<4||m<4)s=s2;
else if(m%2!=1||n%2==1)s=s1;
else s=s3;
if(n%4==1&&m%4==1)s=s4;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++){
if(0&&(i==0&&j==m-1&&n%4==1&&m%4==1))a[i][j]=0;
else{
a[i][j]=s[i%4][j%4];
if(a[i][j])cnt++;
}
}
printf("%d\n",cnt);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)putchar(a[i][j]+'0');
putchar('\n');
}
// if(pwp==61)while(1);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1612kb
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: 0ms
memory: 1664kb
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 ans finds a larger answer (test case 81)