Kortit II

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

using namespace std;

int ans = 0;
int n, a, b;
vector<int> A;
vector<int> B;

void check() {
    int aNow = 0;
    int bNow = 0;
    for (int i = 0; i < n; i++) {
        if (A[i] > B[i]) {
            aNow++;
        } else if (B[i] > A[i]) {
            bNow++;
        }
    }
    if (aNow == a && bNow == b) {
        ans++;
    }
}

void genB() {
    for (int i = 1; i <= n; i++) {
        B[i - 1] = i;
    }
    check();
    while (next_permutation(B.begin(), B.end())) {
        check();
    }
}

void genA() {
    for (int i = 1; i <= n; i++) {
        A[i - 1] = i;
    }
    genB();
    while (next_permutation(A.begin(), A.end())) {
        genB();
    }
}

void solve() {
    A.resize(n);
    B.resize(n);
    genA();
}

int main() {
    int T;
    cin >> T;
    for (int t = 0; t < T; t++) {
        ans = 0;
        cin >> n >> a >> b;
        if (n < a + b) {
            cout << 0 << '\n';
            continue;
        }
        solve();
        cout << ans << '\n';
    }
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

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