Kortit I

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

bool solve(int n, int a, int b, vector<int>& p1, vector<int>& p2) {
    if (a + b > n) return false;

    vector<bool> used1(n + 1, false), used2(n + 1, false);
    vector<int> cards1, cards2;

    function<bool(int, int, int)> backtrack = [&](int a_score, int b_score, int k) {
        if (k == n) return a_score == a && b_score == b;
        if (a_score > a || b_score > b) return false; 

        for (int i = n; i >= 1; --i) { 
            if (!used1[i]) {
                for (int j = n; j >= 1; --j) { 
                    if (!used2[j]) {
                        used1[i] = used2[j] = true;
                        cards1.push_back(i);
                        cards2.push_back(j);
                        int next_a = a_score, next_b = b_score;
                        if (i > j) next_a++;
                        else if (j > i) next_b++;
                        if (backtrack(next_a, next_b, k + 1)) return true;
                        used1[i] = used2[j] = false;
                        cards1.pop_back();
                        cards2.pop_back();
                    }
                }
            }
        }
        return false;
    };

    if (backtrack(0, 0, 0)) {
        p1 = cards1;
        p2 = cards2;
        return true;
    }
    return false;
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, a, b;
        cin >> n >> a >> b;
        vector<int> p1, p2;
        if (solve(n, a, b, p1, p2)) {
            cout << "YES" << endl;
            for (int i = 0; i < n; ++i) cout << p1[i] << (i == n - 1 ? "" : " ");
            cout << endl;
            for (int i = 0; i < n; ++i) cout << p2[i] << (i == n - 1 ? "" : " ");
            cout << endl;
        } else {
            cout << "NO" << endl;
        }
    }
    return 0;
}

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