QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#432211#6644. Red Black Griducup-team3215AC ✓5ms4232kbC++20683b2024-06-06 22:21:472024-06-06 22:21:47

Judging History

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

  • [2024-06-06 22:21:47]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:4232kb
  • [2024-06-06 22:21:47]
  • 提交

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; i < n; ++i)
    for (int j = i % 2; j < n; j += 2) if (i || j || n == 3) {
      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 == 2) s[0] = 'B', k = 0;
    else if (n == k && s[4] == 'R') s[4] = s[6], s[7] = 'B', k = 0;
    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: 1ms
memory: 3544kb

input:

2
3 6
3 1

output:

Possible
BRB
RRR
BRR
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: 0
Accepted
time: 5ms
memory: 3824kb

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

result:

ok correct! (4424 test cases)

Test #3:

score: 0
Accepted
time: 2ms
memory: 4108kb

input:

1
1000 0

output:

Possible
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

result:

ok correct! (1 test case)

Test #4:

score: 0
Accepted
time: 0ms
memory: 4144kb

input:

1
1000 1

output:

Impossible

result:

ok correct! (1 test case)

Test #5:

score: 0
Accepted
time: 0ms
memory: 4128kb

input:

1
1000 1998000

output:

Possible
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #6:

score: 0
Accepted
time: 2ms
memory: 4228kb

input:

1
1000 1997999

output:

Impossible

result:

ok correct! (1 test case)

Test #7:

score: 0
Accepted
time: 0ms
memory: 4176kb

input:

1
1000 1638091

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #8:

score: 0
Accepted
time: 2ms
memory: 4232kb

input:

1
1000 726743

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #9:

score: 0
Accepted
time: 0ms
memory: 4164kb

input:

1
1000 1159802

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #10:

score: 0
Accepted
time: 2ms
memory: 4192kb

input:

1
1000 1824691

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #11:

score: 0
Accepted
time: 2ms
memory: 4112kb

input:

1
1000 1606348

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (1 test case)

Test #12:

score: 0
Accepted
time: 2ms
memory: 3608kb

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
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (100 test cases)

Test #13:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

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

output:

Possible
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRB...

result:

ok correct! (10 test cases)

Test #14:

score: 0
Accepted
time: 0ms
memory: 3836kb

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

result:

ok correct! (13 test cases)

Test #15:

score: 0
Accepted
time: 3ms
memory: 3876kb

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
RRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
BRBRBRBRBRBRBRBRBRBRBRBRBRB...

result:

ok correct! (792 test cases)