Task: | Kortit II |
Sender: | zli0122 |
Submission time: | 2024-10-28 14:38:28 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
#5 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.03 s | 1, 2, 3, 4, 5 | details |
#2 | WRONG ANSWER | 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:31:11: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses] 31 | if (a == 0 ^ b == 0) { | ~~^~~~
Code
#include <bits/stdc++.h>using namespace std;#define MOD 1000000007vector<vector<long long>> computeBinomialCoefficients(long long n) {vector<vector<long long>> C(n + 1, vector<long long>(n + 1, 0));for (long long i = 0; i <= n; i++) {C[i][0] = C[i][i] = 1; // Base casesfor (long long j = 1; j < i; j++) {C[i][j] = (C[i-1][j-1] + C[i-1][j]) % MOD;}}return C;}vector<long long> computeFactorials(long long n) {vector<long long> F(n+1, 1);for (long long i = 1; i <= n; i++) {F[i] = (i*F[i-1]) % MOD;}return F;}vector<vector<long long>> C = computeBinomialCoefficients(2000);vector<long long> F = computeFactorials(2000);void solve() {long long n, a, b;cin >> n >> a >> b;if (a == 0 ^ b == 0) {return;}if (a + b > n) {return;}long long m = a+b;a = min(a, b);long long coeff = (C[n][m]*C[n][m] % MOD)*F[m] % MOD;//<dumb way>vector<long long> target_perm;vector<long long> permutation;long long solutions = 0;for (long long i = 0; i < m; i++) {target_perm.push_back(i);permutation.push_back(i);}do {b = a;for (long long i = 0; i < m; i++) {if(target_perm[i]==permutation[i]){b = 1;break;}if(target_perm[i]<permutation[i]) b--;}if (b==0)solutions++;} while (next_permutation(permutation.begin(),permutation.end()));// </dumb way>cout << (solutions * coeff % MOD)<< endl;return;}int main() {int n;cin >> n;for (int i = 0; i < n; i++){solve();}}
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
54 4 4 0 3 1 3 3 2 2 4 0 4 ... |
correct output |
---|
0 0 0 0 0 ... |
user output |
---|
1 168 6 96 96 ... |
Test 2
Group: 2, 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
284 6 1 0 5 0 2 7 1 5 7 7 5 ... |
correct output |
---|
0 0 35280 0 36720 ... |
user output |
---|
35280 36720 115920 168 6 ... |
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) |