Kortit II

#include <bits/stdc++.h>
 
using namespace std;
 
long n, t, c, a, b, kortit;
 
int main() {
    cin >> t;
 
    for (long index = 0; index < t; index++) {
        cin >> kortit >> a >> b;
        long tasat = kortit - a - b;
        vector<int> v;
 
        if (tasat < 0)cout << 0 << endl; 
        else {
            n = kortit - tasat;
            //vastaus *= tasat
            long chos = 1, fac = 1, factasat = 1, facminus = 1;
            c = 0; 
            if ((a != 0 and b != 0) or n == 0) {
                for (long index = 1; index <= kortit; index++) {
                    fac *= index;
                    fac %= 1000000007;
                }
                for (long index = 1; index <= tasat; index++) {
                    factasat *= index;
                    factasat %= 1000000007;
                }
                for (long index = 1; index <= kortit - tasat; index++) {
                    facminus *= index;
                    facminus %= 1000000007;
                }
                if (a == 0 and b == 0) c = 1;
                else {
                    //c
                    vector<vector<int>> previous = {{1}, {2,3,2}, {1}}, now;
 
                    for (int index = 4; index < n; index++) {
                        now.push_back({1});
                        now.push_back({2});
                        int doubles = 4;
                        for (int d = 1; d <= index-3; d++) {
                            now[1].push_back(doubles);
                            doubles = doubles*2;
                        }
                        now[1].push_back(doubles - 1);
                        now[1].push_back(accumulate(previous[1].begin(), previous[1].end(), 1));
 
                        for (int i = 1; i < (index-1)/2; i++) {
                            int uusi = previous[i].back() - previous[i][0] + now[i].back();
                            now.push_back({uusi});
                            for (int a = 0; a < index-1; a++) {
                                now[i+1].push_back(-previous[i][a] + previous[i+1][a] + now.back().back());
                            }
                        }
                        if (index % 2 == 0) {
                            v.clear();
                            for (int t = index-1; t >= 0; t--) {
                                v.push_back(now[now.size()-1][t]);
                            }
                            now.push_back(v);
                        }
 
                        previous = now;
                        now.clear();
                    }
 
                    c = accumulate(previous[min(a, b)-1].begin(), previous[min(a, b)-1].end(), 0);
                }
 
                chos = fac/(factasat*facminus) % 1000000007;
                cout << c*chos*fac % 1000000007 << endl; 
            }
            else cout << 0 << 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: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED