CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:fishy15
Submission time:2021-01-31 00:53:23 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#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
#70.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s2details
#10ACCEPTED0.01 s2details
#11ACCEPTED0.01 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details

Code

#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
// change if necessary
#define MAXN 1000000
using namespace std;
int n;
int sum(const vector<int> &v) {
int s = 0;
for (int x : v) s += x;
return s;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
if (n % 3 == 0) {
vector<vector<int>> v(3);
int cur = 1;
for (int i = 0; i < n; i++) {
if (i % 3 == 0) cur--;
v[cur % 3].push_back(i + 1);
cur++;
}
if (sum(v[0]) > sum(v[1])) swap(v[0], v[1]);
if (sum(v[1]) > sum(v[2])) swap(v[1], v[2]);
if (sum(v[0]) > sum(v[1])) swap(v[0], v[1]);
vector<int> ans(n + 1);
for (int x : v[0]) ans[x] = 1;
for (int x : v[1]) ans[x] = 2;
for (int x : v[2]) ans[x] = 3;
for (int i = 1; i <= n; i++) {
cout << ans[i] << ' ';
}
cout << '\n';
} else if (n % 3 == 1) {
cout << "IMPOSSIBLE\n";
} else {
vector<vector<int>> v = {{1, 3}, {5}, {2, 4}};
int cur = 3;
for (int i = 5; i < n; i++) {
if ((i - 5) % 3 == 0) cur--;
v[cur % 3].push_back(i + 1);
cur++;
}
if (sum(v[0]) > sum(v[1])) swap(v[0], v[1]);
if (sum(v[1]) > sum(v[2])) swap(v[1], v[2]);
if (sum(v[0]) > sum(v[1])) swap(v[0], v[1]);
vector<int> ans(n + 1);
for (int x : v[0]) ans[x] = 1;
for (int x : v[1]) ans[x] = 2;
for (int x : v[2]) ans[x] = 3;
for (int i = 1; i <= n; i++) {
cout << ans[i] << ' ';
}
cout << '\n';
}
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
1 3 1 3 2 

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

Test 7

Group: 1, 2

Verdict:

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
1 2 3 3 1 2 2 3 1 

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

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

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

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE