CSES - Datatähti Open 2021

Submission details
Task:	Split in Three
Sender:	ajpiano
Submission time:	2021-01-30 15:29:27 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	ACCEPTED	78

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2	details
#2	ACCEPTED	0.01 s	1, 2	details
#3	ACCEPTED	0.01 s	1, 2	details
#4	ACCEPTED	0.01 s	1, 2	details
#5	ACCEPTED	0.01 s	1, 2	details
#6	ACCEPTED	0.01 s	1, 2	details
#7	ACCEPTED	0.01 s	1, 2	details
#8	ACCEPTED	0.01 s	1, 2	details
#9	ACCEPTED	0.01 s	2	details
#10	ACCEPTED	0.01 s	2	details
#11	ACCEPTED	0.01 s	2	details
#12	ACCEPTED	0.01 s	2	details
#13	ACCEPTED	0.01 s	2	details
#14	ACCEPTED	0.01 s	2	details
#15	ACCEPTED	0.01 s	2	details

Code

#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second

typedef long long ll;
typedef pair<int,int> pi;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    if(n%3 == 1){
        cout << "IMPOSSIBLE\n";
        return 0;
    }
    //find goal
    int goal = (n*(n+1))/6;
    //create set
    vector<int> nums(n+1);
    //find number of moves
    int mv1 = (goal-1)/(n+1); int want1 = (goal-1)%(n+1);
    int mv2 = (goal)/(n+1); int want2 = (goal)%(n+1);
    nums[want1] = 1; nums[want2] = 2;
    int ptr = 1;
    for(int i = 0; i < mv1; ptr++){
        if(nums[ptr] == 0 && nums[n+1-ptr] == 0){
            nums[ptr] = 1; nums[n+1-ptr] = 1; i++;
        }
    }
    for(int i = 0; i < mv2; ptr++){
        if(nums[ptr] == 0 && nums[n+1-ptr] == 0){
            nums[ptr] = 2; nums[n+1-ptr] = 2; i++;
        }
    }
    for(int i = 1; i <= n; i++){
        if(nums[i] == 0) cout << 3 << " ";
        else cout << nums[i] << " ";
    }
    cout << "\n";
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`3` view save

correct output
`1 2 3` view save

user output
`1 2 3` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`4` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`5` view save

correct output
`1 3 1 3 2` view save

user output
`3 3 3 1 2` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`6` view save

correct output
`1 3 2 2 1 3` view save

user output
`3 2 3 3 2 1` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`7` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`8` view save

correct output
`2 3 1 2 3 3 2 1` view save

user output
`1 1 2 2 2 3 3 1` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`9` view save

correct output
`1 2 3 1 2 3 3 2 1` view save

user output
`1 2 3 1 2 3 3 2 1` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`10` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`42` view save

correct output
`1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ...` view save

user output
`3 1 1 1 1 1 1 2 2 2 2 2 2 2 3 ...` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`95` view save

correct output
`1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 11

Group: 2

Verdict: ACCEPTED

input
`96` view save

correct output
`1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ...` view save

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` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 14

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 15

Group: 2

Verdict: ACCEPTED

input
`100` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Datatähti Open 2021

Split in Three

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (ajpiano)