bzoj2117

动态电分治+二分

肯定要枚举所有点对，那么我们建出点分树降低树高，然后每个点存下点分树中所有子树到这个点的距离，然后二分+lower_bound就行了。

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + ;
namespace IO
{
    const int Maxlen = N * ;
    char buf[Maxlen], *C = buf;
    int Len;
    inline void read_in()
    {
        Len = fread(C, , Maxlen, stdin);
        buf[Len] = '\0';
    }
    inline void fread(int &x)
    {
        x = ;
        int f = ;
        while (*C < '' || '' < *C) { if(*C == '-') f = -; ++C; }
        while ('' <= *C && *C <= '') x = (x << ) + (x << ) + *C - '', ++C;
        x *= f;
    }
    inline void fread(long long &x)
    {
        x = ;
        long long f = ;
        while (*C < '' || '' < *C) { if(*C == '-') f = -; ++C; }
        while ('' <= *C && *C <= '') x = (x << ) + (x << ) + *C - '', ++C;
        x *= f;
    }
    inline void read(int &x)
    {
        x = ;
        int f = ; char c = getchar();
        while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }
        while(c >= '' && c <= '') { x = (x << ) + (x << ) + c - ''; c = getchar(); }
        x *= f;
    }
    inline void read(long long &x)
    {
        x = ;
        long long f = ; char c = getchar();
        while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }
        while(c >= '' && c <= '') { x = (x << 1ll) + (x << 3ll) + c - ''; c = getchar(); }
        x *= f;
    }
} using namespace IO;
int rd()
{
    int x = , f = ; char c = getchar();
    while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }
    while(c >= '' && c <= '') { x = x *  + c - ''; c = getchar(); }
    return x * f;
}
struct edge {
    int nxt, to, w;
} e[N << ];
int n, q, cnt = , root, rt, tot, k;
int head[N], size[N], f[N], Fa[N], dep[N], val[N << ], vis[N], Log[N << ], pos[N << ], mn[N << ][], dis[N];
vector<int> ddis[N], DDis[N];
void link(int u, int v, int w)
{
    e[++cnt].nxt = head[u];
    head[u] = cnt;
    e[cnt].to = v;
    e[cnt].w = w;
}
void getroot(int u, int last, int S)
{
    f[u] = ;
    size[u] = ;
    for(int i = head[u]; i; i = e[i].nxt) if(!vis[e[i].to] && e[i].to != last)
    {
        getroot(e[i].to, u, S);
        size[u] += size[e[i].to];
        f[u] = max(f[u], size[e[i].to]);
    }
    f[u] = max(f[u], S - size[u]);
    if(f[u] < f[root]) root = u;
}
int getsize(int u, int last)
{
    int ret = ;
    for(int i = head[u]; i; i = e[i].nxt) if(e[i].to != last && !vis[e[i].to])
        ret += getsize(e[i].to, u);
    return ret;
}
void divide(int u)
{
    vis[u] = ;
    for(int i = head[u]; i; i = e[i].nxt) if(!vis[e[i].to])
    {
        root = ;
        getroot(e[i].to, u, getsize(e[i].to, u));
        Fa[root] = u;
        divide(root);
    }
}
void dfs(int u, int last)
{
    mn[pos[u] = ++tot][] = dis[u];
    for(int i = head[u]; i; i = e[i].nxt) if(e[i].to != last)
    {
        dis[e[i].to] = dis[u] + e[i].w;
        dep[e[i].to] = dep[u] + ;
        dfs(e[i].to, u);
        mn[++tot][] = dis[u];
    }
}
int Dis(int u, int v)
{
    int ret = dis[u] + dis[v];
    if(pos[u] < pos[v]) swap(u, v);
    int x = Log[pos[u] - pos[v] + ];
    return ret -  * min(mn[pos[v]][x], mn[pos[u] - ( << x) + ][x]);
}
int ask(vector<int> &t, int x)
{
    return upper_bound(t.begin(), t.end(), x) - t.begin();
}
int check(int u, int x)
{
    int ret = ;
    for(int i = u; i; i = Fa[i])
    {
        int d = ask(ddis[i], x - Dis(u, i));
        ret += d;
        if(ret >  * n) return ret;
    }
    for(int i = Fa[u]; i; i = Fa[i]) if(Dis(u, i) <= x) ++ret;
    for(int i = u; Fa[i]; i = Fa[i])
    {
        int d = ask(DDis[i], x - Dis(u, Fa[i]));
        ret -= d;
    }
    return ret;
}
int query(int u, int k)
{
    int l = , r = 1e9 + , ret = ;
    while(r - l > )
    {
        int mid = (l + r) >> ;
        int tmp = check(u, mid);
        if(check(u, mid) >= k) r = ret = mid;
        else l = mid;
    }
    return ret;
}
int main()
{
    char opt[];
    scanf("%s", opt);
    read(n);
    read(k);
    for(int i = ; i < n; ++i)
    {
        int u, v, w;
        read(u);
        read(v);
        read(w);
        link(u, v, w);
        link(v, u, w);
    }
    dfs(, );
    for(int i = ; i <= tot; ++i) Log[i] = Log[i >> ] + ;
    for(int j = ; j <= ; ++j)
        for(int i = ; i + ( << j) -  <= tot; ++i)
            mn[i][j] = min(mn[i][j - ], mn[i + ( << (j - ))][j - ]);
    f[] = 1e9;
    getroot(, , getsize(, ));
    rt = root;
    divide(root);
    for(int i = ; i <= n; ++i)
    {
        for(int j = Fa[i]; j; j = Fa[j]) ddis[j].push_back(Dis(i, j));
        for(int j = i; Fa[j]; j = Fa[j]) DDis[j].push_back(Dis(i, Fa[j]));
    }
    for(int i = ; i <= n; ++i)
    {
        sort(ddis[i].begin(), ddis[i].end());
        sort(DDis[i].begin(), DDis[i].end());
    }
    for(int i = ; i <= n; ++i) printf("%d\n", query(i, k));
    return ;
}