// correct/solution-st3-2N.cpp
#include "longesttrip.h"
#include <algorithm>
#include <random>
#include <deque>
std::vector<int> longest_trip(int N, int /*D*/)
{
srand(time(0));
std::vector<int> ids(N);
for (int i = 0; i < N; i++)
ids[i] = i;
random_shuffle(ids.begin(), ids.end());
std::deque<int> line1;
line1.clear();
std::deque<int> line2;
line2.clear();
line1.push_back(ids[0]);
for (int i = 1; i < N; i++)
{
if (are_connected({line1.back()}, {ids[i]}))
{
line1.push_back(ids[i]);
}
else if (!line2.empty() && are_connected({line2.back()}, {ids[i]}))
{
line2.push_back(ids[i]);
}
else
{
while (!line2.empty())
{
line1.push_back(line2.back());
line2.pop_back();
}
line2.push_back(ids[i]);
}
}
if (line1.size() < line2.size())
swap(line1, line2);
std::vector<int> ans;
ans.clear();
for (int i : line1)
ans.push_back(i);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
208 KB |
Output is correct |
2 |
Correct |
5 ms |
208 KB |
Output is correct |
3 |
Correct |
8 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
208 KB |
Output is correct |
5 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
2 |
Correct |
8 ms |
208 KB |
Output is correct |
3 |
Correct |
9 ms |
208 KB |
Output is correct |
4 |
Correct |
8 ms |
208 KB |
Output is correct |
5 |
Correct |
8 ms |
208 KB |
Output is correct |
6 |
Incorrect |
0 ms |
208 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
208 KB |
Output is correct |
2 |
Correct |
9 ms |
208 KB |
Output is correct |
3 |
Correct |
10 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
208 KB |
Output is correct |
5 |
Correct |
10 ms |
208 KB |
Output is correct |
6 |
Correct |
7 ms |
208 KB |
Output is correct |
7 |
Correct |
10 ms |
208 KB |
Output is correct |
8 |
Correct |
4 ms |
208 KB |
Output is correct |
9 |
Correct |
7 ms |
208 KB |
Output is correct |
10 |
Correct |
6 ms |
208 KB |
Output is correct |
11 |
Correct |
6 ms |
208 KB |
Output is correct |
12 |
Correct |
8 ms |
208 KB |
Output is correct |
13 |
Correct |
7 ms |
208 KB |
Output is correct |
14 |
Correct |
7 ms |
208 KB |
Output is correct |
15 |
Correct |
7 ms |
208 KB |
Output is correct |
16 |
Correct |
15 ms |
208 KB |
Output is correct |
17 |
Correct |
9 ms |
208 KB |
Output is correct |
18 |
Correct |
8 ms |
208 KB |
Output is correct |
19 |
Correct |
10 ms |
208 KB |
Output is correct |
20 |
Correct |
7 ms |
208 KB |
Output is correct |
21 |
Correct |
9 ms |
208 KB |
Output is correct |
22 |
Correct |
6 ms |
208 KB |
Output is correct |
23 |
Correct |
10 ms |
208 KB |
Output is correct |
24 |
Correct |
10 ms |
208 KB |
Output is correct |
25 |
Correct |
12 ms |
208 KB |
Output is correct |
26 |
Correct |
11 ms |
208 KB |
Output is correct |
27 |
Correct |
8 ms |
208 KB |
Output is correct |
28 |
Correct |
9 ms |
208 KB |
Output is correct |
29 |
Correct |
7 ms |
208 KB |
Output is correct |
30 |
Correct |
9 ms |
208 KB |
Output is correct |
31 |
Correct |
11 ms |
208 KB |
Output is correct |
32 |
Correct |
13 ms |
208 KB |
Output is correct |
33 |
Correct |
7 ms |
208 KB |
Output is correct |
34 |
Correct |
9 ms |
208 KB |
Output is correct |
35 |
Correct |
7 ms |
208 KB |
Output is correct |
36 |
Correct |
7 ms |
208 KB |
Output is correct |
37 |
Correct |
10 ms |
208 KB |
Output is correct |
38 |
Correct |
8 ms |
208 KB |
Output is correct |
39 |
Correct |
14 ms |
208 KB |
Output is correct |
40 |
Correct |
14 ms |
208 KB |
Output is correct |
41 |
Correct |
13 ms |
208 KB |
Output is correct |
42 |
Correct |
11 ms |
208 KB |
Output is correct |
43 |
Correct |
12 ms |
208 KB |
Output is correct |
44 |
Correct |
9 ms |
208 KB |
Output is correct |
45 |
Correct |
10 ms |
208 KB |
Output is correct |
46 |
Correct |
10 ms |
208 KB |
Output is correct |
47 |
Correct |
7 ms |
208 KB |
Output is correct |
48 |
Correct |
9 ms |
208 KB |
Output is correct |
49 |
Correct |
8 ms |
208 KB |
Output is correct |
50 |
Correct |
6 ms |
208 KB |
Output is correct |
51 |
Correct |
8 ms |
208 KB |
Output is correct |
52 |
Correct |
16 ms |
208 KB |
Output is correct |
53 |
Correct |
8 ms |
208 KB |
Output is correct |
54 |
Correct |
9 ms |
208 KB |
Output is correct |
55 |
Correct |
8 ms |
208 KB |
Output is correct |
56 |
Correct |
7 ms |
208 KB |
Output is correct |
57 |
Correct |
7 ms |
208 KB |
Output is correct |
58 |
Correct |
10 ms |
268 KB |
Output is correct |
59 |
Correct |
17 ms |
208 KB |
Output is correct |
60 |
Correct |
5 ms |
256 KB |
Output is correct |
61 |
Correct |
15 ms |
208 KB |
Output is correct |
62 |
Correct |
7 ms |
208 KB |
Output is correct |
63 |
Correct |
14 ms |
208 KB |
Output is correct |
64 |
Correct |
11 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
208 KB |
Output is correct |
2 |
Correct |
10 ms |
208 KB |
Output is correct |
3 |
Correct |
9 ms |
208 KB |
Output is correct |
4 |
Correct |
13 ms |
208 KB |
Output is correct |
5 |
Correct |
6 ms |
208 KB |
Output is correct |
6 |
Incorrect |
1 ms |
208 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |