CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:_martynas
Submission time:2021-01-31 14:33:00 +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

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100;

int t;
int n;

void solve()
{
    scanf("%d", &n);
    if(n % 3 == 1)
    {
        puts("IMPOSSIBLE");
    }
    else
    {
        int Groups[MAX_N];
        int Index[3] = {1, 2, 3}; // smallest, middle, highest
        if(n % 3 == 0)
        {
            Groups[0] = 1;
            Groups[1] = 2;
            Groups[2] = 3;
            for(int i = 3; i < n; i+=3)
            {
                Groups[i] = Index[2];
                Groups[i+1] = Index[0];
                Groups[i+2] = Index[1];
                swap(Index[1], Index[2]);
            }
        }
        else // n % 3 == 2
        {
            Groups[2] = 1;
            Groups[3] = 2;
            Groups[4] = 3;
            for(int i = 5; i < n; i+=3)
            {
                Groups[i] = Index[2];
                Groups[i+1] = Index[0];
                Groups[i+2] = Index[1];
                swap(Index[1], Index[2]);
            }
            Groups[0] = Index[0];
            Groups[1] = Index[1];
            swap(Index[1], Index[2]);
        }
        for(int i = 0; i < n; i++)
        {
            printf("%d ", Index[Groups[i]-1]);
        }
    }
}

int main()
{
    t = 1;
    //scanf("%d", &t);
    while(t--)
    {
        solve();
    }
    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
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 3 1 2 3 3 1 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 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 2 1 3 3 1 2 2 1 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
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 3 1 2 3 3 1 2 2 1 3 3 1 2 2 ...

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