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;
using ll = long long;
int n;
vector<int> longest_trip(int N, int D) {
n = N;
vector<int> p1, p2;
p1.push_back(0);
for (int i = 1;i < n;i++) {
if (p2.empty()) {
if (are_connected({ p1.back() }, { i })) p1.push_back(i);
else p2.push_back(i);
}
else {
if (are_connected({ p1.back() }, { p2.back(), i })) {
p1.push_back(i);
if (are_connected({ p1.back() }, { p2.back() })) {
reverse(p2.begin(), p2.end());
for (auto& x : p2) p1.push_back(x);
p2.clear();
}
}
else {
p2.push_back(i);
}
}
}
if (p1.size() > p2.size()) return p1;
return p2;
}
# | 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... |