CSES - Datatähti 2025 alku - Results
Submission details
Task:Kortit II
Sender:Sukarth
Submission time:2024-11-10 15:37:51 +0200
Language:C++ (C++20)
Status:READY
Result:3
Feedback
groupverdictscore
#1ACCEPTED3
#20
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3, 4, 5details
#2--2, 3, 4, 5details
#3--3, 4, 5details
#4--4, 5details
#5--5details
#6--5details

Code

#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <numeric>

using namespace std;

const int MAX_N = 2000;
const int MOD = 1e9 + 7;

long long count_games(int n, int target_a, int target_b)
{
    vector<int> p1(n), p2(n);
    bitset<MAX_N + 1> used1, used2;
    vector<int> p1_wins(n, 0), p2_wins(n, 0);
    long long count = 0;

    function<void(int)> backtrack = [&](int pos)
    {
        if (pos == n)
        {
            if (std::accumulate(p1_wins.begin(), p1_wins.end(), 0) == target_a &&
                std::accumulate(p2_wins.begin(), p2_wins.end(), 0) == target_b)
            {
                count = (count + 1) % MOD;
            }
            return;
        }

        for (int i = 1; i <= n; ++i)
        {
            if (!used1[i])
            {
                p1[pos] = i;
                used1[i] = true;

                for (int j = 1; j <= n; ++j)
                {
                    if (!used2[j])
                    {
                        p2[pos] = j;
                        used2[j] = true;

                        if (i > j)
                            p1_wins[pos] = 1;
                        else if (i < j)
                            p2_wins[pos] = 1;
                        else
                            p1_wins[pos] = p2_wins[pos] = 0;

                        backtrack(pos + 1);

                        used2[j] = false;
                        p1_wins[pos] = p2_wins[pos] = 0;
                    }
                }

                used1[i] = false;
            }
        }
    };

    backtrack(0);
    return count;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
    {
        int n, a, b;
        cin >> n >> a >> b;

        long long result = count_games(n, a, b);
        cout << result << '\n';
    }

    return 0;
}

Test details

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
54
4 4 0
3 1 3
3 2 2
4 0 4
...

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...

Test 2

Group: 2, 3, 4, 5

Verdict:

input
284
6 1 0
5 0 2
7 1 5
7 7 5
...

correct output
0
0
35280
0
36720
...

user output
(empty)

Test 3

Group: 3, 4, 5

Verdict:

input
841
19 3 12
19 19 13
19 7 13
20 11 15
...

correct output
40291066
0
0
0
0
...

user output
(empty)

Test 4

Group: 4, 5

Verdict:

input
1000
15 12 6
7 1 6
44 4 26
6 6 5
...

correct output
0
5040
494558320
0
340694548
...

user output
(empty)

Test 5

Group: 5

Verdict:

input
1000
892 638 599
966 429 655
1353 576 1140
1403 381 910
...

correct output
0
0
0
249098285
0
...

user output
(empty)

Test 6

Group: 5

Verdict:

input
1000
2000 1107 508
2000 1372 249
2000 588 65
2000 1739 78
...

correct output
750840601
678722180
744501884
159164549
868115056
...

user output
(empty)