Distance in Tree【Codeforces 161D】【点分治】

题目链接

---

  有学弟用了树形DP的解法，很厉害～

  然后这里我的想法是去用点分治来解决这个问题，题目中要求的是"== K"的这样的点对的数量，其实很容易就想到点分治，但是我感觉我这个点分治，其实也就是个树形dp的写法。就是我们利用重心去分治了子树，然后不断的去判断，这里多了个要加进ans的答案就是访问到距离权为K的点，需要把答案加进去。剩下的，感觉也就是个树dp一样的了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define efs 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef double lb;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 5e4 + 7;
int N, K, cnt, head[maxN], ans = 0;
bool vis[maxN];
struct Eddge
{
    int nex, to;
    Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxN<<1];
inline void addEddge(int u, int v)
{
    edge[cnt] = Eddge(head[u], v);
    head[u] = cnt++;
}
inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
int siz[maxN], son[maxN], mx = INF, rt = 0, all;
void findroot(int u, int fa)
{
    siz[u] = 1; son[u] = 0;
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(vis[v] || v == fa) continue;
        findroot(v, u);
        siz[u] += siz[v];
        if(siz[v] > son[u]) son[u] = siz[v];
    }
    son[u] = max(son[u], all - siz[u]);
    if(son[u] < mx) { mx = son[u]; rt = u; }
}
int Stap[505], num[505];
void get_dis(int u, int fa, int dis)
{
    if(dis == K) { ans++; return; }
    Stap[dis]++;
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(vis[v] || v == fa) continue;
        get_dis(v, u, dis + 1);
    }
}
void solve(int u)
{
    memset(num, 0, sizeof(num));
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(vis[v]) continue;
        memset(Stap, 0, sizeof(Stap));
        get_dis(v, u, 1);
        for(int i=1; i<K; i++) ans += Stap[i] * num[K - i];
        for(int i=1; i<K; i++) num[i] += Stap[i];
    }
}
void divide(int u)
{
    vis[u] = true;
    solve(u);
    int totsiz = all;
    for(int i=head[u], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(vis[v]) continue;
        mx = INF; rt = 0;
        all = siz[v] > siz[u] ? totsiz - siz[u] : siz[v];
        findroot(v, 0);
        divide(rt);
    }
}
inline void init()
{
    cnt = 0; all = N;
    for(int i=1; i<=N; i++) head[i] = -1;
    for(int i=1; i<=N; i++) vis[i] = false;
}
int main()
{
    scanf("%d%d", &N, &K);
    init();
    for(int i=1, u, v; i<N; i++)
    {
        scanf("%d%d", &u, &v);
        _add(v, u);
    }
    findroot(1, 0);
    divide(rt);
    printf("%d\n", ans);
    return 0;
}