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

Code

#include <vector>
#include <set>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1e9 + 7;
set<int> kortit;
int result_count = 0;
int ties = 0;
int wins_a = 0;
int wins_b = 0;
int factorial(int n) {
long long total = 1;
while (n > 1) {
total = (total * n) % mod;
n--;
}
return total;
}
int kierros(int round, int n, int a, int b, int t) {
if (round > n) {
return (wins_a == a && wins_b == b && ties == t) ? factorial(n) : 0;
}
int total_ways = 0;
vector<int> kortit_copy(kortit.begin(), kortit.end());
for (int card : kortit_copy) {
kortit.erase(card);
if (card > round) {
wins_a++;
if (wins_a <= a) {
total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
}
wins_a--;
} else if (card < round) {
wins_b++;
if (wins_b <= b) {
total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
}
wins_b--;
} else {
ties++;
if (ties <= t) {
total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
}
ties--;
}
kortit.insert(card);
}
return total_ways;
}
int count_game_results(int n, int a, int b) {
kortit.clear();
for (int i = 1; i <= n; i++) {
kortit.insert(i);
}
wins_a = wins_b = ties = 0;
int t = n - a - b;
if (t < 0 || a > n || b > n) {
return 0;
}
return kierros(1, n, a, b, t);
}
int main() {
int test_cases;
cin >> test_cases;
vector<int> results(test_cases);
for (int i = 0; i < test_cases; ++i) {
int n, a, b;
cin >> n >> a >> b;
results[i] = count_game_results(n, a, b);
}
for (int result : results) {
cout << result << endl;
}
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: ACCEPTED

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

correct output
0
0
35280
0
36720
...

user output
0
0
35280
0
36720
...

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)