| Task: | Kortit II |
| Sender: | drvilepis |
| Submission time: | 2024-10-28 13:48:24 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 8 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 3 |
| #2 | ACCEPTED | 5 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| #4 | TIME LIMIT EXCEEDED | 0 |
| #5 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5 | details |
| #2 | ACCEPTED | 0.03 s | 2, 3, 4, 5 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3, 4, 5 | details |
| #4 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 5 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 5 | details |
Code
#include <algorithm>
#include <iterator>
#include <vector>
#include <iostream>
const long long MOD = 1000000007;
long long factorial(long long n) {
long long ans = 1;
for (long long i = 1; i <= n; ++i) {
ans = (ans * i) % MOD;
}
return ans;
}
struct game {
long long n;
long long a;
long long b;
};
long long recurse(std::vector<long long>& px, long long n, long long lt, long long gt, long long max) {
long long sum = 0;
std::vector<long long> nums{};
for (long long i = 0; i < max; ++i) {
nums.push_back(i);
}
if (n >= max) {
return 1;
}
if (lt > 0) {
for (long long i = 0; i < n; ++i) {
if (std::find(px.begin(), px.end(), i) == std::end(px)) {
px.push_back(i);
sum += recurse(px, n+1, lt-1, gt, max);
px.pop_back();
} else {
}
}
}
if (gt > 0) {
for (long long i = n+1; i < max; ++i) {
if (std::find(px.begin(), px.end(), i) == std::end(px)) {
px.push_back(i);
sum += recurse(px, n+1, lt, gt-1, max);
px.pop_back();
}
}
}
return sum;
}
int main() {
long long count;
std::cin >> count;
std::vector<game> games{};
for (long long i = 0; i < count; ++i) {
long long n, a, b;
std::cin >> n >> a >> b;
games.push_back(game{ .n = n, .a = a, .b = b });
}
for (auto [n, a, b] : games) {
if (a + b > n || ((a != b) && (a == 0 || b == 0))) {
std::cout << 0 << "\n";
continue;
}
long long total = ((factorial(n) / factorial(n-(a+b))) * (factorial(n) / factorial(a+b))) % MOD;
std::vector<long long> px{};
long long sum = recurse(px, 0, a, b, a+b);
std::cout << (sum * total) % MOD << "\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: 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ... |
| correct output |
|---|
| 750840601 678722180 744501884 159164549 868115056 ... |
| user output |
|---|
| (empty) |
