# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848774 | emad234 | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KiB |
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>
#define all(v) ((v).begin(),(v).end())
#define ll long long
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll mxN = 2e5 + 1;
using namespace std;
int Search(int x, vector<int>b){
if(b.size() == 1) return b[0];
vector<int>a = {x};
vector<int> v,v1;
for(int i = 0;i < b.size() / 2;i++) v.push_back(b[i]);
for(int i = b.size() / 2;i < b.size();i++) v1.push_back(b[i]);
if(are_connected(a,v)) return Search(x,v);
else if(are_connected(a,v1)) return Search(x,v1);
return -1;
}
bool vis[mxN];
vector<int> longest_trip(int N, int D)
{
vector<int>ans = {0};
vis[0] = 1;
while(ans.size() < N){
vector<int>b;
for(int i = 0;i < N;i++){
if(!vis[i]) b.push_back(i);
}
int x = Search(ans[ans.size() - 1],b);
ans.push_back(x);
vis[x] = 1;
}
return ans;
}