QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#135568#6644. Red Black Gridwint_x19WA 15ms3476kbC++232.6kb2023-08-05 18:21:572023-08-05 18:21:58

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:21:58]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:3476kb
  • [2023-08-05 18:21:57]
  • 提交

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[110][110];

void run() {
    cin >> n >> k;
    sum2 = (n % 2 ? 4 : 2), sum3 = (n - 1) / 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;
                for (int i = 1; i <= n; i++) {
                    for (int j = 1; j <= n; j++) {
                        if ((i + j) % 2 == 0) {
                            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 (_3 && 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();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 15ms
memory: 3432kb

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

result:

wrong answer Condition failed: "A == B" (test case 8)