CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:NewResolution
Submission time:2021-01-30 06:25:49 +0200
Language:C++17
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED78
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1, 2details
#2ACCEPTED0.03 s1, 2details
#3ACCEPTED0.04 s1, 2details
#4ACCEPTED0.04 s1, 2details
#5ACCEPTED0.05 s1, 2details
#6ACCEPTED0.06 s1, 2details
#7ACCEPTED0.06 s1, 2details
#8ACCEPTED0.07 s1, 2details
#9ACCEPTED0.26 s2details
#10ACCEPTED0.48 s2details
#11ACCEPTED0.48 s2details
#12ACCEPTED0.48 s2details
#13ACCEPTED0.49 s2details
#14ACCEPTED0.49 s2details
#15ACCEPTED0.49 s2details

Code

#include <iostream>
#define MAXM 1750

using namespace std;

char dp[101][MAXM][MAXM];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int m = n * (n + 1) / 2;
    dp[0][0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < MAXM; j++) {
            for (int k = 0; k < MAXM; k++) {
                if (dp[i - 1][j][k]) dp[i][j][k] = 3;
                else if (j >= i && dp[i - 1][j - i][k]) dp[i][j][k] = 1;
                else if (k >= i && dp[i - 1][j][k - i]) dp[i][j][k] = 2;
            }
        }
    }
    if (m % 3 != 0 || !dp[n][m / 3 - 1][m / 3]) cout << "IMPOSSIBLE";
    else {
        int j = m / 3 - 1, k = m / 3;
        int ans[n];
        for (int i = n; i > 0; i--) {
            ans[i - 1] = dp[i][j][k];
            if (ans[i - 1] == 1) j -= i;
            else if (ans[i - 1] == 2) k -= i;
        }
        for (int i = 0; i < n; i++) cout << ans[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: ACCEPTED

input
42

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE