Kortit I

input/code.cpp: In function 'void solve(int, int, int)':
input/code.cpp:14:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   14 |     if ( a==n && b==0 || a==0 && b==n ) {
      |          ~~~~~^~~~~~~
input/code.cpp:58:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   58 |         if (biggest_1 == smallest_2) cout << "NO"; return;
      |         ^~
input/code.cpp:58:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   58 |         if (biggest_1 == smallest_2) cout << "NO"; return;
      |                                                    ^~~~~~
input/code.cpp:77:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   77 |         if (biggest_2 == smallest_1) cout << "NO"; return;
      |         ^~
input/code.cpp:77:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   77 |         if (biggest_2 == smallest...

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <numeric>
using namespace std;
 
void solve(int n, int a, int b) {
    if (a + b > n) {
        cout << "NO" << endl;
        return;
    } 
 
    if ( a==n && b==0 || a==0 && b==n ) {
        cout << "NO" << endl;
        return;
    }
 
    vector<int> nums(n);
    iota(nums.begin(), nums.end(), 1);
 
    set<int> usable1, usable2;
    vector<int> solution1, solution2;    
    
    for (int i = 1; i <= n; i++) {
        usable1.insert(i);
        usable2.insert(i);
    }    
    
    //int usable1_s = usable1.size();
    //int usable2_s = usable2.size();
    
    if (a + b < n) {
        for (int i = 1; i <= n - (a + b); i++) {
            solution1.push_back(i);
            solution2.push_back(i);            
            usable1.erase(i);
            usable2.erase(i);
        }
    }        
 
    cout << "usable1: ";
    for (int i : usable1) cout << i << " ";
    cout << endl;
    cout << "usable2: ";
    for (int i : usable2) cout << i << " ";
 
    for (int i=0;i<a;i++) {
        // ensin suurin,
        // sit pienin.
 
        // sit kohtaan b ensin suurin ja sit a:n suurin, 
        //koska kohdassa a ei ole enää suurinta, mikä olisi suurempi tai yhtä suuri kuin kohdan b suurin.
 
        int biggest_1 = *usable1.rbegin();
        int smallest_2 = *usable2.begin();
        
        if (biggest_1 == smallest_2) cout << "NO"; return;
 
        solution1.push_back(biggest_1);
        solution2.push_back(smallest_2);
 
        usable1.erase(biggest_1);
        usable2.erase(smallest_2);
    }    
 
    for (int i=0;i<b;i++) {
        // ensin suurin,
        // sit pienin.
 
        // sit kohtaan b ensin suurin ja sit a:n suurin, 
        //koska kohdassa a ei ole enää suurinta, mikä olisi suurempi tai yhtä suuri kuin kohdan b suurin.
 
        int biggest_2 = *usable2.rbegin();
        int smallest_1 = *usable1.rbegin();
 
        if (biggest_2 == smallest_1) cout << "NO"; return;
 
        solution2.push_back(biggest_2);
        solution1.push_back(smallest_1);
 
        usable2.erase(biggest_2);
        usable1.erase(smallest_1);
    }
 
    
            /*        
            4 0 3            
 
            4, 1, 2
 
            1 4 3 2
            1 2 4 3
            
            6, 2, 4
            
            6 5 4 3 2 1
            1 2 6 5 4 3
            
            1 4 3 2
            1 2 4 3
 
            5, 2, 3
 
            5 4 3 2 1
            1 2 5 4 3
 
            5, 2, 2
 
            1 5 4 3 2
            1 2 3 5 4
 
            3, 0, 2
 
            1 2 2
            1 3 2
 
            impossible
 
            6, 2, 3
 
            1 6 5 4 3 2
            1 2 3 6 5 4
 
            5, 2, 1
 
            1 2 4 5 3
            1 2 3 4 5
 
            2, 0, 1
 
            1 2
            1 2
 
            2, 1, 1
 
            2 1
            1 2
 
            4, 1, 3
 
            4 3 2 1
            1 4 3 2
 
            4, 1, 3
 
            4 3 2 1
            1 4 3 2
 
            4, 2, 2
 
            4 3 2 1
            1 2 4 3
 
            5, 3, 1
 
            1 5 4 3 2
            1 4 3 2 5
 
            6, 3, 3
 
            6 5 4 3 2 1
            1 2 3 6 5 4
 
            10, 5, 5
 
            10 9 8 7 6 5 4 3 2 1
            1 2 3 4 5 6 7 8 9 10
 
            10, 3, 5
 
            1 2 10 9 8 7 6 5 4 3
            1 2 3 4 5 10 9 8 7 6
 
            5, 1, 2
 
            1 2 5 4 3
            1 2 3 5 4
 
            5, 2, 1
 
            1 2 5 
            1 2 3 
 
            */
 
    if (solution1.size() == solution2.size()) {
        cout << "YES" << endl;
    } else {
        cout << "NO"; 
        return;
    }
 
    for (int i : solution1) cout << " " << i;
    cout << endl;
    for (int i : solution2) cout << " " << i;
    cout << endl;
}
 
int main() {
    int t;
    cin >> t;    
 
    while (t--) {
        int n, a, b;
        cin >> n >> a >> b;
        solve(n, a, b);
    }
    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER

Test 4

Group: 3

Verdict: WRONG ANSWER

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER

Test 10

Group: 3

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: WRONG ANSWER

Test 18

Group: 3

Verdict: WRONG ANSWER

Test 19

Group: 3

Verdict: WRONG ANSWER

Test 20

Group: 3

Verdict: WRONG ANSWER