CSES - Putka Open 2020 – 1/5

CSES - Putka Open 2020 – 1/5 - Results

Submission details
Task:	Lista
Sender:	Guuber
Submission time:	2020-09-05 10:20:27 +0300
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	38
#3	ACCEPTED	41

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	2, 3	details
#11	ACCEPTED	0.01 s	2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	ACCEPTED	0.01 s	2, 3	details
#14	ACCEPTED	0.01 s	2, 3	details
#15	ACCEPTED	0.01 s	2, 3	details
#16	ACCEPTED	0.01 s	3	details
#17	ACCEPTED	0.01 s	3	details
#18	ACCEPTED	0.02 s	3	details
#19	ACCEPTED	0.51 s	3	details
#20	ACCEPTED	0.01 s	3	details
#21	ACCEPTED	0.01 s	3	details

Compiler report

input/code.cpp: In function 'void haku(int, std::vector<int>)':
input/code.cpp:23:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(path.size() == n){
     ~~~~~~~~~~~~^~~~

Code

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

vector<int> graph[101010];
int prime[1010101];
int degree[101010];
int z[101010];
int eka[101010];
int toka[101010];
int kaytetty[101010];
vector<int> polku;


int n;
bool bo;
void haku(int node, vector<int> path){
	//cout << path.size() << "\n";
	if(z[node]) return;
	if(bo) return;
	z[node] = 1;
	path.push_back(node);
	//cout << path.size() << " " << n << "\n";
	if(path.size() == n){
		//	cout << "LOIJOIJOIJOIJOIJOJOJOIJO\n";
		polku = path;
		bo = true;
		return;
	}
	degree[node]--;
	vector<pair<int,int>> seuri;
	for(auto seur : graph[node]){
		if(bo) return;
		//		haku(seur, path);
		seuri.push_back({degree[seur], seur});
	}
	sort(seuri.begin(), seuri.end());

	for(auto u : seuri){
		if(u.first > 1){
			if(bo) return;
			degree[u.second]--;
			haku(u.second, path);
			degree[u.second]++;
		}
	}
	degree[node]++;
	z[node] = 0;
}

int main(){
//	cin >> n;

	cin >> n;
	for(int i = 2; i < 10101; i++){
		if(prime[i]) continue;
		prime[i] = i;
		for(int u = i; u <= 10101; u += i){
			prime[u] = i;
		}
	}

	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(prime[i+j] == i+j){
				degree[i]++;
				degree[j]++;
				graph[i].push_back(j);
				graph[j].push_back(i);
			}
		}
	}


	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;
			}
		}
	}

	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 ss = 1; ss <= 2000; ss++){
		int e = ss;
		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";
	}
	if(!bo){
		haku(1,{});
		for(auto u : polku) cout << u << " ";
		cout << "\n";
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2` view save

correct output
`1 2` view save

user output
`1 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3` view save

correct output
`1 2 3` view save

user output
`1 2 3` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4` view save

correct output
`1 2 3 4` view save

user output
`1 4 3 2` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5` view save

correct output
`3 4 1 2 5` view save

user output
`3 4 1 2 5` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`6` view save

correct output
`3 4 1 2 5 6` view save

user output
`1 6 5 2 3 4` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`7` view save

correct output
`3 4 1 2 5 6 7` view save

user output
`1 2 3 4 7 6 5` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8` view save

correct output
`7 6 5 2 1 4 3 8` view save

user output
`1 2 3 8 5 6 7 4` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9` view save

correct output
`7 6 5 2 1 4 3 8 9` view save

user output
`1 2 9 4 7 6 5 8 3` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10` view save

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

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

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`19` view save

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

user output
`1 16 7 6 17 14 9 8 11 18 19 12...` view save

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`56` view save

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

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

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`70` view save

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

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

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
`76` view save

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

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

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
`90` view save

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

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

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
`100` view save

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

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

Test 16

Group: 3

Verdict: ACCEPTED

input
`154` view save

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

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

Test 17

Group: 3

Verdict: ACCEPTED

input
`430` view save

correct output
`427 426 371 372 367 376 375 35...` view save

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

Test 18

Group: 3

Verdict: ACCEPTED

input
`629` view save

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

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

Test 19

Group: 3

Verdict: ACCEPTED

input
`833` view save

correct output
`829 828 793 574 523 516 515 51...` view save

user output
`1 646 763 684 593 588 709 762 ...` Truncated

Test 20

Group: 3

Verdict: ACCEPTED

input
`885` view save

correct output
`883 724 723 878 881 726 721 71...` view save

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

Test 21

Group: 3

Verdict: ACCEPTED

input
`1000` view save

correct output
`997 996 737 884 995 492 991 20...` view save

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

Putka Open 2020 – 1/5

Lista

Compiler report

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

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (Guuber)