Kortit II

#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 1
                long long result = kortitfactorial * (alapakanpermutaatiotINT+1)*tasapelitilanteet;
                cout << result % modulo << endl;
            }
            else{
                //lasketaan alapakan permutaatiot
                vector<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 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: ACCEPTED

Test 3

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED