QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#359245 | #6309. Aqre | zhouhuanyi | WA | 2ms | 3856kb | C++23 | 783b | 2024-03-20 15:15:59 | 2024-03-20 15:15:59 |
Judging History
answer
#include<iostream>
#include<cstdio>
using namespace std;
int read()
{
char c=0;
int sum=0;
while (c<'0'||c>'9') c=getchar();
while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
return sum;
}
const int delta[4][4]={1,1,0,1,1,0,1,1,1,1,1,0,0,1,1,1};
int T,n,m;
int main()
{
int cnt;
T=read();
while (T--)
{
n=read(),m=read(),cnt=0;
if (n<=3&&m<=3)
{
printf("%d\n",n*m);
for (int i=1;i<=n;++i)
{
for (int j=1;j<=m;++j) printf("1");
puts("");
}
}
else
{
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j)
cnt+=delta[(i-1)%4][(j-1)%4];
printf("%d\n",cnt);
for (int i=1;i<=n;++i)
{
for (int j=1;j<=m;++j) printf("%d",delta[(i-1)%4][(j-1)%4]);
puts("");
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1101 1011 1110 18 11011101 10111011 11101110
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3856kb
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 1101 1011 8 11011 10111 9 110111 101110 10 1101110 1011101 12 11011101 10111011 14 110111011 101110111 15 1101110111 1011101110 16 11011101110 10111011101 18 110111011101 101110111011 20 1101110111011 1011101110111 21 11011101110111 10111011101110 22 110111011101110 1011101110111...
result:
wrong answer 1s are not connected. (test case 3)