Task: | Kortit II |
Sender: | paju |
Submission time: | 2024-11-08 00:19:38 +0200 |
Language: | C++ (C++17) |
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 |
Code
#include <iostream>#include <string>#include <list>#include <vector>#include <algorithm>#include <numeric>using namespace std;int factorial(int n){int out = 1;for (int i = 1; i < n+1; i++){out *= i;}return out;}int ncr(int a, int b){return factorial(a)/(factorial(a-b)*factorial(b));}int main(){int modulo = 1000000007;int gameamout;cin >> gameamout;list<vector<int>> allgamedata;int kortit = 0;int pisteetA = 0;int pisteetB = 0;vector<int> tokenit;for (int i = 0; i < gameamout; i++){int a, b, c;cin >> a >> b >> c;vector<int> input;input.push_back(a);input.push_back(b);input.push_back(c);allgamedata.push_back(input);}for (int i = 0; i < gameamout; i++){tokenit = allgamedata.front();pisteetB = tokenit[2];pisteetA = tokenit[1];kortit = tokenit[0];int totalp = pisteetA + pisteetB;int kortitfactorial = factorial(kortit);if (totalp > kortit){cout << 0 << endl;}else if ((pisteetA == 0 || pisteetB == 0) && (pisteetA > 0 || pisteetB > 0)){cout << 0 << endl;}else if (pisteetA == 0 && pisteetB == 0){cout << factorial(kortit) << endl;}else{long long alapakanpermutaatiotINT = 0;long long tasapelitilanteet = ncr(kortit, kortit-totalp);if(pisteetA == 1 || pisteetB == 1){//permutaatioita vain 1long long result = kortitfactorial * (alapakanpermutaatiotINT+1)*tasapelitilanteet;cout << result % modulo << endl;}else{//lasketaan alapakan permutaatiotvector<int> alapakkapermutaatiot(kortit);iota(alapakkapermutaatiot.begin(), alapakkapermutaatiot.end(),1);do{int a = 0;int b = 0;for (int i = 0; i < kortit; i++){if(alapakkapermutaatiot[i] > i+1){b++;}else if(alapakkapermutaatiot[i] < i+1){a++;}}if(a == pisteetA && b == pisteetB){//cout << alapakkapermutaatiot[0] << " " << alapakkapermutaatiot[1] << " " << alapakkapermutaatiot[2] << " " << alapakkapermutaatiot[3] << " " << endl;alapakanpermutaatiotINT++;}}while(next_permutation(alapakkapermutaatiot.begin(),alapakkapermutaatiot.end()));long long result = kortitfactorial * alapakanpermutaatiotINT;//cout << result << " "<<modulo << endl;cout << result % modulo << endl;}}allgamedata.pop_front();}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) |