Kortit I

input/code.cpp:22:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   22 | void print(vector<auto> v) {
      |                   ^~~~
input/code.cpp:27:21: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   27 | void println(vector<auto> v) {
      |                     ^~~~

#include <bits/stdc++.h>

#define F0R(n) for (int i=0; i<n; i++)
#define FOR(from, to) for (int i = from; i < to; i++)
#define R0F(n) for (int i = n; i>=0; --i)
#define ROF(from, to) for (int i = from; i >= to; --i)

#define ll long long
#define mod (int) (1e9 + 7)
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define pii pair<int, int>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;

void print(vector<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
}

void println(vector<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
	cout << "\n";
}

vector<vi> adj(int(1e5+1), vi());
vi vis(int(1e5+1));

pii score(vi& p2) {
    int sca=0, scb=0, n = p2.size();
    F0R (n) {
        if (p2[i]<i+1)
            ++sca;
        else if (p2[i]>i+1)
            ++scb;
    }

    return {sca, scb};
}

void soln() {
    int n, a, b;
    cin >> n >> a >> b;

    if ((a==0 && b!=0) || (a!=0 && b==0)) {
        cout << "NO\n";
        return;
    }

    int new_n = n-a-b;
    if (new_n < 0) {
        cout << "NO\n";
        return;
    }

    vi p1_2(new_n);
    vi p2_2(new_n);
    iota(p1_2.begin(), p1_2.end(), a+b+1);
    iota(p2_2.begin(), p2_2.end(), a+b+1);

    n=a+b;
    set<int> st;
    vi p1(n);
    vi p2(n, 0);
    F0R (n) p1[i]=i+1, p2[i] = i+1;

    auto [sca, scb] = score(p2);
    if ((sca == a) && (scb == b)) {
        cout << "YES\n";
        println(p1_2);
        println(p2_2);
        return;
    }

    int p = 0; ++a;++b;
    while (--a>0 && --b>0) {
        swap(p2[p], p2[n-p-1]);
        ++p;
    }
    while (a-->0) {
        swap(p2[p], p2[n-1]);
        ++p;
    }
    b--;
    while (b-->0) {
        swap(p2[p-1], p2[p]);
        ++p;
    }

    cout << "YES\n";
    print(p1); println(p1_2);
    print(p2); println(p2_2);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc;
    cin >> tc;
    while (tc--) soln();
    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 3

Verdict: ACCEPTED

Test 20

Group: 3

Verdict: ACCEPTED