| Task: | Kortit II |
| Sender: | Mariia |
| Submission time: | 2024-11-10 17:48:31 +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.04 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 |
Compiler report
input/code.cpp: In function 'void solve()':
input/code.cpp:27:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
27 | for (long long i = 0; i < B.size(); i++) {
| ~~^~~~~~~~~~Code
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long ans = 0;
long long n, a, b;
vector<long long> A;
vector<long long> B;
vector<bool> used;
long long fact(long long x) {
if (x == 0) {
return 1;
}
return x * fact(x - 1);
}
long long C(long long n, long long k) {
return fact(n) / fact(k) / fact(n - k);
}
void solve() {
int cntA = 0;
int cntB = 0;
for (long long i = 0; i < B.size(); i++) {
if (A[i] > B[i]) {
cntA++;
} else if (B[i] > A[i]) {
cntB++;
}
}
if (cntA > a || cntB > b) {
return;
}
if (B.size() == A.size()) {
if (cntA == a && cntB == b) {
ans++;
}
return;
}
for (long long i = 1; i <= a + b; i++) {
if (!used[i]) {
B.push_back(i);
used[i] = true;
solve();
used[i] = false;
B.pop_back();
}
}
}
int main() {
long long T;
cin >> T;
for (long long t = 0; t < T; t++) {
ans = 0;
cin >> n >> a >> b;
if (n < a + b) {
cout << 0 << '\n';
continue;
}
B.clear();
A.resize(a + b);
for (long long i = 1; i <= a + b; i++) {
A[i - 1] = i;
}
used.resize(a + b + 1, false);
solve();
ans *= fact(n);
ans %= 1000000007;
ans *= C(n, n - a - b);
ans %= 1000000007;
cout << ans << '\n';
}
}
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) |
