Task: | Lista |
Sender: | Kuha |
Submission time: | 2020-09-05 20:11:17 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 21 |
#2 | ACCEPTED | 38 |
#3 | ACCEPTED | 41 |
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.01 s | 3 | details |
#19 | ACCEPTED | 0.01 s | 3 | details |
#20 | ACCEPTED | 0.01 s | 3 | details |
#21 | ACCEPTED | 0.01 s | 3 | details |
Code
#include <bits/stdc++.h>#define N (1<<18)#define ll long long#define ld long double#define M 1000000007LL#define INF 0x5ADFACE5#define LINF 0x51DEEFFEC7C0DECALL#define pii pair<int, int>#define pll pair<long long, long long>#define F first#define S secondusing namespace std;bitset<2000> p;vector<pii> ans;int e(pii x) {if (x.S == x.F) return x.F;return x.F + 1;}int main() {srand(time(0));cin.sync_with_stdio(false);cin.tie(0);for (int i = 2; i < 2000; i++) {p[i] = 1;for (int j = 2; j < i; j++) {if (i % j == 0) p[i] = 0;}}int n;cin>>n;while (n >= 2) {for (int i = n + 1; i < 2 * n; i++) {if (p[i] && p[i + 2]) {ans.push_back({i - n, n});n = i - n - 1;goto lol;}}ans.push_back({n, n});n--;lol:;}if (n) {ans.push_back({1, n});}int m = ans.size();int per[m];for (int i = 0; i < m; i++) per[i] = i;do {bool yay = true;for (int i = 1; i < m; i++) {if (!p[e(ans[per[i - 1]]) + ans[per[i]].F]) yay = false;}if (yay) {for (int i = 0; i < m; i++) {if (ans[per[i]].S == ans[per[i]].F) cout<<ans[per[i]].F<<" ";else {int a = ans[per[i]].F;int b = ans[per[i]].S;while (a < ans[per[i]].S) {cout<<a<<" "<<b<<" ";a += 2;b -= 2;}}}cout<<endl;return 0;}} while (next_permutation(per, per + m));cout<<":("<<endl;}
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 |
---|
1 4 3 2 5 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
3 4 1 2 5 6 |
user output |
---|
5 6 1 4 3 2 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
3 4 1 2 5 6 7 |
user output |
---|
1 4 7 6 5 2 3 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
7 6 5 2 1 4 3 8 |
user output |
---|
3 8 5 6 7 4 1 2 |
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: ACCEPTED
input |
---|
19 |
correct output |
---|
17 14 3 8 15 16 13 6 5 2 1 4 9... |
user output |
---|
1 10 19 12 17 14 15 16 13 18 1... |
Test 11
Group: 2, 3
Verdict: ACCEPTED
input |
---|
56 |
correct output |
---|
55 54 53 50 51 52 49 48 13 28 ... |
user output |
---|
3 56 5 54 7 52 9 50 11 48 13 4... Truncated |
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... Truncated |
Test 13
Group: 2, 3
Verdict: ACCEPTED
input |
---|
76 |
correct output |
---|
73 66 61 42 59 54 53 50 51 52 ... |
user output |
---|
25 76 27 74 29 72 31 70 33 68 ... Truncated |
Test 14
Group: 2, 3
Verdict: ACCEPTED
input |
---|
90 |
correct output |
---|
87 86 11 18 29 44 45 16 55 58 ... |
user output |
---|
11 90 13 88 15 86 17 84 19 82 ... Truncated |
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... Truncated |
Test 16
Group: 3
Verdict: ACCEPTED
input |
---|
154 |
correct output |
---|
151 6 5 92 137 134 149 84 143 ... |
user output |
---|
25 154 27 152 29 150 31 148 33... Truncated |
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 ... Truncated |
Test 18
Group: 3
Verdict: ACCEPTED
input |
---|
629 |
correct output |
---|
627 404 227 146 83 150 77 74 3... |
user output |
---|
1 4 3 2 5 12 629 14 627 16 625... Truncated |
Test 19
Group: 3
Verdict: ACCEPTED
input |
---|
833 |
correct output |
---|
829 828 793 574 523 516 515 51... |
user output |
---|
1 4 3 2 5 24 833 26 831 28 829... Truncated |
Test 20
Group: 3
Verdict: ACCEPTED
input |
---|
885 |
correct output |
---|
883 724 723 878 881 726 721 71... |
user output |
---|
1 4 133 6 131 8 129 10 127 12 ... Truncated |
Test 21
Group: 3
Verdict: ACCEPTED
input |
---|
1000 |
correct output |
---|
997 996 737 884 995 492 991 20... |
user output |
---|
19 1000 21 998 23 996 25 994 2... Truncated |