Task: | Kortit II |
Sender: | Interaalimato |
Submission time: | 2024-11-07 15:29:14 +0200 |
Language: | C++ (C++11) |
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.02 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 'unsigned int solve(int, int, int)': input/code.cpp:50:25: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses] 50 | if (a + b > n || (a == 0 ^ b == 0)) | ~~^~~~
Code
#include <iostream>#include <set>using namespace std;const unsigned int M = 1000000007;unsigned int nCrize(unsigned int n, unsigned int k, unsigned int opts){for (unsigned int i = k + 1; i <= n; i++){opts = (opts * i) % M;}for (unsigned int i = n - k + 1; i <= n; i++){opts = (opts * i) % M;}return opts;}int options = 0;// a is smaller at start, playing agst bvoid search(int a, int b, int i, set<int> &used){if (a < 0 || b < 0){return;}if (a == 0 && b == 0){options = (options + 1) % M;return;}for (int j = 1; j < i + a + b; j++){if (j == i || used.find(j) != used.end())continue;used.insert(j);search(a - (j > i), b - (j < i), i + 1, used);used.erase(j);}}unsigned int solve(int n, int a, int b){options = 0;int draws = n - a - b;if (a + b > n || (a == 0 ^ b == 0)){return 0;}set<int> used;search(min(a, b), max(a, b), 1, used);// Somenum = combinations where there are a + b cards and a has them in orderreturn nCrize(n, draws, options);}int main(){int t;cin >> t;for (int i = 0; i < t; i++){int n, a, b;cin >> n >> a >> b;cout << solve(n, a, b) << "\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) |