Kortit II

input/code.cpp: In function 'void check()':
input/code.cpp:22:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (long long i = 0; i < A.size(); i++) {
      |                           ~~^~~~~~~~~~
input/code.cpp: In function 'void genB()':
input/code.cpp:36:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (long long i = 0; i < A.size(); i++) {
      |                           ~~^~~~~~~~~~

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

using namespace std;

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

long long fact(long long x) {
    if (x == 0) {
        return 1;
    }
    return x * fact(x - 1);
}

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

void genB() {
    B.clear();
    for (long long i = 0; i < A.size(); i++) {
        B.push_back(A[i]);
    }
    check();
    while (next_permutation(B.begin(), B.end())) {
        check();
    }
}

void genA() {
    for (long long x = 0; x < (1 << (n + 1)); x++) {
        A.clear();
        if (__builtin_popcount(x) != a + b) {
            continue;
        }
        for (long long k = 1; k <= n; k++) {
            if (x & (1 << k)) {
                A.push_back(k);
            }
        }
        genB();
    }
}

void solve() {
    genA();
}

/*long long ansOld = 0;
vector<long long> AOld;
vector<long long> BOld;

void checkOld() {
    int aNowOld = 0;
    int bNowOld = 0;
    for (int i = 0; i < n; i++) {
        if (AOld[i] > BOld[i]) {
            aNowOld++;
        } else if (BOld[i] > AOld[i]) {
            bNowOld++;
        }
    }
    if (aNowOld == a && bNowOld == b) {
        ansOld++;
    }
}

void genBOld() {
    for (int i = 1; i <= n; i++) {
        BOld[i - 1] = i;
    }
    checkOld();
    while (next_permutation(BOld.begin(), BOld.end())) {
        checkOld();
    }
}

void genAOld() {
    for (int i = 1; i <= n; i++) {
        AOld[i - 1] = i;
    }
    genBOld();
    while (next_permutation(AOld.begin(), AOld.end())) {
        genBOld();
    }
}

void solveOld() {
    AOld.resize(n);
    BOld.resize(n);
    genAOld();
} */

int main() {
    long long T;
    cin >> T;
    for (long long t = 0; t < T; t++) {
        ans = 0;
        //ansOld = 0;
        cin >> n >> a >> b;
        if (n < a + b) {
            cout << 0 << '\n';
            continue;
        }
        solve();
        //solveOld();
        cout << (ans * fact(n)) % 1000000007 << '\n';
        //cout << ansOld << '\n';
    }
}

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: WRONG ANSWER