#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
vector<int> res;
deque<int> dq;
std::vector<int> longest_trip(int N, int D) {
res.clear();
if (D == 3) {
for (int i = 0; i <= N - 1; ++i) {
res.emplace_back(i);
}
return res;
}
else if(D == 2) {
dq.clear();
dq.emplace_back(0);
dq.emplace_back(1);
dq.emplace_back(2);
for (int i = 0; i <= 1; ++i) {
if(are_connected({i}, {i + 1})) {
continue;
}
swap(dq[0], dq[i]);
swap(dq[2], dq[i + 1]);
break;
}
for (int i = 3; i <= N - 1; ++i) {
if(are_connected({i}, {dq[0]})) {
dq.emplace_front(i);
}
else {
dq.emplace_back(i);
}
}
while(!dq.empty()) {
res.emplace_back(dq.front());
dq.pop_front();
}
return res;
}
return {};
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 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 |
4 ms |
344 KB |
Output is correct |
7 |
Correct |
6 ms |
344 KB |
Output is correct |
8 |
Correct |
5 ms |
356 KB |
Output is correct |
9 |
Correct |
4 ms |
344 KB |
Output is correct |
10 |
Correct |
5 ms |
596 KB |
Output is correct |
11 |
Correct |
5 ms |
600 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |