# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1028573 | MMihalev | Torrent (COI16_torrent) | C++14 | 74 ms | 24460 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<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<tuple>
#include<set>
#include<map>
#include<random>
#include<chrono>
#include<array>
using namespace std;
const int MAX_N=3e5+5;
vector<int>g[MAX_N];
int a,b;
int n;
int dfs(int u,int par)
{
vector<int>mins;
for(int v:g[u])
{
if(v==par or v==a or v==b)continue;
mins.push_back(dfs(v,u));
}
int ans=0;
for(int i=0;i<mins.size();i++)
{
ans=max(ans,mins[i]+i+1);
}
return ans;
}
signed main ()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>a>>b;
for(int i=1;i<n;i++)
{
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
int ans=max(dfs(a,0),dfs(b,0));
cout<<ans<<"\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |