Submission #551233

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5512332022-04-20 06:11:41alirezasamimi100Race (IOI11_race)C++17
100 / 100
1243 ms42256 KiB
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll= pair<ll,ll>;
#define pb push_back
vector<pll> adj[200010];
bool hide[200010];
ll sz[200010],k,ans=1e9;
map<ll,ll> mp;
void plant(ll v , ll p = 0){
sz[v] = 1;
for(auto [u,w] : adj[v])
if(u != p && !hide[u]){
plant(u , v);
sz[v] += sz[u];
}
}
ll find_centroid(ll v , ll n , ll p = 0){
bool found = 1;
while(found){
found = 0;
for(auto [u,w] : adj[v])
if(u != p && !hide[u] && sz[u] * 2 > n){
found = 1;
p = v;
v = u;
break;
}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...