QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#122611#6644. Red Black Gridinstallb#AC ✓129ms18692kbC++142.7kb2023-07-10 20:16:292023-07-10 20:16:30

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-10 20:16:30]
  • 评测
  • 测评结果:AC
  • 用时:129ms
  • 内存:18692kb
  • [2023-07-10 20:16:29]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int a[2005][2005];
int n,k;

void solve(){
    vector <pair <int,pair <int,int> > > G;
    cin >> n >> k;
    // special judge for N=3
    if(n == 3){
        if(k == 3){
            cout << "Possible\n";
            cout << "BRB\n";
            cout << "BBB\n";
            cout << "BBB\n";
            return;
        }
        if(k == 5){
            cout << "Possible\n";
            cout << "BRB\n";
            cout << "BBB\n";
            cout << "BBR\n";
            return;
        }
        if(k == 7){
            cout << "Possible\n";
            cout << "BRB\n";
            cout << "BBB\n";
            cout << "RBR\n";
            return;
        }
        if(k == 9){
            cout << "Possible\n";
            cout << "BRB\n";
            cout << "RBR\n";
            cout << "BBB\n";
            return;
        }
    }
    for(int i = 1;i <= n;i ++){
        for(int j = (i & 1) ? 1 : 2;j <= n;j += 2){
            if(i == 1 || j == 1 || i == n || j == n){
                if((i == 1 && j == 1) || (i == n && j == n) || (i == 1 && j == n) || (i == n && j == 1)) G.push_back({2,{i,j}});
                else G.push_back({3,{i,j}});
            }
            else G.push_back({4,{i,j}});
        }
    }
    sort(G.begin(),G.end());
    reverse(G.begin(),G.end());
    if(k > n * (n - 1)){
        k = n * (n - 1) * 2 - k;
        for(int i = 1;i <= n;i ++){
            for(int j = 1;j <= n;j ++){
                a[i][j] = 1;
            }
        }
        for(int i = 1;i <= n;i ++){
            for(int j = (i & 1) ? 1 : 2;j <= n;j += 2){
                a[i][j] = 0;
            }
        }
    }
    else{
        for(int i = 1;i <= n;i ++){
            for(int j = 1;j <= n;j ++){
                a[i][j] = 0;
            }
        }
    }
    for(auto [v,p] : G){
        auto [x,y] = p;
        if(k - v == 1 || k - v < 0) continue;
        k -= v; a[x][y] = 1;
    }
    if(k != 0){
        cout << "Impossible\n";
        // assert(0);
        return;
    }
    cout << "Possible\n";
    for(int i = 1;i <= n;i ++){
        for(int j = 1;j <= n;j ++){
            cout << (a[i][j] ? 'R' : 'B');
        }
        cout << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --){
        solve();
    }
    // for(int i = 3;i <= 50;i ++){
    //     for(int j = 0;j <= 2 * i * (i - 1);j ++){
    //         if(j == 1 || j + 1 == 2 * i * (i - 1)) continue;
    //         n = i; k = j;
    //         cout << n << ',' << k << endl; solve();
    //     }
    // }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3404kb

input:

2
3 6
3 1

output:

Possible
BBB
BRB
BBR
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: 0
Accepted
time: 78ms
memory: 3552kb

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
BR
RB
Impossible
Possible
BB
BR
Impossible
Possible
BB
BB
Possible
BRB
RBR
BRB
Impossible
Possible
BRB
RBR
BRR
Possible
BRB
RBR
BBB
Possible
BRB
RRR
BRB
Possible
BRB
BBB
RBR
Possible
BBB
BRB
BBR
Possible
BRB
BBB
BBR
Possible
BBB
BRB
BBB
Possible
BRB
BBB
BBB
Possible
BBB
BBB
BBR
I...

result:

ok correct! (4424 test cases)

Test #3:

score: 0
Accepted
time: 111ms
memory: 18688kb

input:

1
1000 0

output:

Possible
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #4:

score: 0
Accepted
time: 89ms
memory: 17556kb

input:

1
1000 1

output:

Impossible

result:

ok correct! (1 test case)

Test #5:

score: 0
Accepted
time: 121ms
memory: 16944kb

input:

1
1000 1998000

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #6:

score: 0
Accepted
time: 98ms
memory: 17864kb

input:

1
1000 1997999

output:

Impossible

result:

ok correct! (1 test case)

Test #7:

score: 0
Accepted
time: 128ms
memory: 18172kb

input:

1
1000 1638091

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #8:

score: 0
Accepted
time: 124ms
memory: 18692kb

input:

1
1000 726743

output:

Possible
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #9:

score: 0
Accepted
time: 129ms
memory: 18360kb

input:

1
1000 1159802

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #10:

score: 0
Accepted
time: 128ms
memory: 18668kb

input:

1
1000 1824691

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #11:

score: 0
Accepted
time: 117ms
memory: 17116kb

input:

1
1000 1606348

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #12:

score: 0
Accepted
time: 102ms
memory: 3980kb

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
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (100 test cases)

Test #13:

score: 0
Accepted
time: 117ms
memory: 10872kb

input:

10
280 56983
468 47999
111 964
346 192134
60 3108
348 98521
421 57292
24 310
29 1080
484 17366

output:

Possible
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBB...

result:

ok correct! (10 test cases)

Test #14:

score: 0
Accepted
time: 93ms
memory: 10324kb

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
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (13 test cases)

Test #15:

score: 0
Accepted
time: 78ms
memory: 3724kb

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
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (792 test cases)