| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1341020 | karel | Longest Trip (IOI23_longesttrip) | C++20 | 6 ms | 408 KiB |
#include "longesttrip.h"
using namespace std;
vector<int> longest_trip(int N, int D)
{
vector<int> a, b;
a.push_back(0);
b.push_back(1);
for(int i = 2; i < N; i++)
{
bool ac = are_connected({i}, {a.back()}), bc = are_connected({i}, {b.back()});
if(ac)
{
a.push_back(i);
} else if(bc)
{
b.push_back(i);
} else {
for(int j = b.size() - 1; j >= 0; j--)
a.push_back(b[j]);
b.clear();
b.push_back(i);
}
}
if(a.size() > b.size())
return a;
return b;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
