提出 #57460894

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
constexpr ll INF = 1e12 + 7;
constexpr ll mod = 1e9 + 7;
constexpr ld eps = 1e-9;
const ld PI = acos(-1);

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<vector<pl>> g(n);
    ll s = 0;
    for (ll i = 0; i < n - 1; ++i) {
        ll u, v, w;
        cin >> u >> v >> w;
        --u, --v;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
        s += w *2;
    }
    ll res = s;
    auto dfs = [&](auto &&dfs, int v, int p) -> ll {
        ll mx = 0;
        for (auto [to, w]: g[v]) {
            if(to==p)continue;
            ll it = dfs(dfs, to, v) + w;
            res = min(res, s - (mx + it));
            mx = max(mx, it);
        }
        return mx;
    };
    dfs(dfs, 0, -1);
    cout << res;

}

提出情報

ジャッジ結果