CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:doowey
Submission time:2021-01-31 14:18:58 +0200
Language:C++ (C++11)
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED22
#20
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
#90.01 s2details
#100.01 s2details
#110.01 s2details
#12ACCEPTED0.01 s2details
#130.01 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;

const int N = 105;
int sol[N];

int main(){
    int n;
    cin >> n;
    if(n % 3 == 1){
        cout << "IMPOSSIBLE\n";
        return 0;
    }
    int m = n;
    int q;
    while(m > 10){
        q = m - 5;
        sol[q] = 1;
        sol[q + 5] = 1;
        sol[q + 2] = 2;
        sol[q + 4] = 2;
        m -= 6;
    }
    int a = (m * 1ll * (m + 1) / 2 - 3) / 3;
    int b = a + 1;
    int j;
    int cum0 = 0, cum1 = 0;
    bool bruh=false;
    for(int i = 0 ; i < (1 << m); i ++ ){
        j = i;
        while(1){
            cum0 = 0;
            cum1 = 0;
            for(int q = 0 ; q < m ; q ++ ){
                sol[q + 1] = 0;
                if((i & (1 << q))){
                    if((j & (1 << q))){
                        cum0 += (q + 1);
                        sol[q + 1] = 1;
                    }
                    else{
                        cum1 += (q + 1);
                        sol[q + 1] = 2;
                    }
                }
                if(cum0 == a && cum1 == b){
                    bruh=true;
                    break;
                }
            }
            j = ((j - 1) & i);
            if(j == 0 || bruh) break;
        }
        if(bruh) break;
    }
    for(int i = 1; i <= n; i ++ ){
        if(sol[i] == 0){
            cout << 3 << " ";
        }
        else{
            cout << sol[i] << " ";
        }
    }
    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
3 2 2 1 3 

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

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
10

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 9

Group: 2

Verdict:

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

Test 10

Group: 2

Verdict:

input
95

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

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

Test 11

Group: 2

Verdict:

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

Test 12

Group: 2

Verdict: ACCEPTED

input
97

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 13

Group: 2

Verdict:

input
98

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

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

Test 14

Group: 2

Verdict:

input
99

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE