Kortit II

#include <bits/stdc++.h>

using namespace std;

int main() {
	int t;
    cin >> t;
    vector<vector<int>> tests;
    for (int i = 0; i < t; i++) {
        int n, a, b;
        cin >> n >> a >> b;
        tests.push_back({n, a, b});
    }
    for (auto test : tests) {
        int n = test[0];
        int a = test[1];
        int b = test[2];

        vector<int> p1(n), p2(n);

        for (int i = 1; i<=n; i++) {
        	p1[i-1] = i;
        	p2[i-1] = i;
        }
        int count = 0;
        do {
        	do {
        		int p1w = 0;
        		int p2w = 0;
        		int tie = 0;
        		for (int i = 0; i < n; i++) {
        			p1w += p1[i] > p2[i] ? 1 : 0;
        			p2w += p1[i] < p2[i] ? 1 : 0;
        			tie += p1[i] == p2[i] ? 1 : 0;
        		}
        		if (p1w == a && p2w == b && tie == (n-a-b)) {
        			count++;
        		}
        	} while (next_permutation(p2.begin(), p2.end()));
        } while (next_permutation(p1.begin(), p1.end()));
		cout << count << "\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