Kortit II

#include <bits/stdc++.h>
#define ln "\n"
using namespace std;
using ll = long long;
int MOD = 1e9+7;
ll getMul(ll a,ll b) {
    ll n = a+b;
    ll limit = (1LL<<n), maxState = (a+1) * (b+1);
    
    vector<vector<ll>> dp(limit,vector<ll>(maxState,0));
    dp[0][0] = 1;
 
    for (int mask = 0; mask < limit; mask++) {
        int winCount = __builtin_popcount(mask);  
 
        for (int i = 0; i < n; i++) {
            if (mask & (1 << i)) continue; 
            int num = i + 1;
            for (int state = 0; state < maxState; state++) {
                if (dp[mask][state] == 0) continue;
                ll w = state / (b+1);
                ll l = state % (b+1);
                if (num > winCount + 1 && w + 1 <= a) {
                    ll newState = (w+1)*(b+1) +l;
                    dp[mask | (1 << i)][newState] += (dp[mask][state]) % MOD;
                    dp[mask | (1 << i)][newState] %= MOD;
                } else if (num < winCount + 1 && l + 1 <= b) {
                    ll newState = w*(b+1) +(l+1);
                    dp[mask | (1 << i)][newState] += (dp[mask][state]) % MOD;
                    dp[mask | (1 << i)][newState] %= MOD;
                }
            }
        }
    }
    ll totalWays = 0;
    int target = a*(b+1)+b;
    for (int mask = 0; mask < limit; mask++) {
        totalWays = (totalWays+dp[mask][target]) % MOD;
    }
    return totalWays;
}
int main() {
    int t;
    cin >> t;
    while(t--) {
        int n,a,b;
        cin >> n >> a >> b;
        if((a == 0 && b != 0) || (a != 0 && b == 0) || (a+b > n)) {
            cout << 0 << ln;
        } else {
            ll variations = getMul(a,b);
            ll c = a+b;
            ll finalMul = 1;
            for(ll i = 1; i <= c; i++) {
                finalMul = (finalMul * i) % MOD;
            }
            ll diver = 1;
            ll j = 1;
            for(ll i = c+1; i <= n; i++) {
               finalMul = (finalMul * i) % MOD;
               finalMul = (finalMul * i) % MOD;
               diver = (diver * j) % MOD;
               j++;
            }
            finalMul = (finalMul*variations) % MOD;
            finalMul /= diver;
            cout << finalMul << ln;
        }
        
    }
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Test 5

Group: 5

Verdict: RUNTIME ERROR

Test 6

Group: 5

Verdict: RUNTIME ERROR