QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#180847#6644. Red Black GridUrgantTeam#WA 17ms3472kbC++232.2kb2023-09-16 13:40:192023-09-16 13:40:21

Judging History

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

  • [2023-09-16 13:40:21]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:3472kb
  • [2023-09-16 13:40:19]
  • 提交

answer

#include <iostream>
#include <vector>
#include <cmath>
#include <tuple>
#include <set>

using namespace std;
using vb = vector<bool>;
using vvb = vector<vb>;

vvb find_ans(const int n, const int k) {
    if (n == 3)
        if (k == 5)
            return {{1, 0, 0},
                    {0, 0, 1},
                    {0, 0, 0}};
        else if (k == 7)
            return {{1, 0, 0},
                    {0, 0, 1},
                    {1, 0, 0}};
    if (k < 0 || k == 1 || k == n * (n - 1) * 2 - 1 || k > n * (n - 1) * 2)
        return {};
    for (int o = 0; o < 2; ++o) {
        vvb ans(n, vb(n));
        int K = k;
        for (int i = 1; (K >= 4 && K != 5) && i < n - 1; ++i)
            for (int j = 1; (K >= 4 && K != 5) && j < n - 1; ++j)
                if ((i + j) % 2 == o) {
                        K -= 4;
                        ans[i][j] = true;
                    }
        for (int i = 0; (K >= 3 && K != 4) && i < n; ++i) {
            int dob = (i == 0 || i == n - 1) ? 1 : n - 1;
            for (int j = 0; (K >= 3 && K != 4) && j < n; j += dob)
                if ((i + j) % 2 == o)
                    if (!((i == 0 || i == n - 1) && (j == 0 || j == n - 1))) {
                        K -= 3;
                        ans[i][j] = true;
                    }
        }
        for (int i = 0; (K >= 2) && i < n; i += n - 1)
            for (int j = 0; (K >= 2) && j < n; j += n - 1)
                if ((i + j) % 2 == o) {
                    K -= 2;
                    ans[i][j] = true;
                }
        if (K == 0) return ans;
    }
    return {};
}

void solve_test() {
    int n, k;
    cin >> n >> k;
    vvb ans = find_ans(n, k);
    if (ans.size()) {
        cout << "Possible\n";
        for (const vb &a: ans) {
            for (bool b: a)
                cout << (b ? 'R' : 'B');
            cout << '\n';
        }
    } else
        cout << "Impossible\n";
}

void solve_tests() {
    int t;
    cin >> t;
    for (int i = 0; i < t; ++i)
        solve_test();
}

int main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve_tests();
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3472kb

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: 17ms
memory: 3452kb

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

result:

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