Kortit II

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

int main(void) {
	int t;
	std::cin >> t;
	for (int _i = 0; _i < t; _i++) {
		int n, a, b;
		std::cin >> n >> a >> b;
		int ties = n - a - b;
		if (a+b > n || n - ties == 1) {
			std::cout << 0 << std::endl;
			continue;
		}
		long long count = 0;
		std::vector<int> v;
		for (int i = 0; i < n; i++) {
			v.push_back(i);
		}
		do {
			int s_a = 0, s_b = 0, s_t = 0;
			for (int i = 0; i < n; i++) {
				// a = i
				if (i == v[i]) {
					s_t++;
				} else if (i > v[i]) {
					s_a++;
				} else {
					s_b++;
				}
			}
			if (s_a != a || s_b != b || s_t != ties) continue;
			count++;
		} while (std::next_permutation(v.begin(), v.end()));
		for (long long i = 1; i <= n; i++) {
			count *= i;
			count = count % 1000000007LL;
		}
		std::cout << count % 1000000007LL << std::endl;
	}
}

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