CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:tutis
Submission time:2021-01-30 18:52:24 +0200
Language:C++11
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED78
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.01 s1, 2details
#9ACCEPTED0.01 s2details
#10ACCEPTED0.01 s2details
#11ACCEPTED0.01 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.01 s2details

Code

/*input
8
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename X>
using ordered_map = tree<T, X, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename X>
using fast_map = cc_hash_table<T, X>;
//using ull = __uint128_t;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
mt19937_64 rng(123);
const ll mod = 1000000007;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	if (n % 3 == 1)
	{
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	if (n % 6 == 3)
	{
		for (int i = 0; i < n; i++)
		{
			int x = i % 6;
			if (x >= 3)
				x = 5 - x;
			cout << x + 1 << " ";
		}
		return 0;
	}
	if (n % 6 == 5)
	{
		cout << "3 2 2 1 3";
		for (int i = 5; i < n; i++)
		{
			int x = (i - 5) % 6;
			if (x >= 3)
				x = 5 - x;
			cout << " " << x + 1;
		}
		return 0;
	}
	if (n % 6 == 0)
	{
		cout << "2 1 3 1 3 2";
		for (int i = 6; i < n; i++)
		{
			int x = (i - 6) % 6;
			if (x >= 3)
				x = 5 - x;
			cout << " " << x + 1;
		}
		return 0;
	}
	if (n % 6 == 2)
	{
		cout << "2 3";
		for (int i = 2; i < n; i++)
		{
			int x = (i - 2) % 6;
			if (x >= 3)
				x = 5 - x;
			cout << " " << x + 1;
		}
		return 0;
	}
	//1 2 3 4 5
	//3 2 2 1 3

	//1 2 3 4 5
	//3 2 2 1 3
	//1 2 3 4 5 6
	//6 7 8
	//2 1 3 1 3 2
}

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

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

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

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

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

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

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

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE