CSES - Putka Open 2020 – 1/5 - Results
Submission details
Task:Lista
Sender:Guuber
Submission time:2020-09-04 20:26:55 +0300
Language:C++11
Status:READY
Result:21
Feedback
groupverdictscore
#1ACCEPTED21
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#100.03 s2, 3details
#11ACCEPTED0.02 s2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.02 s3details
#17ACCEPTED0.02 s3details
#18ACCEPTED0.03 s3details
#190.41 s3details
#20ACCEPTED0.02 s3details
#21ACCEPTED0.02 s3details

Code

#include<bits/stdc++.h>
using namespace std;


int prime[1010101];
int eka[1010101];
int toka[1010101];
int kaytetty[101010];
int main(){
	int n;
	cin >> n;

	for(int i = 2; i < 1010101; i++){
		if(prime[i]) continue;
		prime[i] = i;
		for(int u = i; u <= 1010101; u += i){
			prime[u] = i;
		}
	}
	
/*	int counter2 = 0;
	for(int i = 1; i <= 1000; i++){
		for(int x = 1; x <= i; x++){
			int counter = 0;
			for(int j = 1; j <= i; j++){
				counter2++;
				if(prime[x+j] == x+j) counter++;
			}
			if(counter < 2) cout << i << " " << x << "\n";
		}
	}
	cout << counter2 << "\n";*/
//	for(int i = 0; i < 100; i++) cout << i << ": " << prime[i] << "\n";
	int luku = n;
	while(luku != 0){
		for(int i = 1; i <= n; i++){
			if(prime[i+luku] == i+luku){
				for(int j = 0; j <= luku; j++){
					eka[luku-j] = i + j;
				}
				luku = i-1;
				break;
			}
		}
	}

	for(int i = 1; i <= n; i++){
//		cout << i << " ";
	}
//	cout << "\n";
	for(int i = 1; i <= n; i++){
//		cout << eka[i] << " ";
	}
//	cout << "\n";

	luku = n;
	while(luku != 0){
		for(int i = luku; i >= 1; i--){
			if(prime[i + luku] == i + luku){
				for(int j = 0; j <= luku; j++){
					toka[luku-j] = i + j;
				}
				luku = i-1;
				break;
			}
		}
	}
	for(int i = 1; i <= n; i++){
//		cout << i << " ";
	}
//	cout << "\n";
	for(int i = 1; i <= n; i++){
//		cout << toka[i] << " ";
	}
//	cout << "\n";

	if(n == 1){
		cout << 1 << "\n";
	}else if(n == 2){
		cout << 1 << " " << 2 << "\n";
	}else if(n == 3){
		cout << 1 << " " << 2 << " " << 3 << "\n";
	}else if(n == 4){
		cout << 1 << " " << 4 << " " << 3 << " " << 2 << "\n";
	}else if(n == 5){
		cout << 5 << " " << 2 << " " << 1 << " " << 4 << " " << 3 << "\n";
	}else{
		for(int ss = 1; ss <= 2000; ss++){
			int e = ss;
			bool bo = true;
			vector<int> ve = {};
			for(int i = 0; i < n; i++){
				ve.push_back(e);
				if(kaytetty[e]) bo = false;
				kaytetty[e] = 1;
				if(!kaytetty[eka[e]]){
					e = eka[e];
				}else if(!kaytetty[eka[e]]){
					e = toka[e];
				}else{
					for(int i = 1; i <= n; i++){
						if(!kaytetty[i] && prime[i+e] == i+e){
							e = i;
							break;
						}
					}
				}
			}
			for(int i = 0; i <= 2000; i++){
				kaytetty[i] = 0;
			}
			if(bo){ for(auto u : ve) cout << u << " "; cout << "\n"; break;} 
			//cout << "\n\n";
			//cout << ve.size() << " SIZE\n";
		}
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
2

correct output
1 2 

user output
1 2

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
3

correct output
1 2 3 

user output
1 2 3

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
4

correct output
1 2 3 4 

user output
1 4 3 2

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
5

correct output
3 4 1 2 5 

user output
5 2 1 4 3

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
6

correct output
3 4 1 2 5 6 

user output
1 6 5 2 3 4 

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
7

correct output
3 4 1 2 5 6 7 

user output
1 2 3 4 7 6 5 

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
8

correct output
7 6 5 2 1 4 3 8 

user output
1 2 3 8 5 6 7 4 

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
9

correct output
7 6 5 2 1 4 3 8 9 

user output
1 2 9 4 7 6 5 8 3 

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
10

correct output
7 6 5 2 1 4 3 8 9 10 

user output
1 10 3 8 5 6 7 4 9 2 

Test 10

Group: 2, 3

Verdict:

input
19

correct output
17 14 3 8 15 16 13 6 5 2 1 4 9...

user output
(empty)

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
56

correct output
55 54 53 50 51 52 49 48 13 28 ...

user output
1 2 3 56 5 54 7 52 9 50 11 48 ...

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
70

correct output
67 4 1 2 9 32 35 38 65 66 61 4...

user output
1 70 3 68 5 66 7 64 9 62 11 60...

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
76

correct output
73 66 61 42 59 54 53 50 51 52 ...

user output
15 64 3 76 7 72 1 2 5 74 9 70 ...

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
90

correct output
87 86 11 18 29 44 45 16 55 58 ...

user output
15 82 1 6 5 2 3 4 7 90 11 86 1...

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
100

correct output
97 96 95 78 25 82 81 56 71 68 ...

user output
1 100 3 98 5 96 7 94 9 92 11 9...

Test 16

Group: 3

Verdict: ACCEPTED

input
154

correct output
151 6 5 92 137 134 149 84 143 ...

user output
37 120 7 150 1 2 3 154 9 148 1...

Test 17

Group: 3

Verdict: ACCEPTED

input
430

correct output
427 426 371 372 367 376 375 35...

user output
1 430 3 428 5 426 7 424 9 422 ...

Test 18

Group: 3

Verdict: ACCEPTED

input
629

correct output
627 404 227 146 83 150 77 74 3...

user output
79 552 5 626 15 616 1 2 629 12...

Test 19

Group: 3

Verdict:

input
833

correct output
829 828 793 574 523 516 515 51...

user output
(empty)

Test 20

Group: 3

Verdict: ACCEPTED

input
885

correct output
883 724 723 878 881 726 721 71...

user output
1 2 885 22 865 12 875 6 881 26...

Test 21

Group: 3

Verdict: ACCEPTED

input
1000

correct output
997 996 737 884 995 492 991 20...

user output
1 2 3 8 5 6 7 4 9 1000 13 996 ...