Kortit I

#include <bits/stdc++.h>
 
using namespace std;
 
int nums {};
 
unordered_set<int> cards1 {};
unordered_set<int> cards2 {};
 
int points1 {}, points2 {};
int targetPoints1 {}, targetPoints2 {};
 
bool search(vector<pair<int, int>>& result)
{
    if(cards1.size() == 0)
    {
        if(points1 == targetPoints1 && points2 == targetPoints2)
            return true;
        if(points1 == targetPoints2 && points2 == targetPoints1)
        {
            for_each(result.begin(), result.end(), [](auto& e)
            {
                swap(e.first, e.second);
            });
            return true;
        }
    }
    else
    {
        for(int i {1}; i < (nums + 1); ++i)
        {
            if(!cards1.contains(i)) continue;
        
            cards1.erase(i);
 
            for(int j {1}; j < (nums + 1); ++j)
            {
                if(!cards2.contains(j)) continue;
 
                int p1 {points1}, p2 {points2}; 
                if(i > j)
                {
                    ++points1;
                }
                else if(j > i)
                {
                    ++points2;
                }
                cards2.erase(j);
 
                result.push_back(make_pair(i, j));
                
                if(search(result)) return true;
 
                result.pop_back();
 
                points1 = p1;
                points2 = p2;
 
                cards2.insert(j);
            }
            cards1.insert(i);
        }
 
    }
    return false;
}
 
int main()
{
    int n {};
    cin >> n;
 
    queue<tuple<int, int, int>> input {};
 
    for(int i {}; i < n; ++i)
    {
        cin >> nums >> targetPoints1 >> targetPoints2;
        input.push(make_tuple(nums, targetPoints1, targetPoints2));
    }
 
    for(int i {}; i < n; ++i)
    {
        nums = get<0>(input.front());
        targetPoints1 = get<1>(input.front());
        targetPoints2 = get<2>(input.front());
        input.pop();

        cards1.reserve(nums * 2);
        cards2.reserve(nums * 2);
 
        for(int j {}; j < nums; ++j)
        {
            cards1.insert(j + 1);   
            cards2.insert(j + 1);   
        }

        vector<pair<int, int>> result {};
        result.reserve(nums);
 
        bool y {((targetPoints1 + targetPoints2) > nums) ? false : search(result)};

        if(y)
        {
            cout << "YES\n";
            for(auto a : result)
                cout << a.first << ' ';
            cout << '\n';
            for(auto b : result)
                cout << b.second << ' ';
            cout << '\n';
        }
        else cout << "NO\n";

        cards1 = {};
        cards2 = {};
        points1 = 0;
        points2 = 0;
    }
 
    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