QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#127857#6644. Red Black GridParadoxAC ✓21ms11520kbC++204.5kb2023-07-20 10:07:302023-07-20 10:07: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-20 10:07:30]
  • 评测
  • 测评结果:AC
  • 用时:21ms
  • 内存:11520kb
  • [2023-07-20 10:07:30]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define Yes cout<<"YES\n"
#define No  cout<<"NO\n"
#define pb push_back
#define endl '\n'
int n,m,k;
const int N=1e3+10;
int a[N][N],vis[N][N];
int num;
void init(){
    int tmp=1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            a[i][j]=tmp;
            if(tmp) num++;
            tmp^=1;
            if(a[i][j]){
                if(i==1 || i==n){
                    if(j-1 && n-j) vis[i][j]=3;
                }
                else if(j==1 || j==n){
                    if(i-1 && n-i) vis[i][j]=3;
                }
                else vis[i][j]=4;
            }
        }
        if(n&1);
        else tmp^=1;
    }
    vis[1][1]=vis[1][n]=vis[n][1]=vis[n][n]=2;
    // for(int i=1;i<=n;i++){
    //             for(int j=1;j<=n;j++) cout<<(a[i][j]?"R ":"B ");cout<<endl;}
}
bool solve () {
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) vis[i][j]=0;
    cin>>n>>k;
    num=0;
    int tmp=2*(n-1)*n;
    if (k==1 || k==tmp-1){
        cout<<"Impossible\n";
        return 0;
    }
    if(k==0){
        cout<<"Possible\n";
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                cout<<"R";
            }
            cout<<"\n";
        }
        return 0;
    }
    if(n==3){
        cout<<"Possible\n";
        if (k == 0) cout<<"RRR\nRRR\nRRR\n";
        else if (k == 2) cout<<"BRR\nRRR\nRRR\n";
        else if (k == 3) cout<<"RBR\nRRR\nRRR\n";
        else if (k == 4) cout<<"RRR\nRBR\nRRR\n";
        else if (k == 5) cout<<"BRR\nRRB\nRRR\n";
        else if (k == 6) cout<<"RRR\nBRB\nRRR\n";
        else if (k == 7) cout<<"RRR\nBRB\nRBB\n";
        else if (k == 8) cout<<"RBR\nBBB\nRBR\n";
        else if (k == 9) cout<<"RRR\nBRB\nRBR\n";
        else if (k == 10) cout<<"BBR\nBRB\nRBR\n";
        else if (k == 12) cout<<"RBR\nBRB\nRBR\n";
        return 0;
    }
    init();
    if(k==tmp) return 1;
    bool flag=0;
    int x=tmp-k;
    // cout<<tmp<<" "<<x<<endl;
    const int n2=4/((n&1)?1:2);
    int n3;if(n&1){n3=4*((n+1)/2-2);}else{n3=4*(n/2-1);}
    const int n4=num-n2-n3;
    // cout<<n2<<" "<<n3<<" "<<n4<<endl;
    int c4=x/4,c3,c2,c1;
    // cout<<c4<<"__\n";
    if(c4<=n4){
        int t=x%4;
        // cout<<t<<endl;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)
                if(vis[i][j]==4)
                        if(c4){a[i][j]^=1;c4--;}
        }
        if(t==3) a[1][3]^=1;
        else if(t==2) a[1][1]^=1;
        else if(t==1){
            a[1][3]^=1;a[1][1]^=1;
            a[2][2]^=1;
        }
        return 1;
    }
    else{
        c3=(x-n4*4)/3;
        // cout<<c3<<"==\n";
        if(c3<=n3){
            int t=(x-n4*4)%3;
            // cout<<"____"<<t<<endl;
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++)
                    if(vis[i][j]==4) a[i][j]^=1;
                    else{
                        if(vis[i][j]==3){
                            if(c3){a[i][j]^=1;c3--;}
                        }
                    }
            }
            if(t==2) a[1][1]^=1;
            else if(t==1){
                a[n][n]^=1;
                a[1][1]^=1;
                a[1][3]^=1;
            }
        }
        else{
            c2=(x-4*n4-3*n3)/2;
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++)
                if(vis[i][j]>=3) a[i][j]^=1;
                else{
                    if(vis[i][j]==2){
                        if(c2){a[i][j]^=1;c2--;}
                    }
                }
            }

            // for(int i=1;i<=n;i++){
                // for(int j=1;j<=n;j++) cout<<(a[i][j]?"R":"B");cout<<endl;}

            int t=(x-n4*4-n3*3)%2;
            if(t==1){
                if(n&1){
                    a[1][3]^=1;
                    a[n][n]^=1;a[n][1]^=1;
                }
                else{
                    a[1][1]^=1;
                    a[n][n]^=1;
                    a[1][3]^=1;
                }
            }
        }
        return 1;
    }

}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T; while (T--){
        if(solve()){
            cout<<"Possible\n";
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++) cout<<(a[i][j]?"R":"B");cout<<endl;}
        } 
        // else cout<<"Impossible\n";
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
3 6
3 1

output:

Possible
RRR
BRB
RRR
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: 0
Accepted
time: 20ms
memory: 5604kb

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

result:

ok correct! (4424 test cases)

Test #3:

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

input:

1
1000 0

output:

Possible
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...

result:

ok correct! (1 test case)

Test #4:

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

input:

1
1000 1

output:

Impossible

result:

ok correct! (1 test case)

Test #5:

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

input:

1
1000 1998000

output:

Possible
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #6:

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

input:

1
1000 1997999

output:

Impossible

result:

ok correct! (1 test case)

Test #7:

score: 0
Accepted
time: 8ms
memory: 11364kb

input:

1
1000 1638091

output:

Possible
BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #8:

score: 0
Accepted
time: 19ms
memory: 11388kb

input:

1
1000 726743

output:

Possible
BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #9:

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

input:

1
1000 1159802

output:

Possible
BBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #10:

score: 0
Accepted
time: 7ms
memory: 11344kb

input:

1
1000 1824691

output:

Possible
BBBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #11:

score: 0
Accepted
time: 8ms
memory: 11416kb

input:

1
1000 1606348

output:

Possible
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (1 test case)

Test #12:

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

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
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBR
RBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (100 test cases)

Test #13:

score: 0
Accepted
time: 19ms
memory: 10932kb

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
BRBBBBBBBB...

result:

ok correct! (10 test cases)

Test #14:

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

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
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBR
RBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BBBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB
BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR
RBRBRBRBRBRBRBRBRBRBR...

result:

ok correct! (13 test cases)

Test #15:

score: 0
Accepted
time: 21ms
memory: 5780kb

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
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
RBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBR
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
RBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBR
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
RBBBBBBBBBBBBBBBBBBBBBBBBBB...

result:

ok correct! (792 test cases)