結果

問題 No.2439 Fragile Apple Tree
ユーザー ebi_flyebi_fly
提出日時 2023-10-19 17:58:28
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,678 ms / 10,000 ms
コード長 18,336 bytes
コンパイル時間 4,595 ms
コンパイル使用メモリ 225,876 KB
実行使用メモリ 101,652 KB
最終ジャッジ日時 2024-09-19 14:18:02
合計ジャッジ時間 26,851 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 649 ms
71,948 KB
testcase_01 AC 1,412 ms
86,408 KB
testcase_02 AC 1,324 ms
86,392 KB
testcase_03 AC 484 ms
101,652 KB
testcase_04 AC 708 ms
101,652 KB
testcase_05 AC 1,212 ms
86,400 KB
testcase_06 AC 1,322 ms
86,264 KB
testcase_07 AC 1,669 ms
87,012 KB
testcase_08 AC 1,674 ms
86,884 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 1,678 ms
83,208 KB
testcase_15 AC 904 ms
86,396 KB
testcase_16 AC 1,211 ms
86,388 KB
testcase_17 AC 1,177 ms
86,388 KB
testcase_18 AC 512 ms
71,108 KB
testcase_19 AC 396 ms
37,152 KB
testcase_20 AC 171 ms
30,876 KB
testcase_21 AC 47 ms
5,376 KB
testcase_22 AC 650 ms
46,960 KB
testcase_23 AC 290 ms
23,876 KB
testcase_24 AC 326 ms
34,308 KB
testcase_25 AC 339 ms
58,368 KB
testcase_26 AC 426 ms
66,676 KB
testcase_27 AC 290 ms
43,692 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 666 ms
87,008 KB
testcase_32 AC 573 ms
87,004 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "test/yuki/yuki_2439.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/2439"

#line 1 "template/template.hpp"
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numbers>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}
#line 2 "template/io.hpp"

#line 7 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 7 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T safe_ceil(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return (a / b) + 1;
    else
        return -((-a) / b);
}

template <class T> T safe_floor(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return a / b;
    else
        return -((-a) / b) - 1;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "graph/template.hpp"

#line 4 "graph/template.hpp"

namespace ebi {

template <class T> struct Edge {
    int to;
    T cost;
    Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}
};

template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {
    using std::vector<std::vector<Edge<T>>>::vector;
    void add_edge(int u, int v, T w, bool directed = false) {
        (*this)[u].emplace_back(v, w);
        if (directed) return;
        (*this)[v].emplace_back(u, w);
    }
};

struct graph : std::vector<std::vector<int>> {
    using std::vector<std::vector<int>>::vector;
    void add_edge(int u, int v, bool directed = false) {
        (*this)[u].emplace_back(v);
        if (directed) return;
        (*this)[v].emplace_back(u);
    }
};

}  // namespace ebi
#line 2 "tree/heavy_light_decomposition.hpp"

#line 6 "tree/heavy_light_decomposition.hpp"

namespace ebi {

struct heavy_light_decomposition {
  private:
    void dfs_sz(int v) {
        for (auto &nv : g[v]) {
            if (nv == par[v]) continue;
            par[nv] = v;
            depth[nv] = depth[v] + 1;
            dfs_sz(nv);
            sz[v] += sz[nv];
            if (sz[nv] > sz[g[v][0]] || g[v][0] == par[v])
                std::swap(nv, g[v][0]);
        }
    }

    void dfs_hld(int v) {
        in[v] = t++;
        rev[in[v]] = v;
        for (auto nv : g[v]) {
            if (nv == par[v]) continue;
            nxt[nv] = (nv == g[v][0] ? nxt[v] : nv);
            dfs_hld(nv);
        }
        out[v] = t;
    }

    // [u, v) パスの取得 (v は u の祖先)
    std::vector<std::pair<int, int>> ascend(int u, int v) const {
        std::vector<std::pair<int, int>> res;
        while (nxt[u] != nxt[v]) {
            res.emplace_back(in[u], in[nxt[u]]);
            u = par[nxt[u]];
        }
        if (u != v) res.emplace_back(in[u], in[v] + 1);
        return res;
    }

    // (u, v] パスの取得 (u は v の祖先)
    std::vector<std::pair<int, int>> descend(int u, int v) const {
        if (u == v) return {};
        if (nxt[u] == nxt[v]) return {{in[u] + 1, in[v]}};
        auto res = descend(u, par[nxt[v]]);
        res.emplace_back(in[nxt[v]], in[v]);
        return res;
    }

  public:
    heavy_light_decomposition(const std::vector<std::vector<int>> &gh,
                              int root = 0)
        : n(gh.size()),
          g(gh),
          sz(n, 1),
          in(n),
          out(n),
          nxt(n),
          par(n, -1),
          depth(n, 0),
          rev(n) {
        dfs_sz(root);
        dfs_hld(root);
    }

    int idx(int u) const {
        return in[u];
    }

    int rev_idx(int i) const {
        return rev[i];
    }

    int la(int v, int k) const {
        while (1) {
            int u = nxt[v];
            if (in[u] <= in[v] - k) return rev[in[v] - k];
            k -= in[v] - in[u] + 1;
            v = par[u];
        }
    }

    int lca(int u, int v) const {
        while (nxt[u] != nxt[v]) {
            if (in[u] < in[v]) std::swap(u, v);
            u = par[nxt[u]];
        }
        return depth[u] < depth[v] ? u : v;
    }

    int jump(int s, int t, int i) const {
        if (i == 0) return s;
        int l = lca(s, t);
        int d = depth[s] + depth[t] - depth[l] * 2;
        if (d < i) return -1;
        if (depth[s] - depth[l] >= i) return la(s, i);
        i = d - i;
        return la(t, i);
    }

    std::vector<int> path(int s, int t) const {
        int l = lca(s, t);
        std::vector<int> a, b;
        for (; s != l; s = par[s]) a.emplace_back(s);
        for (; t != l; t = par[t]) b.emplace_back(t);
        a.emplace_back(l);
        std::reverse(b.begin(), b.end());
        a.insert(a.end(), b.begin(), b.end());
        return a;
    }

    int distance(int u, int v) const {
        return depth[u] + depth[v] - 2 * depth[lca(u, v)];
    }

    int distance_from_root(int v) const {
        return depth[v];
    }

    bool at_path(int u, int v, int s) const {
        return distance(u, v) == distance(u, s) + distance(s, v);
    }

    template <class F>
    void path_noncommutative_query(int u, int v, bool vertex,
                                   const F &f) const {
        int l = lca(u, v);
        for (auto [a, b] : ascend(u, l)) f(a + 1, b);
        if (vertex) f(in[l], in[l] + 1);
        for (auto [a, b] : descend(l, v)) f(a, b + 1);
    }

    std::vector<std::pair<int, int>> path_sections(int u, int v,
                                                   bool vertex) const {
        int l = lca(u, v);
        std::vector<std::pair<int, int>> sections;
        for (auto [a, b] : ascend(u, l)) sections.emplace_back(a + 1, b);
        if (vertex) sections.emplace_back(in[l], in[l] + 1);
        for (auto [a, b] : descend(l, v)) sections.emplace_back(a, b + 1);
        return sections;
    }

    template <class F>
    int max_path(int u, int v, bool vertex, F binary_search) const {
        int prev = -1;
        int l = lca(u, v);
        for (auto [a, b] : ascend(u, l)) {
            a++;
            int m = binary_search(a, b);
            if (m == b) {
                prev = rev[b];
            } else {
                return (m == a ? prev : rev[m]);
            }
        }
        if (vertex) {
            int m = binary_search(in[l], in[l] + 1);
            if (m == in[l]) {
                return prev;
            } else {
                prev = l;
            }
        }
        for (auto [a, b] : descend(l, v)) {
            b++;
            int m = binary_search(a, b);
            if (m == b) {
                prev = rev[b - 1];
            } else {
                return m == a ? prev : rev[m - 1];
            }
        }
        return v;
    }

    template <class F> void subtree_query(int u, bool vertex, const F &f) {
        f(in[u] + int(!vertex), out[u]);
    }

  private:
    int n;
    std::vector<std::vector<int>> g;
    std::vector<int> sz, in, out, nxt, par, depth, rev;

    int t = 0;
};

}  // namespace ebi
#line 2 "data_structure/lazy_segtree.hpp"

/*
    reference:
   https://atcoder.github.io/ac-library/master/document_ja/lazysegtree.html
*/

#line 11 "data_structure/lazy_segtree.hpp"

namespace ebi {

template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
          F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
  private:
    void update(int i) {
        data[i] = op(data[2 * i], data[2 * i + 1]);
    }

    void all_apply(int k, F f) {
        data[k] = mapping(f, data[k]);
        if (k < sz) lazy[k] = composition(f, lazy[k]);
    }

    void push(int i) {
        all_apply(2 * i, lazy[i]);
        all_apply(2 * i + 1, lazy[i]);
        lazy[i] = id();
    }

  public:
    lazy_segtree(int _n) : lazy_segtree(std::vector<S>(_n, e())) {}
    lazy_segtree(const std::vector<S> &a)
        : n(a.size()),
          sz(std::bit_ceil(a.size())),
          log(std::countr_zero(u32(sz))) {
        data = std::vector<S>(2 * sz, e());
        lazy = std::vector<F>(sz, id());
        for (int i : std::views::iota(0, n)) {
            data[sz + i] = a[i];
        }
        for (int i : std::views::iota(1, sz) | std::views::reverse) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < n);
        p += sz;
        for (int i = log; i >= 1; i--) push(p >> i);
        data[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < n);
        p += sz;
        for (int i = log; i >= 1; i--) push(p >> i);
        return data[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= n);
        if (l == r) return e();

        l += sz;
        r += sz;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, data[l++]);
            if (r & 1) smr = op(data[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    S all_prod() const {
        return data[1];
    }

    void apply(int p, F f) {
        assert(0 <= p && p < n);
        p += sz;
        for (int i = log; i >= 1; i--) push(p >> i);
        data[p] = mapping(f, data[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= n);
        l += sz;
        r += sz;
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int memo_l = l, memo_r = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = memo_l;
            r = memo_r;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= n);
        assert(g(e()));
        if (l == n) return n;
        l += sz;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, data[l]))) {
                while (l < sz) {
                    push(l);
                    l = l << 1;
                    if (g(op(sm, data[l]))) {
                        sm = op(sm, data[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            sm = op(sm, data[l]);
            l++;
        } while ((l & -l) != l);
        return n;
    }

    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= n);
        assert(g(e()));
        if (r == 0) return 0;
        r += sz;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && r % 2) r >>= 1;
            if (!g(op(data[r], sm))) {
                while (r < sz) {
                    push(r);
                    r = (r << 1) + 1;
                    if (g(op(data[r], sm))) {
                        sm = op(data[r], sm);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            sm = op(data[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int n, sz, log;
    std::vector<S> data;
    std::vector<F> lazy;
};

}  // namespace ebi
#line 7 "test/yuki/yuki_2439.test.cpp"

namespace ebi {

i64 op(i64 a, i64 b) {
    return a < b ? a : b;
}

i64 e() {
    return LNF;
}

i64 mapping(i64 f, i64 x) {
    return f + x;
}

i64 composition(i64 f, i64 g) {
    return f + g;
}

i64 id() {
    return 0;
}

void main_() {
    int n,q;
    std::cin >> n >> q;
    Graph<i64> G(n);
    graph g(n);
    rep(i,0,n-1) {
        int a,b;
        i64 c;
        std::cin >> a >> b >> c;
        a--; b--;
        g.add_edge(a, b);
        G.add_edge(a, b, c);
    }
    std::vector<int> par(n, -1);
    std::vector<i64> c(n, 0);
    auto dfs = [&](auto &&self, int v) -> void {
        for(auto e: G[v]) {
            if(e.to == par[v]) continue;
            par[e.to] = v;
            c[e.to] = e.cost;
            self(self, e.to);
        }
    };
    dfs(dfs, 0);
    heavy_light_decomposition hld(g);
    {
        std::vector<i64> cs(n, e());
        rep(i,1,n) {
            cs[hld.idx(i)] = c[i];
        }
        c = cs;
    }
    lazy_segtree<i64, op, e, i64, mapping, composition, id> seg(c);
    auto add_path = [&](int u, int v, i64 val) -> void {
        auto f = [&](int l, int r) -> void {
            if(l < r) seg.apply(l, r, val);
            else seg.apply(r, l, val);
        };
        hld.path_noncommutative_query(u, v, false, f);
    };
    auto path_min = [&](int u, int v) -> i64 {
        i64 ret = e();
        auto f = [&](int l, int r) -> void {
            if(l < r) ret = op(ret, seg.prod(l, r));
            else ret = op(ret, seg.prod(r, l));
        };
        hld.path_noncommutative_query(u, v, false, f);
        return ret;
    };
    std::vector<int> broken(n, 1);
    std::vector<i64> apples(n, 0);
    int ans = n;
    auto dfs_break = [&](auto &&self, int v) -> i64 {
        broken[v] = 0;
        ans--;
        i64 sum = apples[v];
        for(auto nv: g[v]) {
            if(nv == par[v]) continue;
            if(broken[nv] == 0) continue;
            sum += self(self, nv);
        }
        return sum;
    };
    while(q--) {
        int t;
        std::cin >> t;
        if(t == 1) {
            int v;
            i64 x;
            std::cin >> v >> x;
            v--;
            add_path(v, 0, -x);
            apples[v] += x;
            if(path_min(v, 0) > 0) continue;
            i64 ret = e();
            auto f = [&](i64 x) {
                return op(ret, x) > 0;
            };
            auto binary_search = [&](int a, int b) -> int {
                if(a > b) {
                    i64 x = seg.prod(b, a);
                    if(f(x)) {
                        ret = op(ret, x);
                        return b;
                    }
                    return seg.min_left(a, f);
                }
                else {
                    i64 x = seg.prod(a, b);
                    if(f(x)) {
                        ret = op(ret, x);
                        return b;
                    }
                    return seg.max_right(a, f);
                }
            };
            int nv = hld.max_path(v, 0, false, binary_search);
            if(nv == -1) nv = v;
            else nv = hld.jump(nv, 0, 1);
            assert(nv != -1 && broken[nv] > 0);
            i64 rem = dfs_break(dfs_break, nv);
            add_path(hld.jump(nv, 0, 1), 0, rem);
        }
        else {
            std::cout << ans << '\n';
        }
    }
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}
0