CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:kenechi
Submission time:2021-01-31 11:47:50 +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
#40.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s2details
#100.01 s2details
#110.01 s2details
#12ACCEPTED0.01 s2details
#130.01 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;
void solve() {
int n;
cin >> n;
// x - 1
// x
// x + 1
// 3 * x = n * (n + 1) // 2
// n * (n + 1) // 6
int tp = n * (n + 1);
if (tp % 6) {
cout << "IMPOSSIBLE";
return;
}
vector<int> v1, v2;
int sum = 0, val = tp / 6 - 1;
for (int i = 1; i <= n; i++) {
if (sum + i <= val)sum += i, v1.push_back(i);
else {
int need = val - sum;
int back = (!v1.empty() ? v1.back() : 0);
back += need;
if (back <= n) {
if (!v1.empty())
v1.pop_back();
v1.push_back(back);
break;
} else {
cout << "IMPOSSIBLE";
return;
}
}
}
val++;
sum = 0;
for (int i = 1; i <= n; i++) {
if (binary_search(v1.begin(), v1.end(), i))continue;
if (sum + i <= val)sum += i, v2.push_back(i);
else {
int need = val - sum;
int back = (!v2.empty() ? v2.back() : 0);
back += need;
if (back <= n and !binary_search(v1.begin(), v1.end(), back)) {
if (!v2.empty())
v2.pop_back();
v2.push_back(back);
break;
} else {
cout << "IMPOSSIBLE";
return;
}
}
}
for (int i = 1; i <= n; i++) {
if (binary_search(v1.begin(), v1.end(), i))cout << 1 << " ";
else if (binary_search(v2.begin(), v2.end(), i))cout << 2 << " ";
else cout << 3 << " ";
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
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:

input
6

correct output
1 3 2 2 1 3 

user output
IMPOSSIBLE

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

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

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

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
IMPOSSIBLE

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