| Task: | Lista |
| Sender: | Guuber |
| Submission time: | 2020-09-04 21:50:56 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #9 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #10 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #13 | WRONG ANSWER | 0.04 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #21 | WRONG ANSWER | 0.04 s | 3 | details |
Compiler report
input/code.cpp: In function 'void haku(int, std::vector<int>)':
input/code.cpp:18: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 z[101010];
vector<int> polku;
int n;
bool bo;
void haku(int node, vector<int> path){
if(z[node]) return;
if(bo) return;
z[node] = 1;
path.push_back(node);
if(path.size() == n){
polku = path;
bo = true;
return;
}
for(auto seur : graph[node]){
if(bo) return;
haku(seur, path);
}
z[node] = 0;
}
int main(){
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;
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(prime[i+j] == i+j){
graph[i].push_back(j);
graph[j].push_back(i);
}
}
}
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{
haku(1,{});
for(auto u : polku) cout << u << "Â ";
cout << "\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: WRONG ANSWER
| input |
|---|
| 6 |
| correct output |
|---|
| 3 4 1 2 5 6 |
| user output |
|---|
| 1Â 4Â 3Â 2Â 5Â 6Â |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| input |
|---|
| 8 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 9 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 10 |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 19 |
| correct output |
|---|
| 17 14 3 8 15 16 13 6 5 2 1 4 9... |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... |
Test 11
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 56 |
| correct output |
|---|
| 55 54 53 50 51 52 49 48 13 28 ... |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... Truncated |
Test 12
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 70 |
| correct output |
|---|
| 67 4 1 2 9 32 35 38 65 66 61 4... |
| user output |
|---|
| (empty) |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 76 |
| correct output |
|---|
| 73 66 61 42 59 54 53 50 51 52 ... |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... Truncated |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 90 |
| correct output |
|---|
| 87 86 11 18 29 44 45 16 55 58 ... |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... Truncated |
Test 15
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 |
| correct output |
|---|
| 97 96 95 78 25 82 81 56 71 68 ... |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 154 |
| correct output |
|---|
| 151 6 5 92 137 134 149 84 143 ... |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 430 |
| correct output |
|---|
| 427 426 371 372 367 376 375 35... |
| user output |
|---|
| (empty) |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 629 |
| correct output |
|---|
| 627 404 227 146 83 150 77 74 3... |
| user output |
|---|
| (empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 833 |
| correct output |
|---|
| 829 828 793 574 523 516 515 51... |
| user output |
|---|
| (empty) |
Test 20
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 885 |
| correct output |
|---|
| 883 724 723 878 881 726 721 71... |
| user output |
|---|
| (empty) |
Test 21
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 |
| correct output |
|---|
| 997 996 737 884 995 492 991 20... |
| user output |
|---|
| 1Â 2Â 3Â 4Â 7Â 6Â 5Â 8Â 9Â 10Â... Truncated |
