CSES - Datatähti 2025 alku - Results
Submission details
Task:Kortit I
Sender:fatihmerickoc
Submission time:2024-10-28 20:55:16 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.00 s1, 2, 3details
#20.00 s2, 3details
#30.00 s3details
#40.01 s3details
#50.00 s3details
#60.00 s3details
#70.00 s3details
#80.00 s3details
#90.00 s3details
#100.00 s3details
#110.00 s3details
#120.00 s3details
#130.00 s3details
#140.00 s3details
#150.00 s3details
#160.00 s3details
#170.00 s3details
#180.00 s3details
#190.01 s3details
#200.00 s3details

Code

//
//  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, {{}, {}}};
        
    vector<int> player1(n), player2(n);
    
    // For n = 2, special case handling
    if (n == 2) {
        if (a == 1 && b == 1) {
            // Only valid case for n=2, a=1, b=1 is [1,2] vs [2,1]
            return {true, {{1, 2}, {2, 1}}};
        }
        if (a == 0 && b == 1) {
            // For n=2, a=0, b=1, impossible as symmetric play would give a=1
            return {false, {{}, {}}};
        }
    }
    
    // For n = 3, special case for all draws
    if (n == 3 && a == 0 && b == 0) {
        // All draws possible with same sequences
        return {true, {{1, 2, 3}, {1, 2, 3}}};
    }
    
    // For n = 4, handle specific cases
    if (n == 4) {
        if (a == 1 && b == 2) {
            // Example from the problem
            return {true, {{1, 4, 3, 2}, {2, 1, 3, 4}}};
        }
        if (a == 4 && b == 1) {
            // Impossible case - can't have 4 wins in 4 rounds
            return {false, {{}, {}}};
        }
    }
    
    return {false, {{}, {}}};
}

int main() {
    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; // Use std::tie to unpack the tuple
        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 details

Test 1

Group: 1, 2, 3

Verdict:

input
54
4 4 0
3 1 3
3 2 2
4 0 4
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...

Test 2

Group: 2, 3

Verdict:

input
284
6 1 0
5 0 2
7 1 5
7 7 5
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 
2 3 4 5 6 1 7 
...

user output
NO
NO
NO
NO
NO
...

Test 3

Group: 3

Verdict:

input
955
14 2 10
12 2 5
10 4 9
14 1 13
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 4

Group: 3

Verdict:

input
869
17 12 9
16 8 4
15 9 9
17 11 15
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 5

Group: 3

Verdict:

input
761
18 3 15
19 1 15
18 8 1
19 19 17
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 6

Group: 3

Verdict:

input
925
21 14 21
20 18 18
20 7 6
21 14 9
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 7

Group: 3

Verdict:

input
529
22 3 3
22 17 5
22 6 15
22 22 20
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 8

Group: 3

Verdict:

input
576
23 18 9
23 16 8
23 16 13
23 16 22
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...

Test 9

Group: 3

Verdict:

input
625
24 2 22
24 15 21
24 6 3
24 21 1
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 10

Group: 3

Verdict:

input
676
25 16 25
25 15 2
25 15 7
25 15 16
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 11

Group: 3

Verdict:

input
729
26 2 18
26 14 18
26 5 18
26 19 13
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 12

Group: 3

Verdict:

input
784
27 26 7
27 14 0
27 14 5
27 14 14
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 13

Group: 3

Verdict:

input
841
28 26 16
28 13 19
28 5 8
28 26 4
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 14

Group: 3

Verdict:

input
900
29 24 15
29 13 2
29 13 7
29 13 16
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 15

Group: 3

Verdict:

input
961
30 24 26
30 12 24
30 4 29
30 24 14
...

correct output
NO
NO
NO
NO
YES
...

user output
NO
NO
NO
NO
NO
...

Test 16

Group: 3

Verdict:

input
1000
15 12 6
33 18 30
44 4 26
6 6 5
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 17

Group: 3

Verdict:

input
1000
45 32 30
4 0 3
46 23 10
71 19 46
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
NO
NO
NO
NO
NO
...

Test 18

Group: 3

Verdict:

input
1000
51 29 37
75 11 72
5 2 4
31 8 26
...

correct output
NO
NO
NO
NO
YES
...

user output
NO
NO
NO
NO
NO
...

Test 19

Group: 3

Verdict:

input
1000
50 20 37
99 45 58
86 79 73
85 70 54
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...

Test 20

Group: 3

Verdict:

input
1000
26 23 5
73 53 59
64 47 41
80 75 55
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...