| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358273 | 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)
{
int skip=0;
deque<int> dq={0};
for (int i=1; i<N; i++)
{
if (are_connected(vector<int> {0}, vector<int> {i}))
{
dq.push_back(i);
skip=i;
break;
}
}
for (int i=1; i<N; i++)
{
if (i==skip) continue;;
if (are_connected(vector<int> {dq.back()}, vector<int> {i})) dq.push_back(i);
else dq.push_front(i);
}
vector<int> res;
for (int i=0; i<dq.size(); i++) res.push_back(dq[i]);
return res;
}
| # | 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... | ||||
