# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841608 | flashmt | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d)
{
vector<int> c[2];
c[0] = {0};
for (int i = 1; i < n; i++)
{
int x = c[0].back();
if (are_connected({i}, {x})) c[0].push_back(i);
else c[1].push_back(i);
}
if (size(c[1]) > size(c[0]))
swap(c[0], c[1]);
if (empty(c[1]))
return c[0];
if (!are_connected(c[0], c[1]))
return c[0];
for (int u : {0, 1})
{
int v = u ^ 1;
int x = c[v][0];
if (are_connected({x}, {c[u][0]}))
{
reverse(begin(c[u]), end(c[u]));
for (int y : c[v])
c[u].push_back(y);
return c[u];
}
if (are_connected({x}, {c[u].back()}))
{
for (int y : c[v])
c[u].push_back(y);
return c[u];
}
}
// both c[0] and c[1] are cycles
int low = 0, high = size(c[0]);
while (high - low > 1)
{
int mid = (low + high) / 2;
if (are_connected(vector<int>(begin(c[0]) + low, begin(c[0]) + mid), c[1])) high = mid;
else low = mid;
}
int id0 = low;
low = 0, high = size(c[1]);
while (high - low > 1)
{
int mid = (low + high) / 2;
if (are_connected(vector<int>(begin(c[1]) + low, begin(c[1]) + mid), {x})) high = mid;
else low = mid;
}
int id1 = low;
if (id0 < size(c[0]) - 1)
rotate(begin(c[0]), begin(c[0]) + (id0 + 1), end(c[0]));
rotate(begin(c[1]), begin(c[1]) + id1, end(c[1]));
for (int i : c[1])
c[0].push_back(i);
return c[0];
}