CSES - Putka Open 2020 – 1/5

CSES - Putka Open 2020 – 1/5 - Results

Submission details
Task:	Lista
Sender:	rasastusni
Submission time:	2020-09-06 20:37:13 +0300
Language:	C++17
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.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	TIME LIMIT EXCEEDED	--	3	details
#17	ACCEPTED	0.02 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	ACCEPTED	0.01 s	3	details

Code

#include <iostream>

using namespace std;

const int MAX_N = 1000;

int numbers[MAX_N] = {0};
int can_use[MAX_N] = {0};
int prime_cache[2*MAX_N] = {0};

int target = 0;

int is_prime(int x) {
	if (x == 0 || x == 1) return 0;
	if (x == 2 || x == 3) return 1;
	if (prime_cache[x] > 0) {
		return prime_cache[x] - 1;
	}
	int y = 2;
	while (y*y <= x) {
		if (x%y == 0) {
			prime_cache[x] = 1;
			return 0;
		}
		++y;
	}
	prime_cache[x] = 2;
	return 1;
}

int solve(int depth)
{
	if (depth == target) {
		return 1;
	}
	for (int i = 0; i < target; ++i) {
		if (can_use[i]) {
			if (depth == 0 || is_prime(i + 1 + numbers[depth - 1])) {
				can_use[i] = 0;
				numbers[depth] = i + 1;
				int succ = solve(depth + 1);
				if (succ) return 1;
				numbers[depth] = 0;
				can_use[i] = 1;
			}
		}
	}
	return 0;
}

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		can_use[i] = 1;
	}
	target = n;
	solve(0);
	for (int i = 0; i < n - 1; ++i) {
		cout << numbers[i] << " ";
	}
	cout << numbers[n - 1] << endl;
}

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 4 7 6 5 8` 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 3 4 7 6 5 8 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 2 3 4 7 6 5 8 9 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 2 3 4 7 6 5 8 9 10 13 16 15 ...` 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 4 7 6 5 8 9 10 13 16 15 ...` 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 2 3 4 7 6 5 8 9 10 13 16 15 ...` 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 2 3 4 7 6 5 8 9 10 13 16 15 ...` 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 2 3 4 7 6 5 8 9 10 13 16 15 ...` 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 2 3 4 7 6 5 8 9 10 13 16 15 ...` view save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`154` view save

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

user output
(empty)

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 2 3 4 7 6 5 8 9 10 13 16 15 ...` 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: TIME LIMIT EXCEEDED

input
`833` view save

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

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`885` view save

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

user output
(empty)

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 4 7 6 5 8 9 10 13 16 15 ...` view save

Putka Open 2020 – 1/5

Lista

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 (rasastusni)