BZOJ 2599 IOI 2011 Race 点分治

和HDU 4812 差不多，只不过乘法换成加法而已。
http://blog.csdn.net/huanghongxun/article/details/51050786

#include <cstdio>
#include <cstring>
#include <algorithm>
#define FOR(i,j,k) for(i=j;i<=k;++i)
#define ms(i) memset(i,0,sizeof i)
const int N = 200005, M = N * 2, inf = 2147483647, K = 1000005;
using namespace std;
int k, ans = inf;
int vis[M], p[M], v[M], h[N], w[M], node, rt, cnt = 1;
int dep[N], g[N], sz[N];
int hts[K], hval[K], ts = 0;
int dkey[N], dval[N], dtop;
void map_insert(int key, int val) {
    if (hts[key] == ts) hval[key] = min(hval[key], val);
    else hts[key] = ts, hval[key] = val;
}
void add(int a, int b, int c) {
    p[++cnt] = h[a]; v[cnt] = b; w[cnt] = c; h[a] = cnt;
}
void root(int x, int fa) {
    sz[x] = 1; g[x] = 0;
    for (int i = h[x]; i; i = p[i])
        if (v[i] != fa && !vis[i]) {
            root(v[i], x);
            sz[x] += sz[v[i]];
            g[x] = max(g[x], sz[v[i]]);
        }
    g[x] = max(g[x], node - sz[x]);
    if (g[x] < g[rt]) rt = x;
}
int get_root(int x, int fa, int sz) {
    rt = 0; node = sz; g[0] = inf;
    root(x, fa); return rt;
}
void dfs_seq(int x, int fa, int dep, int dis) {
    if (dis > k) return;
    dkey[++dtop] = dis; dval[dtop] = dep;
    for (int i = h[x]; i; i = p[i])
        if (!vis[i] && v[i] != fa)
            dfs_seq(v[i], x, dep + 1, dis + w[i]);
}
void work(int x) {
    int i, j; hts[0] = ++ts;
    for (i = h[x]; i; i = p[i]) if (!vis[i]) {
        dtop = 0; dfs_seq(v[i], x, 1, w[i]);
        FOR(j,1,dtop) {
            int p = dkey[j], q = k - p;
            if (p == k) ans = min(ans, dval[j]);
            else if (hts[q] == ts) ans = min(ans, hval[q] + dval[j]);
        }
        FOR(j,1,dtop) map_insert(dkey[j], dval[j]);
    }
    for (i = h[x]; i; i = p[i]) if (!vis[i]) {
        vis[i] = vis[i ^ 1] = 1;
        work(get_root(v[i], x, sz[v[i]]));
    }
}
int main() {
    int i, n, x, y, z;
    scanf("%d%d", &n, &k);
    FOR(i,2,n) scanf("%d%d%d", &x, &y, &z), add(x, y, z), add(y, x, z);
    work(get_root(1, -1, n));
    printf("%d", ans == inf ? -1 : ans);
    return 0;
}

2599: [IOI2011]Race

Description

给一棵树,每条边有权.求一条路径,权值和等于K,且边的数量最小.

Input

第一行 两个整数 n, k
第二..n行 每行三个整数 表示一条无向边的两端和权值 (注意点的编号从0开始)

Output

一个整数 表示最小边数量 如果不存在这样的路径 输出-1

Sample Input

4 3
0 1 1
1 2 2
1 3 4

Sample Output

2