【BZOJ2599】【IOI2011】Race（点分治）

Description

给一棵树，每条边有权。求一条简单路径，权值和等于 K K <script type="math/tex" id="MathJax-Element-3">K</script> ，且边的数量最小。

---

Solution

以前用set水过了85分。
今天偶尔看到这道题，发现这不是个思博题么。。

直接点分，每加入一棵子树时计算它与之前的子树的贡献即可。

---

Code

/************************************************
 * Au: Hany01
 * Date: Jun 10th, 2018
 * Prob: [BZOJ2599] Race
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 200005, maxm = 400005;

int n, v[maxm], e, w[maxm], nex[maxm], beg[maxn], sz[maxn], maxch[maxn], vis[maxn], Ans = INF, ns, rt, k;
int hs[1000005];

inline void add(int uu, int vv, int ww) { v[++ e] = vv, w[e] = ww, nex[e] = beg[uu], beg[uu] = e; }

void getrt(int u, int pa)
{
    maxch[u] = 0, sz[u] = 1;
    for (register int i = beg[u]; i; i = nex[i]) if (v[i] != pa && !vis[v[i]])
        getrt(v[i], u), sz[u] += sz[v[i]], chkmax(maxch[u], sz[v[i]]);
    chkmax(maxch[u], ns - sz[u]);
    if (maxch[u] < maxch[rt]) rt = u;
}

void calc(int u, int pa, int dep, int dis)
{
    if (dis > k) return ;
    if (hs[k - dis] || k == dis) chkmin(Ans, dep + hs[k - dis]);
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != pa && !vis[v[i]]) calc(v[i], u, dep + 1, dis + w[i]);
}

void getdep(int u, int pa, int dep, int dis)
{
    if (dis > k) return ;
    if (!hs[dis]) hs[dis] = dep; else chkmin(hs[dis], dep);
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != pa && !vis[v[i]]) getdep(v[i], u, dep + 1, dis + w[i]);
}

void clear(int u, int pa, int dep, int dis)
{
    if (dis > k) return ;
    hs[dis] = 0;
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != pa && !vis[v[i]]) clear(v[i], u, dep + 1, dis + w[i]);
}

void solve(int u)
{
    vis[u] = 1;
    for (register int i = beg[u]; i; i = nex[i]) if (!vis[v[i]])
        calc(v[i], 0, 1, w[i]), getdep(v[i], 0, 1, w[i]);
    for (register int i = beg[u]; i; i = nex[i]) if (!vis[v[i]])
        clear(v[i], 0, 1, w[i]);
    for (register int i = beg[u]; i; i = nex[i]) if (!vis[v[i]])
        ns = sz[v[i]], rt = 0, getrt(v[i], 0), solve(rt);
}

int main()
{

    static int uu, vv, ww;

    n = read(), k = read();
    For(i, 2, n) uu = read()+1, vv = read()+1, ww = read(), add(uu, vv, ww), add(vv, uu, ww);

    maxch[0] = INF, ns = n, rt = 0, getrt(1, 0), solve(rt);
    printf("%d\n", Ans == INF ? -1 : Ans);

    return 0;
}