#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d) {
vector<int> ans = { 0 };
set<int> st;
for(int i=1; i<n; i++) st.insert(i);
while(true) {
int x = ans.back();
int ok = 0;
for(int u : st) {
if(are_connected({ u }, { x })) {
ans.push_back(u);
st.erase(u);
ok = 1;
break;
}
}
if(!ok) break;
}
if(ans.size() >= n / 2) return ans;
return vector<int>(st.begin(), st.end());
}
# | 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... |