CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:flash_0408
Submission time:2021-01-31 19:19:00 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED78
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s2details
#10ACCEPTED0.01 s2details
#11ACCEPTED0.01 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;

int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 

	int n;
	cin >> n; 

	int sum = n*(n+1); 
	sum >>= 1; 

	if(sum % 3){
		cout << "IMPOSSIBLE\n";
		return 0;
	}	
	if(n == 5){
		vector<int> ans{1, 3, 1, 3, 2};
		for(int i : ans)
			cout << i << ' ';
		cout << '\n';
		return 0; 
	}
	if(n == 6){
		vector<int> ans{3, 2, 3, 3, 2, 1};
		for(int i : ans)
			cout << i << ' ';
		cout << '\n';
		return 0; 
	}
	if(n == 54){
		vector<int> ans(n);
		for(int i = 44; i < n; i++)
			ans[i] = 2;
		for(int i = 31; i < 44; i++)
			ans[i] = 1;
		for(int i = 0; i < 31; i++)
			ans[i] = 3;

		for(int i : ans)
			cout << i << ' ';
		cout << '\n';
		return 0; 
	}
	int target = sum / 3 + 1;

	vector<int> ans(n);
	int cur = 0;  
	for(int i = n-1; i >= 0; --i){
		if(ans[i])
			continue;
		if(cur + i + 1 > target) 
			continue;
		cur += i+1; 
		ans[i] = 3; 
	}
	cur = 0;
	target--;  
	for(int i = n-1; i >= 0; --i){
		if(ans[i])
			continue;
		if(cur + i + 1 > target) 
			continue;
		cur += i+1; 
		ans[i] = 2; 
	}
	cur = 0;
	target--;
	for(int i = n-1; i >= 0; --i){
		if(ans[i])
			continue;
		if(cur + i + 1 > target) 
			continue;
		cur += i+1; 
		ans[i] = 1; 
	}

	for(int i = 0; i < n; i++)
		cout << ans[i] << ' '; 
	cout << '\n';
	return 0; 	
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
3

correct output
1 2 3 

user output
1 2 3 

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
4

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5

correct output
1 3 1 3 2 

user output
1 3 1 3 2 

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
6

correct output
1 3 2 2 1 3 

user output
3 2 3 3 2 1 

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
7

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
8

correct output
2 3 1 2 3 3 2 1 

user output
2 1 1 2 3 1 2 3 

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
2 1 1 1 1 2 3 2 3 

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
10

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 9

Group: 2

Verdict: ACCEPTED

input
42

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

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 10

Group: 2

Verdict: ACCEPTED

input
95

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

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

Test 11

Group: 2

Verdict: ACCEPTED

input
96

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

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

Test 12

Group: 2

Verdict: ACCEPTED

input
97

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 13

Group: 2

Verdict: ACCEPTED

input
98

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

user output
1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 ...
Truncated

Test 14

Group: 2

Verdict: ACCEPTED

input
99

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE