CSES - Datatähti Open 2021

CSES - Datatähti Open 2021 - Results

Submission details
Task:	Split in Three
Sender:	vishesh312
Submission time:	2021-01-30 18:00:57 +0200
Language:	C++ (C++17)
Status:	READY
Result:	22

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	RUNTIME ERROR	0

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.02 s	1, 2	details
#9	RUNTIME ERROR	0.39 s	2	details
#10	RUNTIME ERROR	0.39 s	2	details
#11	RUNTIME ERROR	0.39 s	2	details
#12	RUNTIME ERROR	0.38 s	2	details
#13	RUNTIME ERROR	0.40 s	2	details
#14	RUNTIME ERROR	0.37 s	2	details
#15	RUNTIME ERROR	0.37 s	2	details

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<bitset<105>> ans(3);
bool found = false;

void rec(vector<bitset<105>> v, int x, int col) {
    v[col] |= (1 << x);
    bitset<105> used = v[0] | v[1] | v[2];
    if ((int)used.count() == n) {
        vector<int> s(3);
        for (int i = 1; i <= n; ++i) {
            auto xa = v[0];
            xa &= (1<<i);
            if (xa.count()) s[0] += i;
            xa = v[1];
            xa &= (1<<i);
            if (xa.count()) s[1] += i;
            xa = v[2];
            xa &= (1<<i);
            if (xa.count()) s[2] += i;
        }
        if (s[0] == s[1]-1 and s[2] == s[1]+1) {
            ans = v;
            found = true;
        }
        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);
    for (int i = 0; i < 3; ++i) {
        rec(vector<bitset<105>>(3), 1, i);
        if (found) {
           for (int i = 1; i <= n; ++i) {
                auto x = ans[0];
                x &= (1<<i);
                if (x.count()) cout << "1 ";
                x = ans[1];
                x &= (1<<i);
                if (x.count()) cout << "2 ";
                x = ans[2];
                x &= (1<<i);
                if (x.count()) cout << "3 ";
            }
            cout << '\n';
            return;
        }
    }
    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` 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
`1 3 1 3 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
`1 3 2 2 1 3` 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 3 3 1 2 1 2 3` 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 3 3 3 1 2 3 1 2` 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: RUNTIME ERROR

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

Test 10

Group: 2

Verdict: RUNTIME ERROR

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

Test 11

Group: 2

Verdict: RUNTIME ERROR

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

Test 12

Group: 2

Verdict: RUNTIME ERROR

input
`97` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 13

Group: 2

Verdict: RUNTIME ERROR

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

Test 14

Group: 2

Verdict: RUNTIME ERROR

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

Test 15

Group: 2

Verdict: RUNTIME ERROR

input
`100` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

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