Submission #1453851

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using ll = long long;
using namespace std;
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }

template <typename UnaryPredicate>
ll binsearch(ll l, ll r, UnaryPredicate p) { // [l, r), p is monotone
    assert (l < r);
    -- l;
    while (r - l > 1) {
        ll m = (l + r) / 2;
        (p(m) ? r : l) = m;
    }
    return r; // = min { x in [l, r) | p(x) }, or r
}

bool pred(vector<vector<pair<int, int> > > const & g, ll limit) {
    function<vector<pair<ll, ll> > (int, int)> dfs = [&](int v, int parent) {
        if (g[v].size() == 1) {
            vector<pair<ll, ll> > result;
            result.emplace_back(0, 0);
            return result;
        }
        vector<pair<ll, ll> > left, right;
        for (auto edge : g[v]) {
            int w, value; tie(w, value) = edge;
            if (w == parent) continue;
            auto x = dfs(w, v);
            auto & y = left.empty() ? left : right;
            assert (y.empty());
            y = move(x);
            repeat (i, y.size()) {
                y[i].first  += value;
                y[i].second += value;
            }
        }
        vector<pair<ll, ll> > result;
        auto foo = [&]() {
            int i = 0;
            int j = right.size() - 1;
            while (i < left.size()) {
                while (j >= 0 and left[i].second + right[j].first > limit) -- j;
                if (j < 0) break;
                ll a = left[i].first;
                ll b = right[j].second;
                if (a > b) swap(a, b);
                result.emplace_back(a, b);
                ++ i;
            }
        };
        foo();
        left.swap(right);
        foo();
        repeat (i, left.size()) {
            swap(left[i].first, left[i].second);
        }
        whole(reverse, left);
        foo();
        left.swap(right);
        foo();
        whole(sort, result);
        result.erase(whole(unique, result, [&](auto x, auto y) { return x.second <= y.second; }), result.end());
        return result;
    };
    return not dfs(0, -1).empty();
}

constexpr ll inf = 1ll << 35;
int main() {
    int n; scanf("%d", &n);
    vector<vector<pair<int, int> > > g(n);
    repeat (i, n - 1) {
        int a, v; scanf("%d%d", &a, &v);
        g[a - 1].emplace_back(i + 1, v);
        g[i + 1].emplace_back(a - 1, v);
    }
    ll result = binsearch(0, inf, [&](ll limit) {
        return pred(g, limit);
    });
    printf("%lld\n", result);
    return 0;
}

Submission Info

Judge Result