Kortit II

#include <bits/stdc++.h>

using namespace std;


int main() {
    long long n, t, c, a, b, kortit;
    cin >> t;

    for (long long index = 0LL; index < t; index++) {
        cin >> kortit >> a >> b;
        long long tasat = kortit - a - b;
        vector<long long> v;

        if (tasat < 0LL)cout << 0 << endl; 
        else {
            n = kortit - tasat;
            long long chos = 1LL, fac = 1LL, factasat = 1LL, facminus = 1LL;
            c = 0LL; 
            if ((a != 0LL and b != 0LL) or n == 0LL) {
                for (long long index = 1LL; index <= kortit; index++) {
                    fac *= index;
                    fac %= 1000000007LL;
                }
                for (long long index = 1LL; index <= tasat; index++) {
                    factasat *= index;
                    factasat %= 1000000007LL;
                }
                for (long long index = 1LL; index <= kortit - tasat; index++) {
                    facminus *= index;
                    facminus %= 1000000007LL;
                }
                if (a == 0 and b == 0) c = 1LL;
                else {
                    //c
                    vector<vector<long long>> previous = {{1LL}, {2LL,3LL,2LL}, {1LL}}, now;

                    for (long long index = 4LL; index < n; index++) {
                        now.push_back({1LL});
                        now.push_back({2LL});
                        long long doubles = 4LL;
                        for (long long d = 1LL; d <= index-3LL; d++) {
                            now[1].push_back(doubles);
                            doubles = doubles*2;
                            doubles %= 1000000007LL;
                        }
                        now[1].push_back(doubles - 1LL);
                        //for-loop???
                        //now[1].push_back(accumulate(previous[1].begin(), previous[1].end(), 1LL));
                        long long summa = 1;
                        for (long long summai = 0; summai < (long long) previous[1].size(); summai++) {
                            summa += previous[1][summai];
                            summa %= 1000000007LL;
                        }
                        now[1].push_back(summa);
                        //
                        for (long long i = 1LL; i < (index-1LL)/2LL; i++) {
                            long long uusi = (previous[i].back() - previous[i][0] + now[i].back());
                            if (uusi < 0) uusi += 1000000007LL*(previous[i][0]/1000000007LL + 1);
                            uusi %= 1000000007LL;
                            if (uusi < 0)cout << "error" << endl; 
                            now.push_back({uusi});

                            for (long long a = 0LL; a < index-1LL; a++) {
                                uusi = -previous[i][a] + previous[i+1][a] + now.back().back();
                                if (uusi < 0) {
                                    uusi += 1000000007LL*(previous[i][a]/1000000007LL + 1);
                                }
                                now[i+1].push_back(uusi % 1000000007LL);
                            }
                        }
                        if (index % 2LL == 0LL) {
                            v.clear();
                            for (long long t = index-1LL; t >= 0LL; t--) {
                                v.push_back(now[now.size()-1][t]);
                            }
                            now.push_back(v);
                        }

                        previous = now;
                        now.clear();
                    }
                    for (auto s : previous) {
                        for (auto x : s) {
                            if (x < 0) cout << "error" << endl; 
                        }
                    }

                    for (long long sumi = 0; sumi < (long long) previous[min(a, b)-1].size(); sumi++) {
                        c = (c + previous[min(a, b)-1][sumi]) % 1000000007LL;
                    }
                    //c = accumulate(previous[min(a, b)-1].begin(), previous[min(a, b)-1].end(), 0) % 1000000007LL;
                }

                //cout << c << endl; 
                chos = fac/(factasat*facminus) % 1000000007LL;
                cout << c*chos*fac % 1000000007LL << 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