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 <algorithm>
std::vector<int> longest_trip(int N, int D)
{
std::vector<int> solution;
int node = 0;
while(node < N - 1)
{
solution.push_back(node);
if(are_connected({node}, {node + 1}))
{
solution.push_back(node + 1);
node++;
}
else if(node != N - 2)
{
solution.push_back(node + 2);
solution.push_back(node + 1);
node += 2;
}
else
{
reverse(solution.begin(), solution.end());
solution.push_back(N - 1);
node++;
}
}
return solution;
}
# | 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... |