結果

問題 No.1488 Max Score of the Tree
ユーザー r1933r1933
提出日時 2021-04-24 00:21:00
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 6,678 bytes
コンパイル時間 2,787 ms
コンパイル使用メモリ 219,860 KB
実行使用メモリ 82,328 KB
最終ジャッジ日時 2023-09-17 13:16:37
合計ジャッジ時間 5,139 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 75 ms
78,800 KB
testcase_01 AC 72 ms
75,636 KB
testcase_02 AC 76 ms
79,732 KB
testcase_03 AC 81 ms
82,240 KB
testcase_04 AC 81 ms
82,324 KB
testcase_05 AC 1 ms
4,384 KB
testcase_06 AC 21 ms
23,092 KB
testcase_07 AC 47 ms
48,444 KB
testcase_08 AC 32 ms
34,668 KB
testcase_09 AC 24 ms
25,500 KB
testcase_10 AC 48 ms
49,764 KB
testcase_11 AC 81 ms
82,236 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 12 ms
14,396 KB
testcase_14 AC 39 ms
40,832 KB
testcase_15 AC 25 ms
26,700 KB
testcase_16 AC 6 ms
7,596 KB
testcase_17 AC 16 ms
17,940 KB
testcase_18 AC 53 ms
55,792 KB
testcase_19 AC 30 ms
32,424 KB
testcase_20 AC 13 ms
14,864 KB
testcase_21 AC 7 ms
9,120 KB
testcase_22 AC 24 ms
26,080 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 19 ms
21,068 KB
testcase_27 AC 4 ms
5,688 KB
testcase_28 AC 10 ms
11,484 KB
testcase_29 AC 13 ms
14,352 KB
testcase_30 AC 65 ms
66,688 KB
testcase_31 AC 81 ms
82,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"

// Begin Header {{{
#pragma region
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
#define let const auto

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
    for (auto &v: vs) is >> v;
    return is;
}

template <class T, class U>
inline istream& operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
    static constexpr const char *delim[] = {" ", ""};
    for (auto it = begin(vs); it != end(vs); ++it) {
        os << delim[it == begin(vs)] << *it;
    }
    return os;
}

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
    return vector<T>(sz, init_value);
}

template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

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

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

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void operator|=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs | rhs;
}

void operator&=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs & rhs;
}

void operator^=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs ^ rhs;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header

// Edge {{{
template <class Weight>
struct Edge {
    size_t from, to;
    Weight weight;

    Edge() {}
    Edge(size_t from, size_t to, Weight weight = 1) :
        from(from), to(to), weight(weight)
    {}

    bool operator<(const Edge &rhs) const {
        return weight < rhs.weight;
    }

    bool operator>(const Edge &rhs) const {
        return weight > rhs.weight;
    }

    operator size_t() const {
        return to;
    }
};
// }}}

// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
    using graph = vector<vector<Edge<Weight>>>;

public:
    Graph() {}
    Graph(const size_t V) : graph(V) {}

    void connect(size_t from, size_t to, Weight weight = 1) {
        (*this)[from].emplace_back(from, to, weight);
    }

    friend ostream& operator<<(ostream &strm, const Graph &G) {
        for (size_t v = 0; v < G.size(); ++v) {
            strm << '[' << setw(2) << v << ']';
            for (const auto &e: G[v]) {
                strm << ' ' << setw(2) << e.to;
            }
            strm << '\n';
        }
        return strm;
    }
};
// }}}

signed main() {
    ioinit();

    var(usize, N);
    var(imax, K);

    Graph<usize> G(N);
    vector<imax> cs(N);
    rep(i, 0, N - 1) {
        var(usize, a, b);
        a--, b--;
        input(cs[i]);
        G.connect(a, b, i);
        G.connect(b, a, i);
    }

    vector<imax> ns(N);
    let dfs = makeFixPoint([&](auto dfs, int cur, int par, int e) -> imax {
        imax ret = 0;
        for (let e: G[cur]) {
            if (e.to == par) continue;
            ret += dfs(e.to, cur, e.weight);
        }
        if (ret == 0) ret = 1;
        if (e != -1) ns[e] = ret;
        return ret;
    });
    dfs(0, -1, -1);

    auto dp = makeVector<imax>(0, N, K + 1);
    // dp[i][j] := 現在 i 番目、総和 j であるときの最大値
    rep(i, 0, N - 1) repc(j, 0, K) {
        chmax(dp[i + 1][j], dp[i][j]);
        if (j - cs[i] >= 0) {
            chmax(dp[i + 1][j], dp[i][j - cs[i]] + cs[i] * ns[i]);
        }
    }

    imax sum = 0;
    rep(i, 0, N - 1) sum += cs[i] * ns[i];
    imax res = 0;
    repc(j, 0, K) {
        chmax(res, sum + dp[N - 1][j]);
    }
    output(res);
    return 0;
}
0