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) {
    vector<int> v = {0};
    vector<bool> vis(n);
    while ((int)v.size() <= (n >> 1)) {
        bool tr = false;
        for (int i = 1; i < n && !tr; i++) {
            if (!vis[i] && are_connected({v.back()}, {i})) {
                v.push_back(i);
                tr = vis[i] = true;
            }
        }
        if (!tr) v.pop_back();
    }
    return v;
}
| # | 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... |