#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
uint64_t randomAddress() {
char *p = new char;
delete p;
return uint64_t(p);
}
uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() * (randomAddress() | 1);
// mt19937 rng(SEED);
void concat(vector<int> &t1, vector<int> &t2) {
if(t1.size() < t2.size()) {
swap(t1, t2);
}
while(!t2.empty()) {
t1.emplace_back(t2.back());
t2.pop_back();
}
}
std::vector<int> longest_trip(int n, int D) {
srand(SEED);
vector<int> res, ord(n);
iota(ord.begin(), ord.end(), 0);
random_shuffle(ord.begin(), ord.end());
if(D == 3) {
for(const auto &u: ord) {
res.emplace_back(u);
}
} else if(D == 2) {
deque<int> dq;
dq.emplace_back(ord.back());
ord.pop_back();
for(const auto &u: ord) {
if(are_connected({u}, {dq.back()})) {
dq.emplace_back(u);
} else if(are_connected({u}, {dq.front()})) {
// assert(are_connected({u}, {dq.front()}));
dq.emplace_front(u);
} else {
exit(33);
}
}
for(const auto &u: dq) {
res.emplace_back(u);
}
} else {
vector<int> t1, t2;
t1.emplace_back(ord.back());
ord.pop_back();
t2.emplace_back(ord.back());
ord.pop_back();
for(const auto &u: ord) {
if(are_connected({u}, {t1.back()})) {
t1.emplace_back(u);
} else if(are_connected({u}, {t2.back()})) {
t2.emplace_back(u);
} else {
concat(t1, t2);
t2.emplace_back(u);
}
}
if(t1.size() < t2.size()) {
swap(t1, t2);
}
for(const auto &u: t1) {
res.emplace_back(u);
}
}
return res;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 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 |
Runtime error |
0 ms |
344 KB |
Execution failed because the return code was nonzero |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 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 |
440 KB |
Output is correct |
| 5 |
Correct |
5 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 |
4 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
5 ms |
344 KB |
Output is correct |
| 11 |
Correct |
4 ms |
344 KB |
Output is correct |
| 12 |
Correct |
5 ms |
344 KB |
Output is correct |
| 13 |
Correct |
5 ms |
344 KB |
Output is correct |
| 14 |
Correct |
5 ms |
344 KB |
Output is correct |
| 15 |
Correct |
5 ms |
344 KB |
Output is correct |
| 16 |
Correct |
7 ms |
344 KB |
Output is correct |
| 17 |
Correct |
5 ms |
344 KB |
Output is correct |
| 18 |
Correct |
5 ms |
344 KB |
Output is correct |
| 19 |
Correct |
5 ms |
344 KB |
Output is correct |
| 20 |
Correct |
5 ms |
600 KB |
Output is correct |
| 21 |
Correct |
6 ms |
344 KB |
Output is correct |
| 22 |
Correct |
5 ms |
344 KB |
Output is correct |
| 23 |
Correct |
5 ms |
344 KB |
Output is correct |
| 24 |
Correct |
5 ms |
344 KB |
Output is correct |
| 25 |
Correct |
5 ms |
344 KB |
Output is correct |
| 26 |
Correct |
6 ms |
344 KB |
Output is correct |
| 27 |
Correct |
6 ms |
344 KB |
Output is correct |
| 28 |
Correct |
5 ms |
344 KB |
Output is correct |
| 29 |
Correct |
6 ms |
344 KB |
Output is correct |
| 30 |
Correct |
4 ms |
344 KB |
Output is correct |
| 31 |
Correct |
5 ms |
344 KB |
Output is correct |
| 32 |
Correct |
8 ms |
344 KB |
Output is correct |
| 33 |
Correct |
5 ms |
344 KB |
Output is correct |
| 34 |
Correct |
5 ms |
344 KB |
Output is correct |
| 35 |
Correct |
5 ms |
344 KB |
Output is correct |
| 36 |
Correct |
5 ms |
600 KB |
Output is correct |
| 37 |
Correct |
4 ms |
344 KB |
Output is correct |
| 38 |
Correct |
5 ms |
344 KB |
Output is correct |
| 39 |
Correct |
6 ms |
344 KB |
Output is correct |
| 40 |
Correct |
7 ms |
600 KB |
Output is correct |
| 41 |
Correct |
7 ms |
344 KB |
Output is correct |
| 42 |
Correct |
6 ms |
344 KB |
Output is correct |
| 43 |
Correct |
6 ms |
344 KB |
Output is correct |
| 44 |
Correct |
7 ms |
344 KB |
Output is correct |
| 45 |
Correct |
5 ms |
344 KB |
Output is correct |
| 46 |
Correct |
6 ms |
344 KB |
Output is correct |
| 47 |
Correct |
5 ms |
344 KB |
Output is correct |
| 48 |
Correct |
5 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 |
6 ms |
344 KB |
Output is correct |
| 53 |
Correct |
4 ms |
344 KB |
Output is correct |
| 54 |
Correct |
6 ms |
344 KB |
Output is correct |
| 55 |
Correct |
4 ms |
344 KB |
Output is correct |
| 56 |
Correct |
4 ms |
344 KB |
Output is correct |
| 57 |
Correct |
4 ms |
344 KB |
Output is correct |
| 58 |
Correct |
5 ms |
344 KB |
Output is correct |
| 59 |
Correct |
7 ms |
344 KB |
Output is correct |
| 60 |
Correct |
7 ms |
344 KB |
Output is correct |
| 61 |
Correct |
7 ms |
344 KB |
Output is correct |
| 62 |
Correct |
8 ms |
600 KB |
Output is correct |
| 63 |
Correct |
7 ms |
344 KB |
Output is correct |
| 64 |
Correct |
8 ms |
600 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Incorrect |
| 2 |
Halted |
0 ms |
0 KB |
- |
