H - Kay and Snowflake CodeForces - 686D（树的重心性质）

题意

1. 占坑

思路

代码

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <vector>
using namespace std;
void fre() { system("clear"), freopen("A.txt", "r", stdin); freopen("Ans.txt","w",stdout); }
void Fre() { system("clear"), freopen("A.txt", "r", stdin);}
void Run(int x = 0) {     
#ifdef ACM  //宏定义免注释 freopen
    if (! x) fre(); else Fre();
#endif
}
#define ios ios::sync_with_stdio(false)
#define Pi acos(-1)
#define pb push_back
#define fi first
#define se second
#define db double
#define ll long long
#define ull unsigned long long
#define Pir pair<ll, ll>
#define m_p make_pair
#define for_(i, s, e) for(ll i = (ll)(s); i <= (ll)(e); i ++)
#define rep_(i, e, s) for(ll i = (ll)(e); i >= (ll)(s); i --)
#define memset(a, b, c) memset(a, (int)b, c);
#define size() size() * 1LL
#define sc scanf
#define pr printf
#define sd(a) sc("%lld", &a)
#define ss(a) sc("%s", a)
#define __  pr( "------------------------\n" );
#define ___ pr("\n------------------------\n");
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define esp 1e-7
#define mod (ll)(1e9 + 7)
/*=========================ACMer===========================*/
const ll mxn = 3e5 + 10;
ll n, q;    
ll fa[mxn];
ll son[mxn];
ll ans[mxn];
vector<ll> e[mxn];

void dfs(ll u)
{
    ans[u] = u, son[u] = 1;
    ll mx = 0;
    for (auto v : e[u])
    {
        dfs(v);
        son[u] += son[v];
        if(son[v] > son[mx]) mx = v;
    }

    if(son[mx] * 2 > son[u])     //如果该这个条件不成立，即即以把 u 删去的所有子树中,节点数最多的子树还小于等于son[u] 的话，那么以 u 为根的子树的重心就是默认值 u，即 ans[u] = u;
    {
        ll now = ans[mx];
        while((son[u] - son[now]) * 2 > son[u])
        {
            now = fa[now];
        }
        ans[u] = now;
    }
}

int main()
{
    Run();
    sc("%lld %lld", &n, &q);
    for_(i, 2, n)
    {
        sd(fa[i]);
        e[fa[i]].pb(i);
    }

    dfs(1);

    ll x;
    while(q --)
    {
        sd(x);
        pr("%lld\n", ans[x]);
    }

    return 0;
}