CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:lakshith-403
Submission time:2021-01-30 13:03:10 +0200
Language:C++11
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>

#define ll long long
#define what_is(a) cout << #a << " is " << a << "\n";
#define check(a) cout << "reached " << a << "\n";

using namespace std;

int main(){
	int n;
	cin >> n;
	ll r = 0;
	for(int i=0;i<n;i++)r+=i+1;
	if((r-3)%3!=0){
		//check(1)
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	int a = (r-3)/3;
	int mem[n+1];
	memset(mem,0,sizeof(mem));
	r = 0;
	for(int i=n;i>=1;i--){
		if(mem[i]!=0)continue;
		if(i+r<=a)r+=i,mem[i]=1;
	}
	if(r!=a){
		//check(2)
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	r=0,a++;
	for(int i=n;i>=1;i--){
		if(mem[i]!=0)continue;
		if(i+r<=a)r+=i,mem[i]=2;
	}
	if(r!=a){
		//check(3)
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	r=0,a++;
	for(int i=n;i>=1;i--){
		if(mem[i]!=0)continue;
		if(i+r<=a)r+=i,mem[i]=3;
	}
	if(r!=a){
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	for(int i=1;i<=n;i++)cout << mem[i] << " ";
	cout << "\n";
}

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
3 3 3 1 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
3 3 1 3 2 3 2 1 

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
3 3 3 3 1 3 2 2 1 

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
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...

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
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...

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
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...

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
3 3 3 3 1 3 3 3 3 3 3 3 3 3 3 ...

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
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE