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) {
vector<int> ans;
int u = 0; ans.push_back(u);
while(u < N - 1) {
if(are_connected({u}, {u + 1})) ans.push_back(++u);
else if(u != N - 2) {
ans.push_back(u + 2);
ans.push_back(u + 1);
u += 2;
} else {
reverse(ans.begin(), ans.end());
ans.push_back(N - 1);
u++;
}
}
return ans;
}
# | 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... |