CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:doowey
Submission time:2021-01-31 14:01:14 +0200
Language: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
#9ACCEPTED0.01 s2details
#10ACCEPTED0.30 s2details
#11ACCEPTED0.32 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.35 s2details
#14--2details
#15ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;

const int N = 1650;
const int M = 100;
int dp[N][N];
int sol[M];


int main(){
    int n;
    cin >> n;
    if(n % 3 == 1){
        cout << "IMPOSSIBLE\n";
        return 0;
    }
    int A = (n * (n + 1) / 2 - 3) / 3;
    int A1 = A + 1;
    dp[0][0]=-1;
    int i1, i2;
    for(int i = 1; i <= n; i ++ ){
        i1 = min(A, i * (i - 1) / 2);
        i2 = min(A1, i * (i - 1) / 2);
        for(int p = i1 ; p >= 0 ; p -- ){
            for(int q = i2; q >= 0; q -- ){
                if(dp[p][q] != 0){
                    if(p + i <= A && dp[p + i][q] == 0){
                        dp[p + i][q] = i;
                    }
                    if(q + i <= A1 && dp[p][q + i] == 0){
                        dp[p][q + i] = -i;
                    }
                }
            }
        }
    }
    int ii = A;
    int jj = A1;
    if(dp[ii][jj] == 0){
        cout << "IMPOSSIBLE\n";
        return 0;
    }
    int num;
    while(ii > 0 || jj > 0){
        num = dp[ii][jj];
        if(num > 0){
            sol[num]=1;
            ii -= num;
        }
        else{
            sol[-num]=2;
            jj -= -num;
        }
    }
    for(int i = 1; i <= n; i ++ ){
        if(sol[i] == 0) sol[i]=3;
        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 1 1 2 3 1 2 3 

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

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

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

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

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

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
(empty)

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE