QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #432185 | #6644. Red Black Grid | ucup-team3215 | WA | 4ms | 3712kb | C++20 | 613b | 2024-06-06 21:42:59 | 2024-06-06 21:43:00 |
Judging History
answer
#include <iostream>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
for (int tc = (cin >> tc, tc); tc--; ) {
int n, k; cin >> n >> k;
string s(n * n, 'R');
for (int i = 0, t = n == 3 && k % 2 && k < 11; i < n; ++i)
for (int j = (i + (t && i != n - 1)) % 2; j < n; j += 2) {
int cur = 4 - (!i || i == n - 1) - (!j || j == n - 1);
if (k >= cur && k - cur != 1) s[i * n + j] = 'B', k -= cur;
}
if (!k && (cout << "Possible\n"))
for (int i = 0; i < n; ++i) cout << s.substr(i * n, n) << '\n';
else cout << "Impossible\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3464kb
input:
2 3 6 3 1
output:
Possible BRB RRR BRR Impossible
result:
ok correct! (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 3712kb
input:
4424 1 0 2 4 2 3 2 2 2 1 2 0 3 12 3 11 3 10 3 9 3 8 3 7 3 6 3 5 3 4 3 3 3 2 3 1 3 0 4 24 4 23 4 22 4 21 4 20 4 19 4 18 4 17 4 16 4 15 4 14 4 13 4 12 4 11 4 10 4 9 4 8 4 7 4 6 4 5 4 4 4 3 4 2 4 1 4 0 5 40 5 39 5 38 5 37 5 36 5 35 5 34 5 33 5 32 5 31 5 30 5 29 5 28 5 27 5 26 5 25 5 24 5 23 5 22 5 21 5...
output:
Possible R Possible BR RB Impossible Possible BR RR Impossible Possible RR RR Possible BRB RBR BRB Impossible Possible BRB RBR BRR Possible RBR BRB RRR Possible BRB RBR RRR Possible RBR RRR BRB Possible BRB RRR BRR Possible RBR RRR BRR Possible BRB RRR RRR Possible RBR RRR RRR Possible BRR RRR RRR I...
result:
wrong answer Condition failed: "A == B" (test case 90)