Kortit II

#include <bits/stdc++.h>
 
using namespace std;

#define m 1000000007
 
int main()
{
    int n {};
    cin >> n;
 
    vector<int> answers {};
    answers.reserve(n);
 
    for(int i {}; i < n; ++i)
    {
        int count {}, t1 {}, t2 {};
        cin >> count >> t1 >> t2;

        int mult {1};
        for(int j {2}; j <= count; ++j)
            mult = (mult * j) % m;

        int result {};

        vector<int> nums {};
        nums.reserve(count);
        for(int i {}; i < count; ++i)
        {
            nums.push_back(i);
        }

        do
        {
            int w1 {}, w2 {};
            for(int i {}; i < count; ++i)
            {
                if(nums[i] > i)
                {
                    ++w1;
                    if(w1 > t1) break;
                } 
                else if(nums[i] < i)
                {
                    ++w2;
                    if(w2 > t2) break;
                }
            }
            if(w1 == t1 && w2 == t2) result += mult;
        } 
        while (next_permutation(nums.begin(), nums.end()));
        

        answers.push_back(result);
    }
 
    for(int i {}; i < n; ++i)
    {
        cout << answers[i] << '\n';
    }
 
    return 0;
}

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