Kortit I

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
 
using namespace std;
 
pair<int, int> count_wins(const vector<int> &seq1, const vector<int> &seq2)
{
    int p1_wins = 0, p2_wins = 0;
    for (size_t i = 0; i < seq1.size(); ++i)
    {
        if (seq1[i] > seq2[i])
            ++p1_wins;
        else if (seq1[i] < seq2[i])
            ++p2_wins;
    }
    return {p1_wins, p2_wins};
}
 
bool next_combination(vector<int> &a, int n)
{
    int k = a.size();
    for (int i = k - 1; i >= 0; i--)
    {
        if (a[i] < n - k + i + 1)
        {
            a[i]++;
            for (int j = i + 1; j < k; j++)
                a[j] = a[j - 1] + 1;
            return true;
        }
    }
    return false;
}
 
tuple<bool, vector<int>, vector<int>> solve_test_case(int n, int target_a, int target_b)
{
    vector<int> p1_cards(n), p2_cards(n);
    iota(p1_cards.begin(), p1_cards.end(), 1);
    iota(p2_cards.begin(), p2_cards.end(), 1);
 
    do
    {
        vector<int> indices(target_a);
        iota(indices.begin(), indices.end(), 0);
 
        do
        {
            vector<int> temp_p2 = p2_cards;
            for (int i : indices)
            {
                swap(temp_p2[i], temp_p2[p1_cards[i] - 1]);
            }
 
            auto [a, b] = count_wins(p1_cards, temp_p2);
            if (a == target_a && b == target_b)
            {
                return {true, p1_cards, temp_p2};
            }
        } while (next_combination(indices, n));
    } while (next_permutation(p1_cards.begin(), p1_cards.end()));
 
    return {false, {}, {}};
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int repetitions;
    cin >> repetitions;
 
    while (repetitions--)
    {
        int n, a, b;
        cin >> n >> a >> b;
 
        auto [possible, p1_cards, p2_cards] = solve_test_case(n, a, b);
        if (!possible)
        {
            cout << "NO\n";
        }
        else
        {
            cout << "YES\n";
            for (int card : p1_cards)
            {
                cout << card << " ";
            }
            cout << "\n";
            for (int card : p2_cards)
            {
                cout << card << " ";
            }
            cout << "\n";
        }
    }
 
    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: RUNTIME ERROR

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.

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