QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#279915 | #6309. Aqre | forget-star# | WA | 2ms | 1484kb | C++14 | 1.8kb | 2023-12-09 11:49:42 | 2023-12-09 11:49:43 |
Judging History
answer
#include <cstdio>
#include <cstring>
#include <algorithm>
//#include <windows.h>
using namespace std;
int read()
{
int a = 0,x = 1;char ch = getchar();
while(ch > '9' && ch < '0'){if(ch == '-') x = -1;ch = getchar();}
while(ch >= '0' && ch <= '9'){a = a*10 + ch-'0';ch = getchar();}
return a*x;
}
const int N=1e6+7;
int ans[4][4] = {{1,1,1,0},{1,0,1,1},{1,1,0,1},{0,1,1,1}};
int ans0[4][3] = {{1,1,1},{1,0,1},{1,1,1},{0,1,0}};
int n,m;
void solve()
{
n = read(),m = read();int ret = 0;
if(n <= 3 && m <= 3) {
printf("%d\n",n*m);
for(int i = 1;i <= n;i ++,puts("")) for(int j = 1;j <= m;j ++) putchar('1');
} else {
if(n != 3 && m != 3) {
int op = ((n%4==2)&&(m%4==2))||((n%4==1)&&(m%4==1));
for(int i = op;i < op+n;i ++) for(int j = 4-op;j < m+4-op;j ++) ret += ans[i%4][j%4];
printf("%d\n",ret);
for(int i = op;i < op+n;i ++,putchar('\n')) for(int j = 4-op;j < m+4-op;j ++) printf("%d",ans[i%4][j%4]);
} else if(n == 3) {
for(int j = 0;j < m;j ++) ret += ans[0][j%4];
for(int j = 0;j < m;j ++) ret += ans[1][j%4];
for(int j = 0;j < m;j ++) ret += ans[0][j%4];
printf("%d\n",ret);
for(int j = 0;j < m;j ++) printf("%d",ans[0][j%4]);puts("");
for(int j = 0;j < m;j ++) printf("%d",ans[1][j%4]);puts("");
for(int j = 0;j < m;j ++) printf("%d",ans[0][j%4]);puts("");
} else if(m == 3) {
for(int i = 0;i < n;i ++) for(int j = 0;j < m;j ++) ret += ans0[i%4][j%4];
printf("%d\n",ret);
for(int i = 0;i < n;i ++,putchar('\n')) for(int j = 0;j < m;j ++) printf("%d",ans0[i%4][j%4]);
}
}
}
int main()
{
//freopen("in.in","r",stdin);
int T = read();while(T --) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1412kb
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: 1484kb
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 10 110111 111011 11 1110111 1011101 12 11101110 10111011 14 111011101 101110111 16 1101110111 1110111011 17 11101110111 10111011101 18 111011101110 101110111011 20 1110111011101 1011101110111 22 11011101110111 11101110111011 23 111011101110111 101110111011...
result:
wrong answer 1s are not connected. (test case 5)