Kortit II

#include <bits/stdc++.h>

using namespace std;
const int mod = 1e9 + 7;
const int MAXN = 20;


vector<vector<vector<vector<int>>>> dp;

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

void init_dp(int n, int a, int b) {
    if (dp.empty()) {
        dp.resize(n + 1, 
            vector<vector<vector<int>>>(
                a + 1,
                vector<vector<int>>(
                    b + 1,
                    vector<int>(1 << n, -1)
                )
            )
        );
    }
}

int solve(int n, int a, int b) {
    int t = n - a - b;
    if (t < 0 || a > n || b > n) return 0;
    
    init_dp(n, a, b);
    
    function<int(int, int, int, int)> calc = [&](int cards_used, int wins_a, int wins_b, int mask) -> int {

        if (cards_used == n) {
            int ties = cards_used - wins_a - wins_b;
            return (wins_a == a && wins_b == b && ties == t) ? factorial(n) : 0;
        }
        
        if (dp[cards_used][wins_a][wins_b][mask] != -1) {
            return dp[cards_used][wins_a][wins_b][mask];
        }
        
        int round = cards_used + 1;
        long long total_ways = 0;
        
        for (int card = 0; card < n; card++) {
            if (mask & (1 << card)) continue;  
            
            int new_mask = mask | (1 << card);
            
            if (card + 1 > round) { 
                if (wins_a < a) {
                    total_ways = (total_ways + calc(cards_used + 1, wins_a + 1, wins_b, new_mask)) % mod;
                }
            } 
            else if (card + 1 < round) { 
                if (wins_b < b) {
                    total_ways = (total_ways + calc(cards_used + 1, wins_a, wins_b + 1, new_mask)) % mod;
                }
            } 
            else { 
                if (cards_used - wins_a - wins_b < t) {
                    total_ways = (total_ways + calc(cards_used + 1, wins_a, wins_b, new_mask)) % mod;
                }
            }
        }
        
        return dp[cards_used][wins_a][wins_b][mask] = total_ways;
    };
    
    return calc(0, 0, 0, 0);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    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] = solve(n, a, b);
    }
    
    for (int result : results) {
        cout << result << "\n";
    }
    
    return 0;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 4, 5

Verdict: RUNTIME ERROR

Test 4

Group: 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 5

Verdict: RUNTIME ERROR

Test 6

Group: 5

Verdict: RUNTIME ERROR