# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399722 | A_D | Fun Tour (APIO20_fun) | C++14 | 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>
using namespace std;
const int N=5011;
set<int> g[N];
int n,uu;
int d;
void dfs(int u,int p,int dep)
{
if(dep>d){
d=dep;
uu=u;
}
for(auto x:g[u]){
if(x==p)continue;
dfs(x,u,dep+1);
}
}
std::vector<int> createFunTour(int N, int Q) {
//int H = hoursRequired(0, N - 1);
//int A = attractionsBehind(0, N - 1);
return std::vector<int>(N);
n=N;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int h=hoursRequired(i, j);
if(h==1){
g[i].insert(j);
g[j].insert(i);
}
}
}
vector<int> ret;
d=0;
dfs(uu,uu,0);
while(g[uu].empty()==0){
d=0;
int v=uu;
ret.push_back(v);
dfs(uu,uu,0);
int x=*g[v].begin();
g[v].erase(x);
g[x].erase(v);
}
return ret;
}