#include<bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
vector<int> order, rev_order;
bool are_connected_wrapper(vector<int> vec1, vector<int> vec2) {
vector<int> param1, param2;
for (int i: vec1) {
param1.push_back(order[i]);
}
for (int i: vec2) {
param2.push_back(order[i]);
}
return are_connected(param1, param2);
}
vector<int> get_result(vector<int> path) {
vector<int> res;
for (int i: path) {
res.push_back(rev_order[i]);
}
return res;
}
pair<int, int> find_connection(vector<int> vec1, vector<int> vec2, bool is_checked=false) {
if (!is_checked && !are_connected_wrapper(vec1, vec2)) {
return make_pair(-1, -1);
}
if (vec1.size() == 1 && vec2.size() == 1) {
return make_pair(vec1[0], vec2[0]);
}
if (vec1.size() == 1) {
pair<int, int> res = find_connection(vec2, vec1, true);
return make_pair(res.second, res.first);
}
vector<int> half;
for (int i = 0; i < (int)vec1.size() / 2; i++) {
half.push_back(vec1[i]);
}
pair<int, int> res = find_connection(half, vec2);
if (res != make_pair(-1, -1)) {
return res;
}
half.clear();
for (int i = (int)vec1.size() / 2; i < (int)vec1.size(); i++) {
half.push_back(vec1[i]);
}
return find_connection(half, vec2);
}
int find_position(int el, vector<int> vec) {
for (int i = 0; i < (int)vec.size(); i++) {
if (vec[i] == el) {
return i;
}
}
return -1;
}
vector<int> longest_trip(int N, int D)
{
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
order.resize(N);
rev_order.resize(N);
for (int i = 0; i < N; i++) {
order[i] = i;
}
shuffle(order.begin(), order.end(), rng);
for (int i = 0; i < N; ++i) {
rev_order[order[i]] = i;
}
vector<int> path[2];
path[0] = {0};
for (int i = 1; i < N; i++) {
bool which = uniform_int_distribution<int>(0, 1)(rng);
if (path[which].empty()) {
which = !which;
}
if (are_connected_wrapper({path[which].back()}, {i})) {
path[which].push_back(i);
if (!path[!which].empty() &&
are_connected_wrapper({path[!which].back()}, {i})) {
while (!path[!which].empty()) {
path[which].push_back(path[!which].back());
path[!which].pop_back();
}
}
}
else {
path[!which].push_back(i);
}
}
if (path[0].empty()) {
return get_result(path[1]);
}
if (path[1].empty()) {
return get_result(path[0]);
}
vector<int> res;
vector<int> path_ends[2];
for (int i = 0; i <= 1; i++) {
if (path[i].size() == 1u) {
path_ends[i] = {path[i][0]};
}
else {
path_ends[i] = {path[i][0], path[i].back()};
}
}
if (are_connected_wrapper(path_ends[0], path_ends[1])) {
if (are_connected_wrapper({path[0][0]}, {path[1][0]})) {
for (int i: path[1]) {
res.push_back(i);
}
reverse(res.begin(), res.end());
for (int i: path[0]) {
res.push_back(i);
}
}
else if(are_connected_wrapper({path[0][0]}, {path[1].back()})) {
for (int i: path[1]) {
res.push_back(i);
}
for (int i: path[0]) {
res.push_back(i);
}
}
else if(are_connected_wrapper({path[0].back()}, {path[1][0]})) {
for (int i: path[0]) {
res.push_back(i);
}
for (int i: path[1]) {
res.push_back(i);
}
}
else {
assert(false);
}
}
else {
pair<int, int> conn = find_connection(path[0], path[1]);
if (conn == make_pair(-1, -1)) {
res = (path[0].size() > path[1].size())?path[0] : path[1];
}
else {
int pos[2] = {find_position(conn.first, path[0]), find_position(conn.second, path[1])};
for (int i = (pos[0] + 1) % path[0].size(); i != pos[0]; i = (i + 1) % path[0].size()) {
res.push_back(path[0][i]);
}
res.push_back(conn.first);
res.push_back(conn.second);
for (int i = (pos[1] + 1) % path[1].size(); i != pos[1]; i = (i + 1) % path[1].size()) {
res.push_back(path[1][i]);
}
}
}
return get_result(res);
}
| # |
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 |
8 ms |
344 KB |
Output is correct |
| 2 |
Correct |
5 ms |
344 KB |
Output is correct |
| 3 |
Correct |
5 ms |
344 KB |
Output is correct |
| 4 |
Correct |
4 ms |
344 KB |
Output is correct |
| 5 |
Correct |
4 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
344 KB |
Output is correct |
| 2 |
Correct |
7 ms |
344 KB |
Output is correct |
| 3 |
Correct |
5 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 |
Incorrect |
0 ms |
344 KB |
Incorrect |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 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 |
600 KB |
Output is correct |
| 5 |
Correct |
5 ms |
344 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Incorrect |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 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 |
5 ms |
344 KB |
Output is correct |
| 5 |
Correct |
5 ms |
344 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
344 KB |
Incorrect |
| 7 |
Halted |
0 ms |
0 KB |
- |
