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 <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
vector<int> longest_trip(int N, int D)
{
if (D == 3)
{
vector<int> res(N);
iota(res.begin(), res.end(), 0);
return res;
}
if (D == 2)
{
vector<int> res = {0};
for (int i = 1; i < N; i++)
if (are_connected({res.back()}, {i}))
res.push_back(i);
else
{
reverse(res.begin(), res.end());
res.push_back(i);
}
return res;
}
return vector<int>();
}
# | 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... |