QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #97617 | #6309. Aqre | ayersz | WA | 2ms | 3392kb | C++20 | 2.9kb | 2023-04-17 15:55:09 | 2023-04-17 15:55:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int solve();
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
const int N = 1005;
int ans[N][N];
int n, m;
int cnt;
const int d[2][5] = {{0, 4, 2, 3, 1}, {0, 4, 2, 4, 0}};
void print() {
cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cnt += ans[i][j];
}
}
cout << cnt << "\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cout << ans[i][j];
}
cout << "\n";
}
}
int solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ans[i][j] = 0;
}
}
if (n <= 3 && m <= 3) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ans[i][j] = 1;
}
}
print();
return 0;
}
if ((n == 3 && m == 4) || (n == 4 && m == 3)) {
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= 3; j++) {
ans[i][j] = 1;
}
}
print();
return 0;
}
if (n <= 2) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j % 2 == 1) {
ans[i][j] = 1;
} else {
if (((j / 2) % 2 == 0 && i == 1) ||
((j / 2) % 2 == 1 && i == n)) {
ans[i][j] = 1;
}
}
}
}
print();
return 0;
}
if (m <= 2) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (((i / 2) % 2 == 0 && j == 1) ||
((i / 2) % 2 == 1 && j == m)) {
ans[i][j] = 1;
}
}
}
print();
return 0;
}
if (n == 3 && (m % 4 == 3)) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
if (d[1][x] != y) {
ans[i][j] = 1;
}
}
}
print();
return 0;
}
if (m == 3 && (n % 4 == 3)) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
if (d[1][y] != x) {
ans[i][j] = 1;
}
}
}
print();
return 0;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x = (i - 1) % 4 + 1, y = (j - 1) % 4 + 1;
if (d[0][x] != y) {
ans[i][j] = 1;
}
}
}
print();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3328kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1110 1110 18 11101110 10111011 11011101
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3392kb
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 1011 1110 8 10111 11101 9 101110 111011 11 1011101 1110111 12 10111011 11101110 14 101110111 111011101 15 1011101110 1110111011 17 10111011101 11101110111 18 101110111011 111011101110 20 1011101110111 1110111011101 21 10111011101110 11101110111011 23 101110111011101 1110111011101...
result:
wrong answer 1s are not connected. (test case 39)