# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519172 | MOUF_MAHMALAT | Torrent (COI16_torrent) | C++14 | 2078 ms | 23044 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(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
ll n,a,b,x,y,dp[300009],pp[300009],ans=1e9;
vector<vector<ll> >v;
vector<ll>bin;
inline void dfs(ll d,ll p)
{
pp[d]=p;
for(auto&z:v[d])
if(z!=p)
dfs(z,d);
}
inline void best(ll d,ll p)
{
dp[d]=0;
vector<ll>o;
for(auto&z:v[d])
{
if(z==p||(d==x&&z==y)||(d==y&&z==x))
continue;
best(z,d);
o.push_back(dp[z]);
}
sort(all(o),greater<ll>());
for(ll i=0; i<o.size(); i++)
dp[d]=max(dp[d],o[i]+i+1);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |