#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#include "longesttrip.h"
vector<int> longest_trip(int N, int D)
{
srand(time(NULL));
vector<int> ans;
for(int i=0;i<34;i++) {
vector<int> a;
for(int j=0;j<N;j++)a.pb(j);
vector<int> vec;
int x=rand()%N;
vec.pb(a[x]);
a.erase(a.begin()+x);
for(int j=1;j<N;j++){
vector<int> rem=a;
while(rem.size()>0){
int x=rand()%rem.size();
if(are_connected({rem[x]},{vec[j-1]})){
vec.pb(rem[x]);
int idx;
for(int k=0;k<a.size();k++){
if(a[k]==rem[x])idx=k;
}
a.erase(a.begin()+idx);
break;
}
rem.erase(rem.begin()+x);
}
if(vec.size()==j)break;
}
if(vec.size()>ans.size())ans=vec;
}
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... |