| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358271 | 12345678 | Longest Trip (IOI23_longesttrip) | C++17 | 3 ms | 412 KiB |
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> longest_trip(int N, int D)
{
vector<int> d[2];
d[0]={0}, d[1]={1};
for (int i=2; i<N; i++)
{
if (are_connected(vector<int> {d[0].back()}, vector<int> {i})) d[0].push_back(i);
else d[1].push_back(i);
}
if (are_connected(vector<int> {d[0].front()}, vector<int> {d[1].front()}))
{
reverse(d[0].begin(), d[0].end());
for (auto x:d[1]) d[0].push_back(x);
return d[0];
}
if (are_connected(vector<int> {d[0].front()}, vector<int> {d[1].back()}))
{
for (auto x:d[0]) d[1].push_back(x);
return d[1];
}
if (are_connected(vector<int> {d[0].back()}, vector<int> {d[1].front()}))
{
for (auto x:d[1]) d[0].push_back(x);
return d[0];
}
if (are_connected(vector<int> {d[0].back()}, vector<int> {d[1].back()}))
{
reverse(d[1].begin(), d[1].end());
for (auto x:d[1]) d[0].push_back(x);
return d[0];
}
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
