CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Kortit I
Sender:	Sukarth
Submission time:	2024-11-10 15:33:19 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.00 s	1, 2, 3	details
#2	TIME LIMIT EXCEEDED	--	2, 3	details
#3	TIME LIMIT EXCEEDED	--	3	details
#4	TIME LIMIT EXCEEDED	--	3	details
#5	TIME LIMIT EXCEEDED	--	3	details
#6	TIME LIMIT EXCEEDED	--	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	TIME LIMIT EXCEEDED	--	3	details
#10	TIME LIMIT EXCEEDED	--	3	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int MAX_N = 8;

int count_wins(const vector<int> &a, const vector<int> &b)
{
    int wins = 0;
    for (size_t i = 0; i < a.size(); ++i)
    {
        if (a[i] > b[i])
            ++wins;
    }
    return wins;
}

bool solve(int n, int target_a, int target_b, vector<int> &p1, vector<int> &p2)
{
    vector<int> perm(n);
    for (int i = 0; i < n; ++i)
        perm[i] = i + 1;

    do
    {
        for (int mask = 0; mask < (1 << n); ++mask)
        {
            p1.clear();
            p2.clear();
            for (int i = 0; i < n; ++i)
            {
                if (mask & (1 << i))
                {
                    p1.push_back(perm[i]);
                }
                else
                {
                    p2.push_back(perm[i]);
                }
            }
            if (p1.size() == static_cast<size_t>(n / 2) && count_wins(p1, p2) == target_a && count_wins(p2, p1) == target_b)
            {
                return true;
            }
        }
    } while (next_permutation(perm.begin(), perm.end()));

    return false;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--)
    {
        int n, a, b;
        cin >> n >> a >> b;

        vector<int> p1, p2;
        bool possible = solve(n, a, b, p1, p2);

        if (!possible)
        {
            cout << "NO\n";
        }
        else
        {
            cout << "YES\n";
            for (int x : p1)
                cout << x << ' ';
            cout << '\n';
            for (int x : p2)
                cout << x << ' ';
            cout << '\n';
        }
    }

    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: RUNTIME ERROR

input
`54 4 4 0 3 1 3 3 2 2 4 0 4 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`284 6 1 0 5 0 2 7 1 5 7 7 5 ...` view save

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

user output
(empty)

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

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

user output
(empty)

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`869 17 12 9 16 8 4 15 9 9 17 11 15 ...` view save

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

user output
(empty)

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`761 18 3 15 19 1 15 18 8 1 19 19 17 ...` view save

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

user output
(empty)

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`925 21 14 21 20 18 18 20 7 6 21 14 9 ...` view save

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

user output
(empty)

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`529 22 3 3 22 17 5 22 6 15 22 22 20 ...` view save

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

user output
(empty)

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`576 23 18 9 23 16 8 23 16 13 23 16 22 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`625 24 2 22 24 15 21 24 6 3 24 21 1 ...` view save

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

user output
(empty)

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`676 25 16 25 25 15 2 25 15 7 25 15 16 ...` view save

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

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`729 26 2 18 26 14 18 26 5 18 26 19 13 ...` view save

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

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`784 27 26 7 27 14 0 27 14 5 27 14 14 ...` view save

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

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`841 28 26 16 28 13 19 28 5 8 28 26 4 ...` view save

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

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`900 29 24 15 29 13 2 29 13 7 29 13 16 ...` view save

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

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`961 30 24 26 30 12 24 30 4 29 30 24 14 ...` view save

correct output
`NO NO NO NO YES ...` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

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

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

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

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`NO NO NO NO YES ...` view save

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`NO NO NO NO NO ...` view save

user output
(empty)

Datatähti 2025 alku

Kortit I

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Sukarth)