QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#127682#6644. Red Black GridshielderWA 19ms3564kbC++202.8kb2023-07-19 22:09:472023-07-19 22:09:50

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-19 22:09:50]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3564kb
  • [2023-07-19 22:09:47]
  • 提交

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 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;
        }
        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( 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 + 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[n-1][n-1] = 'R';
           a[n-1][n-3] = 'R';
        }
        if(m == 2){
           a[n-1][n-1] = 'R';
        }
        if(m == 3){
           a[n-1][n-3] = 'R';
        }
        if(m == 5){
             a[n-1][n-1] = 'R';
             a[n-1][n-3] = '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: 3564kb

input:

2
3 6
3 1

output:

Possible
RBB
BRB
BBB
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 19ms
memory: 3500kb

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

result:

wrong answer Condition failed: "getNum(vec) == k" (test case 10)