Kortit II

input/code.cpp: In function 'int main()':
input/code.cpp:89:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     scanf("%d", &tc);
      |     ~~~~~^~~~~~~~~~~
input/code.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d %d %d", &n, &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
typedef array<int, 3> ti;
 
class N
{
public:
    N *p;
    int v;
    N(N *pv, int vv) : p(pv), v(vv) {};
};
 
ti f(int x, int y)
{
    ti p = {0, 0, 0};
    if (x == y)
    {
        p[2] = 1;
    }
    else if (x > y)
    {
        p[0] = 1;
    }
    else
    {
        p[1] = 1;
    }
    return p;
}
 
ti tp;
long long int pop(N *rn, vector<int> ad, vector<int> bd, ti gt)
{
    int c = 0;
    int as = ad.size();
    int bs = bd.size();
    if (as == bs)
    {
        if (rn && rn->p)
        {
            ti ts = f(rn->p->v, rn->v);
            gt[0] += ts[0];
            gt[1] += ts[1];
            gt[2] += ts[2];
            if (gt[0] > tp[0] || gt[1] > tp[1] || gt[2] > tp[2])
            {
                return 0;
            }
        }
        if (as == 0)
        {
            if (gt == tp)
            {
                return c+1;
            }
        }
 
        for (int i = 0; i < as; i++)
        {
            vector<int> an = ad;
            int v = an[i];
            an.erase(an.begin() + i);
            N *nn = new N(rn, v);
            int fi = pop(nn, an, bd, gt);
            c+=fi;
        }
    }
    else
    {
        for (int i = 0; i < bs; i++)
        {
            vector<int> bn = bd;
            int v = bn[i];
            bn.erase(bn.begin() + i);
            N *nn = new N(rn, v);
            int fi = pop(nn, ad, bn, gt);
            c+=fi;
        }
    }
    return c;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int tc;
    scanf("%d", &tc);
    array<int, 3> cl[tc];
    for (int i = 0; i < tc; i++)
    {
        int n, a, b;
        scanf("%d %d %d", &n, &a, &b);
        cl[i] = {n, a, b};
    }
 
    for (int x = 0; x < tc; x++)
    {
        array<int, 3> s = cl[x];
        int n = s[0];
        int a = s[1];
        int b = s[2];
        tp = {a, b, n - a - b};
 
        vector<int> d;
        d.reserve(n);
        for (int i = 1; i <= n; i++)
        {
            d.push_back(i);
        }
        N *rn = new N((N *)NULL, 0);
        long long int p = pop(rn, d, d, {0, 0, 0});
        p %= 1000000007;
        printf("%lld\n", p);
    }
}

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