Kortit II

#include <bits/stdc++.h>

using namespace std;

long n, t, c, at, bt, a, b, kortit;
vector<long> p;

void haku(long k) {
    if (k == n and a == at and b == bt) {
        c++;
        return;
    }
    else if (k != n and at <= a and bt <= b) {
        for (long i = 0; i < n; i++) {
            if (p[i] or i+1 == k+1) continue;

            if (i+1 < k+1)at++;
            else bt++;
            p[i] = 1;

            haku(k+1);
            if (i+1 < k+1) at--;
            else bt--;
            p[i] = 0;
        }
    }
}

int main() {
    cin >> t;

    for (long index = 0; index < t; index++) {
        cin >> kortit >> a >> b;
        long tasat = kortit - a - b;

        if (tasat < 0)cout << 0 << endl; 
        else {
            n = kortit - tasat;
            for (long index = 0; index < n; index++) {
                p.push_back(0);
            }
            //vastaus *= tasat
            long chos = 1, fac = 1, factasat = 1, facminus = 1;
            c = 0, at = 0, bt = 0;
            if ((a != 0 and b != 0) or n == 0) {
                for (long index = 1; index <= kortit; index++) {
                    fac *= index;
                    fac %= 1000000007;
                }
                for (long index = 1; index <= tasat; index++) {
                    factasat *= index;
                    factasat %= 1000000007;
                }
                for (long index = 1; index <= kortit - tasat; index++) {
                    facminus *= index;
                    facminus %= 1000000007;
                }
                haku(0);

                chos = fac/(factasat*facminus) % 1000000007;
                cout << c*chos*fac % 1000000007 << endl; 
            }
            else cout << 0 << endl; 
        }
    }
}

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