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 <bits/stdc++.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) {
deque<int> dq = {0};
for (int i = 1; i < N; i++) {
if (are_connected({i}, {dq.back()}))
dq.push_back(i);
else
dq.push_front(i);
}
return vector<int>(dq.begin(), dq.end());
}
return {0};
}
# | 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... |