Kortit I

input/code.cpp: In function 'int main()':
input/code.cpp:130:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |             for (int i = 1; i < p->size(); i += 2)
      |                             ~~^~~~~~~~~~~
input/code.cpp:135:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |             for (int i = 0; i < p->size(); i += 2)
      |                             ~~^~~~~~~~~~~
input/code.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     scanf("%d", &tc);
      |     ~~~~~^~~~~~~~~~~
input/code.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         scanf("%d %d %d",...

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;

class N
{
public:
    N *p;
    vector<N *> *c;
    int v;
    N(N *pv, int vv) : p(pv), v(vv)
    {
        c = new vector<N *>();
    };
};

pi f(int x, int y)
{
    pi p(0, 0);
    if (x == y)
    {
        p.second = 1;
    }
    else if (x > y)
    {
        p.first = -1;
    }
    else
    {
        p.first = 1;
    }
    return p;
}

pi tp;
vector<int> *pop(N *rn, vector<int> ad, vector<int> bd, int d)
{
    int as = ad.size();
    int bs = bd.size();
    if (as == bs)
    {
        if (as == 0)
        {
            vector<int> *ps = new vector<int>;
            ps->reserve(d);
            pi s(0, 0);
            for (int i = 0; i < d; i += 2)
            {
                if (rn)
                {
                    int v = rn->v;
                    int pv = rn->p->v;
                    ps->push_back(v);
                    ps->push_back(pv);
                    pi fx = f(pv, v);
                    s.first += fx.first;
                    s.second += fx.second;
                    rn = rn->p->p;
                }
            }
            if (s == tp)
            {
                return ps;
            }
        }

        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);
            rn->c->push_back(nn);
            vector<int> *fi = pop(nn, an, bd, d + 1);
            if (fi)
                return 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);
            rn->c->push_back(nn);
            vector<int> *fi = pop(nn, ad, bn, d + 1);
            if (fi)
                return fi;
        }
    }
    return ((vector<int> *)NULL);
}

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 = make_pair(-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);
        vector<int> *p = pop(rn, d, d, 0);
        if (p)
        {
            printf("YES\n");
            for (int i = 1; i < p->size(); i += 2)
            {
                printf("%d ", p->at(i));
            }
            printf("\n");
            for (int i = 0; i < p->size(); i += 2)
            {
                printf("%d ", p->at(i));
            }
            printf("\n");
        }
        else
        {
            printf("NO\n");
        }
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED