#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#include "longesttrip.h"
vector<int> longest_trip(int N, int D)
{
int a[N];
for(int i=0;i<N;i++)a[i]=i;
random_device rd;
mt19937 g(rd());
vector<int> ans;
map<vector<int>,bool> vis;
int cntt=0;
for(int i=0;i<2000;i++) {
cntt++;
shuffle(a, a + N, g);
vector<int> e;
for(int j=0;j<N;j++)e.pb(a[j]);
if(vis[e])continue;
cntt++;
if(cntt==256)break;
vis[e]=1;
int cnt=1;
vector<int> vec;
vec.pb(a[0]);
for(int j=1;j<N;j++){
vector<int> v1,v2;
v1.pb(a[0]);
v2.pb(a[j]);
if(!are_connected(v1,v2))break;
vec.pb(a[j]);
}
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... |