CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:andr1y
Submission time:2021-01-30 12:17:14 +0200
Language: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;
typedef long long ll;
const ll N = 1e5+228;
ll bel[N];
vector<ll> bl[3];
signed main(){
	cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
    ll n;
    cin>>n;
    if(n%3==0){
        ll xs[3] = {0, 1, 2};
        bl[0].push_back(1);
        bl[1].push_back(2);
        bl[2].push_back(3);
        for(ll i =4;i<n;i+=3){
            bl[xs[0]].push_back(i+1);
            bl[xs[1]].push_back(i+2);
            bl[xs[2]].push_back(i);
            swap(xs[1], xs[2]);
        }
        for(auto i : bl[xs[0]]) bel[i]=1;
        for(auto i : bl[xs[1]]) bel[i]=2;
        for(auto i : bl[xs[2]]) bel[i]=3;
        for(ll i = 1;i<=n;i++) cout<<bel[i]<<' ';
    }else if(n%3==2){
        ll xs[3] = {0, 1, 2};
        bl[0].push_back(1);
        bl[0].push_back(3);
        bl[1].push_back(5);
        bl[2].push_back(2);
        bl[2].push_back(4);
        for(ll i =6;i<n;i+=3){
            bl[xs[0]].push_back(i+1);
            bl[xs[1]].push_back(i+2);
            bl[xs[2]].push_back(i);
            swap(xs[1], xs[2]);
        }
        for(auto i : bl[xs[0]]) bel[i]=1;
        for(auto i : bl[xs[1]]) bel[i]=2;
        for(auto i : bl[xs[2]]) bel[i]=3;
        for(ll i = 1;i<=n;i++) cout<<bel[i]<<' ';
    }else cout<<"IMPOSSIBLE";
}

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

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

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE