QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #213619 | #6644. Red Black Grid | dread | WA | 17ms | 3684kb | C++14 | 4.3kb | 2023-10-14 15:10:28 | 2023-10-14 15:10:28 |
Judging History
answer
#include <bits/stdc++.h>
const int N = 1003;
int ans[N][N];
void solve() {
int n, k;
std::cin >> n >> k;
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) ans[i][j] = 0;
}
auto Print = [&]() -> void {
std::cout << "Possible\n";
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
if(ans[i][j]) {
std::cout << 'R';
} else {
std::cout << 'B';
}
}
std::cout << '\n';
}
} ;
if(k == 1 || k == 2 * n * (n - 1) - 1) {
std::cout << "Impossible\n";
return ;
}
if(k == 0) {
Print();
return ;
}
if(n == 2) {
if(k == 2) {
ans[0][0] = 1;
} else {
ans[0][0] = ans[1][1] = 1;
}
Print();
return ;
}
if(n == 3) {
if(k == 3) {
ans[0][1] = 1;
Print();
return ;
} else if(k == 5) {
ans[1][0] = ans[1][1] = 1;
Print();
return ;
} else if(k == 7) {
ans[0][1] = ans[2][0] = ans[2][2] = 1;
Print();
return ;
} else if(k == 9) {
ans[0][1] = ans[1][0] = ans[1][2] = 1;
Print();
return ;
}
}
for(int i = 1; i < n - 1; ++i) {
for(int j = 1; j < n - 1; ++j) {
if(k <= 5 && k != 4) {
if(k == 2) {
ans[0][0] = 1;
Print();
return ;
} else if(k == 3) {
ans[0][2] = 1;
Print();
return ;
} else if(k == 5) {
ans[0][0] = ans[0][2] = 1;
Print();
return ;
}
}
if((i + j) % 2 == 0) {
k -= 4;
ans[i][j] = 1;
}
if(k == 0) {
Print();
return ;
}
}
}
for(int i = 2; i <= n - 3; i += 2) {
if(k == 4) {
ans[0][0] = ans[n - 1][n - 1] = 1;
Print();
return ;
}
if(k == 2) {
ans[0][0] = 1;
Print();
return ;
}
ans[0][i] = 1;
k -= 3;
if(k == 0) {
Print();
return ;
}
}
for(int i = (n % 2 + 1); i <= n - 2; i += 2) {
if(k == 4) {
ans[0][0] = ans[n - 1][n - 1] = 1;
Print();
return ;
}
if(k == 2) {
ans[0][0] = 1;
Print();
return ;
}
ans[n - 1][i] = 1;
k -= 3;
if(k == 0) {
Print();
return ;
}
}
for(int i = 2; i <= n - 3; i += 2) {
if(k == 4) {
ans[0][0] = ans[n - 1][n - 1] = 1;
Print();
return ;
}
if(k == 2) {
ans[0][0] = 1;
Print();
return ;
}
ans[i][0] = 1;
k -= 3;
if(k == 0) {
Print();
return ;
}
}
for(int i = (n % 2 + 1); i <= n - 2; i += 2) {
if(k == 4) {
ans[0][0] = ans[n - 1][n - 1] = 1;
Print();
return ;
}
if(k == 2) {
ans[0][0] = 1;
Print();
return ;
}
ans[i][n - 1] = 1;
k -= 3;
if(k == 0) {
Print();
return ;
}
}
if(k & 1) {
k += 3;
ans[0][2] = 0;
}
if(k == 2) {
ans[0][0] = 1;
} else if(k == 4) {
ans[0][0] = ans[0][n - 1] = 1;
} else if(k == 6) {
ans[0][0] = ans[0][n - 1] = ans[n - 1][0] = 1;
} else if(k == 8) {
ans[0][0] = ans[0][n - 1] = ans[n - 1][0] = ans[n - 1][n - 1] = 1;
}
Print();
return ;
}
int main() {
std::cin.tie(nullptr) -> sync_with_stdio(false);
int T = 1;
std::cin >> T;
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3508kb
input:
2 3 6 3 1
output:
Possible RBB BRB BBB Impossible
result:
ok correct! (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 17ms
memory: 3684kb
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 B Possible RB BR Impossible Possible RB BB Impossible Possible BB BB Possible RBR BRB RBR Impossible Possible RBR BRB RBB Possible BRB RBR BBB Possible RBR BRB BBB Possible BRB BBB RBR Possible RBB BRB BBB Possible BBB RRB BBB Possible BBB BRB BBB Possible BRB BBB BBB Possible RBB BBB BBB I...
result:
wrong answer Condition failed: "getNum(vec) == k" (test case 20)