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