제출 #964505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964505		12345678	구슬과 끈 (APIO14_beads)	C++17	0 / 100	3 ms	6748 KiB

beads

#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;

#define ll long long

ll n, u, v, w, dp[2][nx];
vector<pair<ll, ll>> d[nx];

void dfs(int u, int p, ll pw)
{
    vector<ll> df;
    for (auto [v, w]:d[u]) if (v!=p) dfs(v, u, w), dp[0][u]+=dp[1][v], df.push_back(w+dp[0][v]-dp[1][v]);
    sort(df.begin(), df.end());
    reverse(df.begin(), df.end());
    if (w!=-1&&df.size()>=1) dp[1][u]=max(dp[0][u], dp[0][u]+df[0]+pw);
    if (df.size()>=2) dp[0][u]=max(dp[0][u], dp[0][u]+df[0]+df[1]);
    dp[1][u]=max(dp[1][u], dp[0][u]);
    //cout<<"debug "<<u<<' '<<dp[0][u]<<' '<<dp[1][u]<<'\n';
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<n; i++) cin>>u>>v>>w, d[u].push_back({v, w}), d[v].push_back({u, w});
    dfs(2, 2, -1);
    cout<<dp[0][2];
}
/*
10
4 10 2
1 2 21
1 3 13
6 7 1
7 9 5
2 4 3
2 5 8
1 6 55
6 8 34
*/

• Subtask 1: 0 / 13
• Subtask 2: 0 / 15
• Subtask 3: 0 / 29
• Subtask 4: 0 / 43