QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#127711 | #6644. Red Black Grid | shielder | AC ✓ | 19ms | 4516kb | C++20 | 4.0kb | 2023-07-19 22:33:39 | 2023-07-19 22:33:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3+10;
#define pll pair<int,int>
set<pll> c[3], s[3];
char a[N][N];
int tt, n, m;
int row[4] = {0,-1,1,0};
int col[4] = {1, 0, 0, -1};
bool check(int n){
int ans = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
for(int k = 0;k < 4;k++){
int x = i + row[k], y = j + col[k];
if(x >= 0 &&x < n &&y >=0 && y < n){
if(a[i][j] != a[x][y]) ans++;
}
}
}
}
if(ans/2 == m) return 1;
return 0;
}
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >>tt;
while(tt--){
cin >> n >>m;
if(m == 1 || m == 2 * (n) * (n-1) - 1){
cout << "Impossible\n";
continue;
}
cout << "Possible\n";
if(m == 2){
// cout << "Possible\n";
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
a[i][j] = 'B';
}
a[i][n] = '\0';
}
a[0][0] = 'R';
for(int i = 0;i < n;i++){
cout <<a[i] <<"\n";
}
continue;
}
if(m == 3){
// cout << "Possible\n";
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
a[i][j] = 'B';
}
a[i][n] = '\0';
}
a[0][1] = 'R';
for(int i = 0;i < n;i++){
cout <<a[i] <<"\n";
}
continue;
}
if(m == 4){
// cout << "Possible\n";
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
a[i][j] = 'B';
}
a[i][n] = '\0';
}
a[0][0] = 'R';
a[n-1][n-1] ='R';
for(int i = 0;i < n;i++){
cout <<a[i] <<"\n";
}
continue;
}
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
a[i][j] = 'B';
}
a[i][n] = '\0';
}
if(n < 4){
int len = 1 << (n * n);
bool f = 0;
for(int i = 0;i < len;i++){
for(int j = 0;j < n * n;j++){
if((i >> j) & 1){
a[j/n][j%n] = 'R';
}
}
if(check(n)){
break;
}
for(int j = 0;j < n * n;j++){
if((i >> j) & 1){
a[j/n][j%n] = 'B';
}
}
}
for(int i = 0;i <n;i++) cout << a[i] << "\n";
continue;
}
if( m >= 4){
m-=4;
a[1][1] = 'R';
}
if(m == 3){
m-=3;
a[0][2] = 'R';
}
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
if(i == 0 && j == 0) j = 3;
if( ((i + j ) & 1 ) == 0 &&m && a[i][j] == 'B'){
int tmp = 4;
if(i == 0 || i == n-1) --tmp;
if(j ==0 ||j == n-1) --tmp;
if(m >= tmp){
m -= tmp;
a[i][j] ='R';
}
}
}
}
if(m == 1){
a[1][1] = 'B';
a[0][0] = 'R';
a[0][2] = 'R';
}
if(m == 2){
a[0][0] = 'R';
}
if(m == 3){
a[0][2] = 'R';
}
if(m == 4){
a[0][0] = 'R';
a[0][n-1] = 'R';
}
if(m == 5){
a[0][0] = 'R';
a[0][2] = 'R';
}
//cout << "Possible\n";
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
cout << a[i][j];
}
cout << "\n";
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3412kb
input:
2 3 6 3 1
output:
Possible BRB RBB BBB Impossible
result:
ok correct! (2 test cases)
Test #2:
score: 0
Accepted
time: 19ms
memory: 3396kb
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 BRB RBR BRB Impossible Possible RBR BRB RBB Possible BRB RBR BBB Possible RBR BRB BBB Possible BBR RRB BBB Possible BRB RBB BBB Possible BBR RBB BBB Possible RBB BBB BBR Possible BRB BBB BBB Possible RBB BBB BBB I...
result:
ok correct! (4424 test cases)
Test #3:
score: 0
Accepted
time: 14ms
memory: 4416kb
input:
1 1000 0
output:
Possible BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...
result:
ok correct! (1 test case)
Test #4:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
1 1000 1
output:
Impossible
result:
ok correct! (1 test case)
Test #5:
score: 0
Accepted
time: 17ms
memory: 4516kb
input:
1 1000 1998000
output:
Possible RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #6:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
1 1000 1997999
output:
Impossible
result:
ok correct! (1 test case)
Test #7:
score: 0
Accepted
time: 16ms
memory: 4356kb
input:
1 1000 1638091
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #8:
score: 0
Accepted
time: 16ms
memory: 4428kb
input:
1 1000 726743
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #9:
score: 0
Accepted
time: 11ms
memory: 4400kb
input:
1 1000 1159802
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #10:
score: 0
Accepted
time: 17ms
memory: 4456kb
input:
1 1000 1824691
output:
Possible RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #11:
score: 0
Accepted
time: 17ms
memory: 4400kb
input:
1 1000 1606348
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (1 test case)
Test #12:
score: 0
Accepted
time: 17ms
memory: 3564kb
input:
100 100 3588 100 16278 100 14222 100 3818 100 16278 100 2672 100 7447 100 5705 100 9385 100 19205 100 16362 100 14175 100 327 100 18201 100 3519 100 14923 100 5358 100 17389 100 8773 100 7611 100 2185 100 3314 100 2358 100 18271 100 9499 100 12584 100 8079 100 16954 100 12620 100 16333 100 7148 100 ...
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (100 test cases)
Test #13:
score: 0
Accepted
time: 16ms
memory: 4068kb
input:
10 280 56983 468 47999 111 964 346 192134 60 3108 348 98521 421 57292 24 310 29 1080 484 17366
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBR...
result:
ok correct! (10 test cases)
Test #14:
score: 0
Accepted
time: 14ms
memory: 3912kb
input:
13 44 3612 468 9437 171 34192 174 33316 121 15295 249 1231 84 9464 170 56598 358 183525 369 42656 29 595 226 74474 296 34671
output:
Possible BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (13 test cases)
Test #15:
score: 0
Accepted
time: 14ms
memory: 3644kb
input:
792 43 1432 33 1687 39 1872 49 906 41 27 49 1140 41 2730 39 1350 33 1625 26 986 26 1079 29 377 50 2930 24 536 28 874 44 1659 36 46 26 1199 46 1289 50 1662 48 59 20 90 37 2025 40 1971 31 443 31 511 36 1940 29 1515 21 104 24 432 23 337 38 2222 36 1016 24 786 23 737 50 1728 45 2032 22 183 50 416 44 375...
output:
Possible RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR BBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB RBRBRBRBRBRBRBRBRBRBRBRBRBR...
result:
ok correct! (792 test cases)