QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #539790 | #9114. Black or White 2 | liyelin | WA | 0ms | 3592kb | C++14 | 3.3kb | 2024-08-31 15:41:15 | 2024-08-31 15:41:15 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define PB push_back
#define MP make_pair
#define PII pair<int, int>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define ROF(i, r, l) for (int i = (r); i >= (l); --i)
#define FI first
#define SE second
#define SZ size()
using namespace std;
const int N = 1.5e3 + 5;
const int mod = 998244353;
const int inf = 1e18;
int n, T, m, k;
bool mp[N][N], flag;
void print() {
if (!flag) {
FOR (i, 1, n) {
FOR (j, 1, m) {
if (i > 1 && j > 1) {
int sum = mp[i][j];
sum += mp[i - 1][j];
sum += mp[i - 1][j - 1];
sum += mp[i][j - 1];
if (sum == 2) {
cout << n << m << endl;
exit(0);
}
}
cout << mp[i][j];
}
cout << '\n';
}
return;
}
FOR (i, 1, m) {
FOR (j, 1, n) {
cout << mp[j][i];
}
cout << '\n';
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> T;
while (T --> 0) {
cin >> n >> m >> k;
flag = 0;
PII lst = MP(0, 0);
if (n < m) {
swap(n, m);
flag = 1;
}
FOR (i, 1, n) {
FOR (j, 1, m) {
mp[i][j] = 0;
}
}
if (!k) {
print();
continue;
}
if (n == 2 && m == 2 && k == 2) {
cout << "10\n01\n";
continue;
}
if (!k) {
print();
continue;
}
mp[1][1] = 1;
--k;
if (!k) {
print();
continue;
}
if (k == 1) {
if (m == 2) {
mp[3][1] = 1;
} else {
mp[1][3] = 1;
}
print();
continue;
}
if (k == 2) {
mp[2][1] = mp[1][2] = 1;
print();
continue;
}
FOR (i, 3, m) {
mp[1][i] = 1;
--k;
if (!k) {
break;
}
++i;
}
FOR (i, 1, n - 1) {
FOR (j, 1, m) {
if (k <= 0 || (j & 1) == (i & 1)) {
continue;
}
lst = MP(i, j);
k -= 2;
mp[i][j] = mp[i + 1][j] = 1;
}
}
if (n & 1) {
FOR (j, 2, m) {
if (k <= 0) {
break;
}
--k;
mp[n][j] = 1;
j++;
}
} else {
FOR (j, 1, m) {
if (k <= 0) {
break;
}
--k;
mp[n][j] = 1;
j++;
}
}
if (k == -1) {
mp[1][1] = 0;
++k;
if (lst.FI == 1) {
mp[lst.FI][lst.SE] = mp[lst.FI + 1][lst.SE] = 0;
mp[2][1] = mp[3][1] = 1;
}
}
print();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
input:
2 2 2 2 2 3 0
output:
10 01 000 000
result:
ok Output is valid. OK.
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3592kb
input:
27520 2 2 0 2 2 1 2 2 2 2 2 3 2 2 4 2 3 0 2 3 1 2 3 2 2 3 3 2 3 4 2 3 5 2 3 6 3 2 0 3 2 1 3 2 2 3 2 3 3 2 4 3 2 5 3 2 6 3 3 0 3 3 1 3 3 2 3 3 3 3 3 4 3 3 5 3 3 6 3 3 7 3 3 8 3 3 9 2 4 0 2 4 1 2 4 2 2 4 3 2 4 4 2 4 5 2 4 6 2 4 7 2 4 8 3 4 0 3 4 1 3 4 2 3 4 3 3 4 4 3 4 5 3 4 6 3 4 7 3 4 8 3 4 9 3 4 10...
output:
00 00 10 00 10 01 11 10 11 11 000 000 100 000 101 000 110 100 011 110 111 110 111 111 00 00 00 10 00 00 10 00 10 11 10 00 01 11 10 11 11 10 11 11 11 000 000 000 100 000 000 101 000 000 110 100 000 111 010 000 011 110 100 111 110 100 011 111 101 111 111 101 111 111 111 0000 0000 1000 0000 1010 0000 1...
result:
wrong answer Token "155" doesn't correspond to pattern "[01]*"