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:08:04 +0300
Language:	C++11
Status:	READY
Result:	59

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	38
#3	TIME LIMIT EXCEEDED	0

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.02 s	2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	ACCEPTED	0.01 s	2, 3	details
#14	ACCEPTED	0.45 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.01 s	3	details
#17	ACCEPTED	0.02 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	ACCEPTED	0.04 s	3	details
#20	ACCEPTED	0.04 s	3	details
#21	ACCEPTED	0.05 s	3	details

Compiler report

input/code.cpp: In function 'void haku(int, std::vector<int>)':
input/code.cpp:20: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];
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;
	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);
			}
		}
	}

	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 2 3 4` 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
`1 4 3 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 4 3 2 5 6` 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 6 7 4 3 8 5 2 9` 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 6 5 8 3 2 9 4 7 10` 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 40 43 46 37 42 31 48 41 32 3...` view save

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 60 53 54 55 24 59 68 63 64 6...` view save

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
`1 72 59 48 49 54 73 76 61 70 6...` view save

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
`1 72 79 84 73 76 75 74 83 80 7...` view save

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 72 77 90 89 48 61 76 73 78 7...` view save

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
`1 108 115 114 113 110 153 116 ...` view save

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 378 373 384 389 422 375 376 ...` view save

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`629` view save

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

user output
(empty)

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 ...` view save

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 882 661 832 831 662 861 860 ...` view save

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 970 979 972 977 974 975 976 ...` view save

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)