QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#306311 | #6309. Aqre | cheben | WA | 0ms | 3872kb | C++14 | 1.0kb | 2024-01-16 17:13:26 | 2024-01-16 17:13:27 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main()
{
int tmp[8][4] = {
{0, 1, 1, 1},
{1, 1, 1, 0},
{1, 0, 1, 1},
{1, 1, 0, 1},
};
int T;
scanf("%d", &T);
while (T--) {
int m, n;
scanf("%d%d", &m, &n);
if (m < 4 && n < 4) {
printf("%d\n", m * n);
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
printf("1");
}
printf("\n");
}
continue;
}
int cnt = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (tmp[i % 4][j % 4] == 1) {
cnt++;
}
}
}
printf("%d\n", cnt);
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
printf("%d", tmp[i % 4][j % 4]);
}
printf("\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 0111 1110 1011 18 01110111 11101110 10111011
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3872kb
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 7 01110 11101 9 011101 111011 11 0111011 1110111 12 01110111 11101110 13 011101110 111011101 15 0111011101 1110111011 17 01110111011 11101110111 18 011101110111 111011101110 19 0111011101110 1110111011101 21 01110111011101 11101110111011 23 011101110111011 1110111011101...
result:
wrong answer 1s are not connected. (test case 4)