Kortit I

//
//  main.cpp
//  cpp
//
//  Created by Fatih Meric Koc on 28.10.2024.
//


#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using namespace std;

pair<bool, pair<vector<int>, vector<int>>> solve(int n, int a, int b) {
    // Impossible cases
    if (a + b > n)  // Total points can't exceed number of rounds
        return {false, {{}, {}}};
    if (max(a, b) > n/2 + n%2)  // Can't win more than ceil(n/2) rounds
        return {false, {{}, {}}};
    
    // For n = 2, special case handling
    if (n == 2) {
        if (a == 1 && b == 1) {
            return {true, {{1, 2}, {2, 1}}};
        }
        if (a == 0 && b == 1) {
            return {false, {{}, {}}};
        }
        if (a == 0 && b == 0) {
            return {true, {{1, 1}, {1, 1}}};
        }
    }
    
    // For all draws case
    if (a == 0 && b == 0) {
        vector<int> sequence(n);
        for (int i = 0; i < n; i++) sequence[i] = i + 1;
        return {true, {sequence, sequence}};
    }
    
    vector<int> player1(n), player2(n);
    vector<bool> used1(n + 1, false), used2(n + 1, false);
    
    // Handle player1's wins
    int pos = 0;
    for (int i = 0; i < a; i++) {
        player1[pos] = n - i;
        player2[pos] = i + 1;
        used1[n - i] = true;
        used2[i + 1] = true;
        pos++;
    }
    
    // Handle player2's wins
    for (int i = 0; i < b; i++) {
        // Find next available high card for player2
        int high = n;
        while (used2[high]) high--;
        // Find next available low card for player1
        int low = 1;
        while (used1[low]) low++;
        
        player1[pos] = low;
        player2[pos] = high;
        used1[low] = true;
        used2[high] = true;
        pos++;
    }
    
    // Fill remaining positions with draws
    int next = 1;
    while (pos < n) {
        while (next <= n && (used1[next] || used2[next])) next++;
        if (next <= n) {
            player1[pos] = next;
            player2[pos] = next;
            used1[next] = used2[next] = true;
            pos++;
        }
    }
    
    // Verify solution
    int check_a = 0, check_b = 0;
    for (int i = 0; i < n; i++) {
        if (player1[i] > player2[i]) check_a++;
        else if (player2[i] > player1[i]) check_b++;
    }
    
    if (check_a == a && check_b == b) {
        return {true, {player1, player2}};
    }
    
    return {false, {{}, {}}};
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    vector<tuple<int, int, int>> test_cases(t);
    for (int i = 0; i < t; ++i) {
        int n, a, b;
        cin >> n >> a >> b;
        test_cases[i] = make_tuple(n, a, b);
    }

    for (const auto& test_case : test_cases) {
        int n, a, b;
        tie(n, a, b) = test_case;
        auto result = solve(n, a, b);
        
        if (!result.first) {
            cout << "NO\n";
        } else {
            cout << "YES\n";
            for (int x : result.second.first) {
                cout << x << " ";
            }
            cout << "\n";
            for (int x : result.second.second) {
                cout << x << " ";
            }
            cout << "\n";
        }
    }

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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