Kortit II

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
 
using namespace std;
 
#define nl (cout << endl)
 
uint64_t ans(const uint64_t &x) { return pow(10, 9) + 7 % x; }
uint64_t fac(const uint64_t &n) { return tgamma(n + 1); }
 
int comb(const int &n, const int &k) { return fac(n) / (fac(k) * fac(n - k)); }
 
uint64_t count_games(const uint64_t &n, const uint64_t &a, const uint64_t &b) {
	uint64_t c = n - a - b;
	uint64_t count = 0;
	vector<uint64_t> ca(n);
	vector<uint64_t> cb(n);
	for (uint64_t i = 0; i < n; i++) {
		ca[i] = i + 1;
		cb[i] = i + 1;
	}
 
	do {
		uint64_t wa = 0, wb = 0, tie = 0;
 
		for (uint64_t i = 0; i < n; i++) {
			if (ca[i] > cb[i]) {
				wa++;
			} else if (ca[i] < cb[i]) {
				wb++;
			} else {
				tie++;
			}
		}
 
		if (wa == a && wb == b && tie == c) {
			count++;
		}
	} while (next_permutation(cb.begin(), cb.end()));
 
	return count * fac(n);
}
 
int main() {
	const string ys = "YES\r\n", no = "NO";
	uint16_t t;
	struct vals {
		uint16_t n, a, b;
	};
	vector<vals> v;
 
	cin >> t;
	cin.ignore();
 
	for (int i = 0; i < t; i++) {
		string s;
		vals temp;
		uint16_t x, y, z;
 
		getline(cin, s);
 
		istringstream iss(s);
		iss >> x >> y >> z;
		temp.n = +x, temp.a = +y, temp.b = +z;
 
		v.push_back(temp);
	}
 
	for (int i = 0; i < t; i++) {
		uint16_t n = v.at(i).n, a = v.at(i).a, b = v.at(i).b;
		if (a + b > n) {
			cout << 0;
		}
 
		else if (a == n || b == n) {
			cout << 0;
		}
 
		else if (a == 0 && b == 0) {
			cout << fac(n);
		}
 
		else if (a == 0 || b == 0) {
			cout << 0;
		}
 
		else {
			cout << count_games(n, a, b);
		}
		nl;
	}
}

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