CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:ritul_kr_singh
Submission time:2021-01-30 17:17:41 +0200
Language:C++ (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>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n; cin >> n;
int a[n+1];
for(int& i : a) i = 3;
if(n%6==0){
int b=n/6;
for(int i=1; i<=b; ++i){
a[i] = 1;
a[n+1-i] = 1;
}
for(int i=b+1; i<=b+b; ++i){
a[i] = 2;
a[n+1-i] = 2;
}
a[1] = 2;
a[2] = 1;
}
if(n%6==2){
int b=n/6;
for(int i=1; i<=b; ++i){
a[i+2] = 1;
a[n+1-i] = 1;
}
for(int i=b+1; i<=b+b; ++i){
a[i+2] = 2;
a[n+1-i] = 2;
}
a[1] = 1;
a[2] = 2;
}
if(n%6==3){
int b=n/6;
for(int i=1; i<=b; ++i){
a[i+3] = 1;
a[n+1-i] = 1;
}
for(int i=b+1; i<=b+b; ++i){
a[i+3] = 2;
a[n+1-i] = 2;
}
a[1] = 1;
a[2] = 2;
a[3] = 3;
}
if(n%6==5){
int b=n/6;
for(int i=1; i<=b; ++i){
a[i+5] = 1;
a[n+1-i] = 1;
}
for(int i=b+1; i<=b+b; ++i){
a[i+5] = 2;
a[n+1-i] = 2;
}
a[1] = 1;
a[2] = 1;
a[3] = 1;
a[4] = 2;
a[5] = 3;
}
if(n%3==1){
cout << "IMPOSSIBLE";
}else{
int todo[4];
pair<int, int> sum[3] = {{0, 1}, {0, 2}, {0, 3}};
for(int i=1; i<=n; ++i){
sum[a[i]-1].first += i;
}
sort(sum, sum+3);
for(int i=0; i<3; ++i){
todo[sum[i].second] = i+1;
}
for(int i=1; i<n; ++i){
cout << todo[a[i]] << " ";
}
cout << todo[a[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
1 3 2 2 1 3

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

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
1 2 3 1 2 3 3 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 1 1 1 1 1 1 3 3 3 3 3 3 3 2 ...

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