Kortit II

#include <vector>
#include <set>
#include <iostream>
#include <algorithm>

using namespace std;

const int mod = 1e9 + 7;

set<int> kortit;
int result_count = 0;
int ties = 0;
int wins_a = 0;
int wins_b = 0;

int factorial(int n) {
    long long total = 1;
    while (n > 1) {
        total = (total * n) % mod;
        n--;
    }
    return total;
}

int kierros(int round, int n, int a, int b, int t) {
    if (round > n) {
        return (wins_a == a && wins_b == b && ties == t) ? factorial(n) : 0;
    }
    int total_ways = 0;

    vector<int> kortit_copy(kortit.begin(), kortit.end());


    for (int card : kortit_copy) {
        kortit.erase(card);

        if (card > round) {
            wins_a++;
            if (wins_a <= a) {
                total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
            }
            wins_a--;
        } else if (card < round) {
            wins_b++;
            if (wins_b <= b) {
                total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
            }
            wins_b--;
        } else {
            ties++;
            if (ties <= t) {
                total_ways = (total_ways + kierros(round + 1, n, a, b, t)) % mod;
            }
            ties--;
        }
        kortit.insert(card);
    }
    return total_ways;
}


int count_game_results(int n, int a, int b) {
    kortit.clear();
    for (int i = 1; i <= n; i++) {
        kortit.insert(i);
    }
    wins_a = wins_b = ties = 0;
    int t = n - a - b;

    if (t < 0 || a > n || b > n) {
        return 0;
    }

    return kierros(1, n, a, b, t);
}



int main() {
    int test_cases;
    cin >> test_cases;

    vector<int> results(test_cases);
    for (int i = 0; i < test_cases; ++i) {
        int n, a, b;
        cin >> n >> a >> b;
        results[i] = count_game_results(n, a, b);
    }

    for (int result : results) {
        cout << result << endl;
    }

    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