oj.uz

Submission #206269

# Submission time Handle Problem Language Result Execution time Memory
206269 2020-03-02T22:13:11 Z achibasadzishvili Beads and wires (APIO14_beads) C++17
0 / 100
 12 ms 12024 KB 
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,dp[2][500005];
vector<pair<ll,ll> >v[500005];
void solve(ll x,ll par,ll dis){
    ll mx1 = -99999999999 , mx2 = -99999999999 , sum = 0;
    for(int i=0; i<v[x].size(); i++)
        if(v[x][i].f != par){
            ll to = v[x][i].f;
            solve(to , x , v[x][i].s);
            sum += max(dp[0][to] , dp[1][to]);
            ll cur = dp[0][to] + v[x][i].s - max(dp[0][to] , dp[1][to]);
            if(cur > mx1)mx2 = mx1 , mx1 = cur;
            else if(cur > mx2)mx2 = cur;
        }
    if(v[x].size() - 1 + (x == 1) > 1)dp[0][x] = max(sum , sum + mx1 + mx2);
    if(x != 1 && v[x].size() > 1)
        dp[1][x] = sum + mx1 + dis;
    //cout << x << " " << dp[0][x] << " " << dp[1][x] << '\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin >> n;
    
    for(int i=1; i<n; i++){
        ll x,y,z;
        cin >> x >> y >> z;
        v[x].pb(mp(y , z));
        v[y].pb(mp(x , z));
    }
    
    solve(1 , 0 , 0);
    
    cout << max(dp[0][1] , dp[1][1]) << '\n';
    
    
    return 0;
}

Compilation message

beads.cpp: In function 'void solve(long long int, long long int, long long int)':
beads.cpp:12:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<v[x].size(); i++)
                  ~^~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12024 KB Output is correct
3 Incorrect 12 ms 12024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12024 KB Output is correct
3 Incorrect 12 ms 12024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12024 KB Output is correct
3 Incorrect 12 ms 12024 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12024 KB Output is correct
3 Incorrect 12 ms 12024 KB Output isn't correct
4 Halted 0 ms 0 KB -