#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D)
{
if(D==3){
vector<int> ans(N);
iota(ans.begin(),ans.end(),0);
return ans;
}
if(D==2){
deque<int> path;
for(int i=0;i<3;i++)path.emplace_back(i);
for(int i=1;i<3;i++){
if(!are_connected({i-1},{i})){
swap(path[0],path[i-1]);
swap(path[2],path[i]);
break;
}
}
for(int i=3;i<N;i++){
if(are_connected({i},{path[0]})){
path.emplace_front(i);
}else{
path.emplace_back(i);
}
}
vector<int> ans;
for(auto x:path)ans.emplace_back(x);
return ans;
}
vector<int> path[2];
for(int i=0;i<2;i++)path[i].emplace_back(i);
for(int i=2;i<N;i++){
if(are_connected({i},{path[0].back()})){
path[0].emplace_back(i);
continue;
}
if(are_connected({i},{path[1].back()})){
path[1].emplace_back(i);
continue;
}
while(!path[1].empty()){
path[0].emplace_back(path[1].back());
path[1].pop_back();
}
path[1].emplace_back(i);
}
if(path[0].size()<path[1].size())swap(path[0],path[1]);
return path[0];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
344 KB |
Output is correct |
| 2 |
Correct |
5 ms |
344 KB |
Output is correct |
| 3 |
Correct |
4 ms |
344 KB |
Output is correct |
| 4 |
Correct |
4 ms |
344 KB |
Output is correct |
| 5 |
Correct |
4 ms |
344 KB |
Output is correct |
| 6 |
Correct |
5 ms |
344 KB |
Output is correct |
| 7 |
Correct |
4 ms |
344 KB |
Output is correct |
| 8 |
Correct |
4 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
4 ms |
344 KB |
Output is correct |
| 11 |
Correct |
5 ms |
440 KB |
Output is correct |
| 12 |
Correct |
5 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
344 KB |
Output is correct |
| 2 |
Correct |
4 ms |
344 KB |
Output is correct |
| 3 |
Correct |
4 ms |
344 KB |
Output is correct |
| 4 |
Correct |
4 ms |
344 KB |
Output is correct |
| 5 |
Correct |
4 ms |
344 KB |
Output is correct |
| 6 |
Correct |
6 ms |
344 KB |
Output is correct |
| 7 |
Correct |
5 ms |
344 KB |
Output is correct |
| 8 |
Correct |
4 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
600 KB |
Output is correct |
| 10 |
Correct |
4 ms |
344 KB |
Output is correct |
| 11 |
Correct |
5 ms |
344 KB |
Output is correct |
| 12 |
Correct |
6 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
344 KB |
Output is correct |
| 14 |
Correct |
6 ms |
344 KB |
Output is correct |
| 15 |
Correct |
8 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
344 KB |
Output is correct |
| 17 |
Correct |
9 ms |
344 KB |
Output is correct |
| 18 |
Correct |
9 ms |
344 KB |
Output is correct |
| 19 |
Correct |
5 ms |
600 KB |
Output is correct |
| 20 |
Correct |
5 ms |
600 KB |
Output is correct |
| 21 |
Correct |
5 ms |
344 KB |
Output is correct |
| 22 |
Correct |
7 ms |
344 KB |
Output is correct |
| 23 |
Correct |
5 ms |
444 KB |
Output is correct |
| 24 |
Correct |
6 ms |
344 KB |
Output is correct |
| 25 |
Correct |
5 ms |
344 KB |
Output is correct |
| 26 |
Correct |
9 ms |
344 KB |
Output is correct |
| 27 |
Correct |
5 ms |
344 KB |
Output is correct |
| 28 |
Correct |
5 ms |
344 KB |
Output is correct |
| 29 |
Correct |
5 ms |
344 KB |
Output is correct |
| 30 |
Correct |
4 ms |
344 KB |
Output is correct |
| 31 |
Correct |
6 ms |
344 KB |
Output is correct |
| 32 |
Correct |
6 ms |
344 KB |
Output is correct |
| 33 |
Correct |
5 ms |
344 KB |
Output is correct |
| 34 |
Correct |
4 ms |
344 KB |
Output is correct |
| 35 |
Correct |
5 ms |
344 KB |
Output is correct |
| 36 |
Correct |
4 ms |
344 KB |
Output is correct |
| 37 |
Correct |
4 ms |
344 KB |
Output is correct |
| 38 |
Correct |
6 ms |
344 KB |
Output is correct |
| 39 |
Correct |
7 ms |
600 KB |
Output is correct |
| 40 |
Correct |
6 ms |
344 KB |
Output is correct |
| 41 |
Correct |
6 ms |
344 KB |
Output is correct |
| 42 |
Correct |
6 ms |
344 KB |
Output is correct |
| 43 |
Correct |
7 ms |
344 KB |
Output is correct |
| 44 |
Correct |
6 ms |
344 KB |
Output is correct |
| 45 |
Correct |
5 ms |
344 KB |
Output is correct |
| 46 |
Correct |
5 ms |
344 KB |
Output is correct |
| 47 |
Correct |
5 ms |
344 KB |
Output is correct |
| 48 |
Correct |
4 ms |
344 KB |
Output is correct |
| 49 |
Correct |
5 ms |
344 KB |
Output is correct |
| 50 |
Correct |
4 ms |
344 KB |
Output is correct |
| 51 |
Correct |
7 ms |
344 KB |
Output is correct |
| 52 |
Correct |
7 ms |
344 KB |
Output is correct |
| 53 |
Correct |
4 ms |
600 KB |
Output is correct |
| 54 |
Correct |
5 ms |
344 KB |
Output is correct |
| 55 |
Correct |
6 ms |
344 KB |
Output is correct |
| 56 |
Correct |
5 ms |
600 KB |
Output is correct |
| 57 |
Correct |
5 ms |
344 KB |
Output is correct |
| 58 |
Correct |
7 ms |
600 KB |
Output is correct |
| 59 |
Correct |
8 ms |
600 KB |
Output is correct |
| 60 |
Correct |
7 ms |
344 KB |
Output is correct |
| 61 |
Correct |
6 ms |
344 KB |
Output is correct |
| 62 |
Correct |
6 ms |
596 KB |
Output is correct |
| 63 |
Correct |
6 ms |
596 KB |
Output is correct |
| 64 |
Correct |
6 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
