QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#135587#6644. Red Black Gridwint_x19AC ✓18ms4620kbC++233.9kb2023-08-05 18:43:062023-08-05 18:43:07

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 18:43:07]
  • 评测
  • 测评结果:AC
  • 用时:18ms
  • 内存:4620kb
  • [2023-08-05 18:43:06]
  • 提交

answer

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);
#define off cin.tie(0), cout.tie(0);
#define all(x) x.begin(),x.end()
#define inf 0x3f3f3f3f3f3f3f3f
#define MAXN 1000007
#define int long long

using namespace std;

const int mod = 1e9 + 7;
const double eps = 1e-7;

int t = 1, n, m, x, k;
int sum2, sum3, sum4, cnt2, cnt3, cnt4;

char g[1010][1010];

void run() {
    cin >> n >> k;
    if (n == 3) {
        if (k == 1 || k == 11) {
            cout << "Impossible\n";
            return ;
        }
        cout << "Possible\n";
        for (int i = 1; i <= 3; i++) for (int j = 1; j <= 3; j++) g[i][j] = 'B';
        if (k == 2) {
            g[1][1] = 'R';
        } else if (k == 3) {
            g[1][2] = 'R';
        } else if (k == 4) {
            g[2][2] = 'R';
        } else if (k == 5) {
            g[1][1] = 'R';
            g[3][2] = 'R';
        } else if (k == 6) {
            g[1][2] = 'R';
            g[3][2] = 'R';
        } else if (k == 7) {
            g[1][1] = g[1][3] = g[3][2] = 'R';
        } else if (k == 8) {
            g[1][2] = g[2][1] = g[3][3] = 'R';
        } else if (k == 9) {
            g[1][2] = g[2][1] = g[3][2] = 'R';
        } else if (k == 10) {
            g[1][1] = g[1][3] = g[3][1] = g[2][2] = 'R';
        } else if (k == 12) {
            g[1][1] = g[1][3] = g[3][1] = g[3][3] = g[2][2] = 'R';
        }
        for (int i = 1; i <= 3; i++) {
            for (int j = 1; j <= 3; j++) {
                cout << g[i][j];
            }
            cout << '\n';
        }
        return ;
    }
    sum2 = (n % 2 ? 4 : 2), sum3 = (n - 2) / 2 * 4, sum4 = ((n - 2) * (n - 2) + 1) / 2;
    // cout << sum2 << ' ' << sum3 << ' ' << sum4 << '\n';
    int flag = 0;
    for (int cnt3 = 0; cnt3 <= sum3; cnt3++) {
        for (int cnt2 = 0; cnt2 <= sum2; cnt2++) {
            if ((k - 2 * cnt2 - 3 * cnt3) % 4 == 0 && (k - 2 * cnt2 - 3 * cnt3) / 4 >= 0 && (k - 2 * cnt2 - 3 * cnt3) / 4 <= sum4) {
                int cnt4 = (k - 2 * cnt2 - 3 * cnt3) / 4;
                flag = 1;
                cout << "Possible\n";
                int _2 = cnt2, _3 = cnt3, _4 = cnt4;
                // cerr << _2 << ' ' << _3 << ' ' << _4 << '\n';
                for (int i = 1; i <= n; i++) {
                    for (int j = 1; j <= n; j++) {
                        if ((i + j) % 2 == 0) {
                            // cerr << _2 << ' ' << _3 << ' ' << _4 << '\n';
                            if ((i == 1 && j == 1) || (i == 1 && j == n) || (i == n && j == 1) || (i == n && j == n)) {
                                if (_2) {
                                    _2--;
                                    g[i][j] = 'R';
                                } else g[i][j] = 'B';
                            } 
                            else if (i == 1 || i == n || j == 1 || j == n) {
                                if (_3) {
                                    _3--;
                                    g[i][j] = 'R';
                                } else g[i][j] = 'B';
                            } else {
                                if (_4) {
                                    _4--;
                                    g[i][j] = 'R';
                                } else g[i][j] = 'B';
                            }
                        } else {
                            g[i][j] = 'B';
                        }
                    }
                }
                for (int i = 1; i <= n; i++) {
                    for (int j = 1; j <= n; j++) {
                        cout << g[i][j];
                    }
                    cout << '\n'; 
                }
            }
            if (flag) break;
        }
        if (flag) break;
    }
    if (flag == 0) {
        cout << "Impossible\n";
    }
}

signed main () {
    io off
    cin >> t;
    while (t--) {
        run();
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3464kb

input:

2
3 6
3 1

output:

Possible
BRB
BBB
BRB
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: 0
Accepted
time: 14ms
memory: 3448kb

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
RBB
BRB
Possible
BRB
RBB
BBR
Possible
RBR
BBB
BRB
Possible
BRB
BBB
BRB
Possible
RBB
BBB
BRB
Possible
BBB
BRB
BBB
Possible
BRB
BBB
BBB
Possible
RBB
BBB
BBB
I...

result:

ok correct! (4424 test cases)

Test #3:

score: 0
Accepted
time: 12ms
memory: 4572kb

input:

1
1000 0

output:

Possible
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #4:

score: 0
Accepted
time: 1ms
memory: 3600kb

input:

1
1000 1

output:

Impossible

result:

ok correct! (1 test case)

Test #5:

score: 0
Accepted
time: 17ms
memory: 4416kb

input:

1
1000 1998000

output:

Possible
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #6:

score: 0
Accepted
time: 1ms
memory: 3644kb

input:

1
1000 1997999

output:

Impossible

result:

ok correct! (1 test case)

Test #7:

score: 0
Accepted
time: 17ms
memory: 4468kb

input:

1
1000 1638091

output:

Possible
BBRBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #8:

score: 0
Accepted
time: 18ms
memory: 4464kb

input:

1
1000 726743

output:

Possible
BBRBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #9:

score: 0
Accepted
time: 10ms
memory: 4452kb

input:

1
1000 1159802

output:

Possible
RBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #10:

score: 0
Accepted
time: 11ms
memory: 4464kb

input:

1
1000 1824691

output:

Possible
BBRBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #11:

score: 0
Accepted
time: 9ms
memory: 4620kb

input:

1
1000 1606348

output:

Possible
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (1 test case)

Test #12:

score: 0
Accepted
time: 15ms
memory: 3532kb

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
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBB
BBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (100 test cases)

Test #13:

score: 0
Accepted
time: 11ms
memory: 4124kb

input:

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

output:

Possible
BBRBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BRBRBRBRBR...

result:

ok correct! (10 test cases)

Test #14:

score: 0
Accepted
time: 13ms
memory: 3844kb

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
BBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (13 test cases)

Test #15:

score: 0
Accepted
time: 12ms
memory: 3436kb

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
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (792 test cases)