QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#357987 | #6309. Aqre | JCY_ | WA | 2ms | 3740kb | C++14 | 1.4kb | 2024-03-19 16:08:01 | 2024-03-19 16:08:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
if (y < x) x = y;
}
constexpr int MAXN = 1010;
int n, m;
bool a[MAXN][MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int cas;
cin >> cas;
while (cas--) {
cin >> n >> m;
auto nxt = [](int x) {
if (!x) return 2;
if (x == 2) return 3;
if (x == 3) return 1;
return 0;
};
if (n <= 3 && m <= 3) {
cout << n * m << "\n";
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) cout << '1';
cout << "\n";
}
continue;
}
int cnt = 0;
for (int i = 1, s = 0; i <= n; ++i, s = nxt(s)) {
if ((n & 1) && i == n) s = 0;
fill(a[i] + 1, a[i] + m + 1, false);
for (int j = 1; j <= m; ++j) {
a[i][j] = ((s + j) % 4 != 0);
cnt += a[i][j];
}
}
cout << cnt << "\n";
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) cout << a[i][j];
cout << "\n";
}
}
return 0;
}
/*
g++ L.cpp -o L -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 3740kb
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 1s are not connected. (test case 39)