CSES - NOI 2024 - Results
Submission details
Task:Chair Game
Sender:Frederik Vase Haraldsson
Submission time:2024-07-10 21:32:24 +0300
Language:C++20
Status:READY
Result:23
Feedback
groupverdictscore
#10
#20
#3ACCEPTED4
#4ACCEPTED7
#5ACCEPTED12
#60
#70
#80
Test results
testverdicttimegroup
#10.00 s1, 7, 8details
#20.00 s1, 7, 8details
#30.00 s1, 7, 8details
#40.00 s1, 7, 8details
#50.00 s1, 7, 8details
#60.00 s7, 8details
#70.00 s7, 8details
#80.00 s2, 8details
#9ACCEPTED0.01 s3, 4, 5, 6, 8details
#10ACCEPTED0.01 s3, 4, 5, 6, 8details
#11ACCEPTED0.01 s3, 4, 5, 6, 8details
#12ACCEPTED0.02 s3, 4, 5, 6, 8details
#13ACCEPTED0.01 s4, 5, 6, 7, 8details
#14ACCEPTED0.01 s4, 5, 6, 8details
#15ACCEPTED0.01 s4, 5, 6, 8details
#16ACCEPTED0.01 s4, 5, 6, 8details
#17ACCEPTED0.00 s5, 6, 7, 8details
#18ACCEPTED0.01 s5, 6, 8details
#19ACCEPTED0.01 s5, 6, 8details
#20ACCEPTED0.02 s5, 6, 8details
#210.00 s1, 6, 7, 8details
#220.00 s6, 7, 8details
#230.01 s6, 8details
#240.01 s6, 8details
#250.00 s8details
#260.00 s8details
#27ACCEPTED0.01 s3, 4, 5, 6, 8details
#280.00 s8details
#290.00 s8details
#300.00 s8details

Code

#include <bits/stdc++.h>
 
using namespace std;
int N;

void mx3(vector<int> cnt)
{
	if (cnt[1] == N)
	{
		cout << "YES\n";
		while (N--)
			cout << 1 << ' ';
		cout << '\n';
		return;
	}
	else if (cnt[3] == N)
	{
		cout << "YES\n";
		while (N--)
			cout << 3 << ' ';
		cout << '\n';
		return;
	}

	if (cnt[1] != cnt[3])
	{
		cout << "NO\n";
		return;
	}

	cout << "YES\n";
	while (cnt[2]--)
		cout << 2 << ' ';
	while (cnt[1]--) 
		cout << "3 1 ";
	cout << '\n';
}

void solve()
{
	cin >> N;
	vector<int> cnt(5);
	for (int i = 0; i < N; i++)
	{
		int x;
		cin >> x;
		cnt[x]++;
	}

	if (cnt[4] == 0)
	{
		mx3(cnt);
		return;
	}

	if (cnt[4] == N)
	{
		cout << "YES\n";
		while (N--)
			cout << "4 ";
		cout << '\n';
		return;
	}

	if (cnt[3] + 2 * cnt[4] == cnt[1])
	{
		cout << "YES\n";
		// '2' combinations
		// 31.. == 22..
		// ..## == ..##

		// 411.. == 222..
		// ..### == ..###

		while (cnt[3]--)
			cout << "3 1 ";
		
		while (cnt[4]--)
			cout << "4 1 1 ";

		while (cnt[2]--)
			cout << "2 ";

		cout << '\n';
	}
	else if (cnt[2] + 2 * cnt[1] == cnt[4])
	{
		cout << "YES\n";
		// '3' combinations
		// 42... == 33...
		// ...## == ...##

		// 441... == 333...
		// ...### == ...###

		while (cnt[2]--)
			cout << "4 2 ";
		
		while (cnt[1]--)
			cout << "4 4 1 ";

		while (cnt[3]--)
			cout << "3 ";

		cout << '\n';
	}
	else
		cout << "NO\n";
}
 
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int tt;
	cin >> tt;
 
	while (tt--)
		solve();
 
	return 0;
}

Test details

Test 1

Group: 1, 7, 8

Verdict:

input
637
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
(empty)

Error:
munmap_chunk(): invalid pointer

Test 2

Group: 1, 7, 8

Verdict:

input
246
7
1 1 1 1 1 1 1
7
1 1 2 1 1 7 1
...

correct output
YES
1 1 1 1 1 1 1 
YES
1 1 1 1 2 7 1 
YES
...

user output
(empty)

Error:
double free or corruption (out)

Test 3

Group: 1, 7, 8

Verdict:

input
810
8
1 1 1 1 1 1 1 1
8
1 1 1 8 1 1 2 1
...

correct output
YES
1 1 1 1 1 1 1 1 
YES
1 1 2 8 1 1 1 1 
YES
...

user output
(empty)

Error:
double free or corruption (out)

Test 4

Group: 1, 7, 8

Verdict:

input
1000
8
8 8 5 2 8 7 6 5
8
6 5 2 2 8 2 1 6
...

correct output
NO
YES
8 2 2 6 2 5 1 6 
NO
NO
...

user output
(empty)

Error:
malloc(): corrupted top size

Test 5

Group: 1, 7, 8

Verdict:

input
1000
8
2 1 7 7 2 3 8 2
8
4 1 5 4 7 3 5 3
...

correct output
YES
7 2 2 7 1 3 8 2 
YES
4 4 7 3 3 5 5 1 
YES
...

user output
(empty)

Error:
malloc(): corrupted top size

Test 6

Group: 7, 8

Verdict:

input
1000
16
15 16 6 4 14 2 1 6 2 16 10 2 9...

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Error:
malloc(): corrupted top size

Test 7

Group: 7, 8

Verdict:

input
1000
16
2 4 13 6 8 16 12 8 16 5 9 5 9 ...

correct output
YES
13 5 2 8 12 2 8 5 16 16 9 6 9 ...

user output
(empty)

Error:
malloc(): corrupted top size

Test 8

Group: 2, 8

Verdict:

input
1000
1
1
2
1 2
...

correct output
YES

NO
YES
3 1 2 
...

user output
(empty)

Error:
double free or corruption (out)

Test 9

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
988
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 10

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
199
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 11

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 1 1 2 1 1 2 2 1 1 1 1 1 2 1 ...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 12

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
YES
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
YES
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
Truncated

Test 13

Group: 4, 5, 6, 7, 8

Verdict: ACCEPTED

input
963
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 14

Group: 4, 5, 6, 8

Verdict: ACCEPTED

input
979
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 15

Group: 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
3 3 1 2 1 1 2 3 1 3 2 1 1 3 1 ...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 16

Group: 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 2 2 2 2 1 1 1 2 3 1 1 3 2 1 ...

correct output
YES
2 2 2 3 1 2 3 1 2 3 1 3 1 3 1 ...

user output
YES
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
Truncated

Test 17

Group: 5, 6, 7, 8

Verdict: ACCEPTED

input
980
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 18

Group: 5, 6, 8

Verdict: ACCEPTED

input
947
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 19

Group: 5, 6, 8

Verdict: ACCEPTED

input
1000
100
1 2 4 2 1 3 1 2 2 3 1 1 3 1 4 ...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 20

Group: 5, 6, 8

Verdict: ACCEPTED

input
1000
100
3 4 4 4 4 4 4 3 3 3 4 4 2 3 3 ...

correct output
YES
4 2 4 4 1 3 4 2 4 2 3 4 2 4 4 ...

user output
YES
4 2 4 2 4 2 4 2 4 2 4 2 4 2 4 ...
Truncated

Test 21

Group: 1, 6, 7, 8

Verdict:

input
715
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 22

Group: 6, 7, 8

Verdict:

input
843
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 23

Group: 6, 8

Verdict:

input
1000
100
3 4 5 1 4 4 2 3 2 3 4 1 1 1 2 ...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 24

Group: 6, 8

Verdict:

input
1000
100
5 3 4 3 5 3 3 5 5 4 5 5 5 5 2 ...

correct output
YES
4 4 5 5 2 4 4 5 3 5 5 2 5 5 2 ...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 25

Group: 8

Verdict:

input
1000
100
88 70 59 44 28 10 19 19 42 16 ...

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Error:
malloc(): corrupted top size

Test 26

Group: 8

Verdict:

input
1000
100
31 72 52 30 77 56 79 10 88 11 ...

correct output
YES
31 62 14 10 66 63 1 82 37 92 3...

user output
(empty)

Error:
malloc(): corrupted top size

Test 27

Group: 3, 4, 5, 6, 8

Verdict: ACCEPTED

input
1000
1
1
2
1 1
...

correct output
YES

YES
1 1 
YES
...

user output
YES

YES
1 1 
YES
...
Truncated

Test 28

Group: 8

Verdict:

input
1000
1
1
2
2 2
...

correct output
YES

YES
2 2 
YES
...

user output
(empty)

Error:
munmap_chunk(): invalid pointer

Test 29

Group: 8

Verdict:

input
1000
100
87 81 29 35 8 98 77 50 46 34 5...

correct output
YES
34 74 25 91 80 18 95 26 88 12 ...

user output
(empty)

Error:
malloc(): corrupted top size

Test 30

Group: 8

Verdict:

input
1000
100
65 92 39 22 67 41 17 65 97 71 ...

correct output
YES
9 38 24 59 69 24 63 3 22 35 24...

user output
(empty)

Error:
malloc(): corrupted top size