CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:vishesh312
Submission time:2021-01-30 17:43:30 +0200
Language:C++ (C++17)
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.03 s1, 2details
#90.05 s2details
#100.41 s2details
#110.01 s2details
#12ACCEPTED0.01 s2details
#130.01 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details

Code

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef long long ll;
const int mod = 1e9+7;
int n, sum;
vector<int> ans(3, 1e9);

void rec(vector<int> v, int x, int col) {
    v[col] |= (1 << x);
    int used = v[0] | v[1] | v[2];
    if (used == ((1<<(n+2)) - 2)) {
        vector<int> s(3);
        for (int i = 1; i <= n; ++i) {
            if (v[0]&(1<<i)) s[0] += i;
            if (v[1]&(1<<i)) s[1] += i;
            if (v[2]&(1<<i)) s[2] += i;
        }
        if (s[0] == s[1]-1 and s[2] == s[1]+1) {
            ans = v;
        }
        return;
    }
    for (int i = 0; i < 3; ++i) {
        rec(v, x+1, i);
    }
}


void solve(int tc) {
    cin >> n;
    sum = (n * (n + 1)) / 2;
    vector<int> col(n+1);
    rec(vector<int>(3), 1, 0);
    rec(vector<int>(3), 1, 1);
    rec(vector<int>(3), 1, 2);
    if (ans[0] != 1e9) {
        for (int i = 1; i <= n; ++i) {
            if (ans[0]&(1<<i)) cout << "1 ";
            if (ans[1]&(1<<i)) cout << "2 ";
            if (ans[2]&(1<<i)) cout << "3 ";
        }
        cout << '\n';
    } else {
        cout << "IMPOSSIBLE\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(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 3 3 1 2 

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
6

correct output
1 3 2 2 1 3 

user output
3 3 2 2 3 1 

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

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
3 3 3 3 1 3 2 2 1 

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

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

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE