oj.uz

Submission #438488

# Submission time Handle Problem Language Result Execution time Memory
438488 2021-06-28T05:52:51 Z 2548631 Beads and wires (APIO14_beads) C++17
100 / 100
 274 ms 21436 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> cp;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
typedef vector<cp> vcp;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
 
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i,l,r) for( int i = (l) ; i < (r) ; i++ )
#define forb(i,r,l) for( int i = (r) ; i >= (l) ; i-- )
#define log2i(x) (64 - __builtin_clzll(1ll*(x)) - 1)
#define numBit(x) (__builtin_popcountll(1ll*(x)))
#define getBit(x,i) (x>>i&1)
#define Pi acos(-1.0l)
#define sz(x) (int)x.size()
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';
 
const int N = 2e5+7;
const int inf = 2e9+7;
int n,ans=0;
int dp[N][2];
vii edge[N];
 
void solve(int u, int par=-1) {
    int tot=0;
    for(auto v:edge[u]) if(v.fi!=par) {
        solve(v.fi,u);
        tot+=max(dp[v.fi][0],dp[v.fi][1]+v.se);
    }
    dp[u][0]=tot; dp[u][1]=-inf;
    for(auto v:edge[u]) if(v.fi!=par) {
        int sum=v.se+dp[v.fi][0]-max(dp[v.fi][0],dp[v.fi][1]+v.se);
        dp[u][1]=max(dp[u][1],sum+tot);
    }
}
 
void reroot(int u, int par=-1) {
    ans=max(ans,dp[u][0]);
    pii tmp={-inf,-inf};
    for(auto v:edge[u]) {
        int sum=v.se+dp[v.fi][0]-max(dp[v.fi][0],dp[v.fi][1]+v.se);
        if(tmp.fi<sum) tmp.se=tmp.fi, tmp.fi=sum;
        else if(tmp.fi==sum) tmp.se=sum;
        else tmp.se=max(tmp.se,sum);
    }
    for(auto v:edge[u]) if(v.fi!=par) {
        bool ma=(v.se+dp[v.fi][0]-max(dp[v.fi][0],dp[v.fi][1]+v.se)==tmp.fi);
        int tmp_dp=dp[v.fi][1];
        dp[u][1]-=max(dp[v.fi][0],dp[v.fi][1]+v.se);
        if(ma) dp[u][1]+=tmp.se-tmp.fi;
        dp[u][0]-=max(dp[v.fi][0],dp[v.fi][1]+v.se);
        dp[v.fi][1]+=max(dp[u][0],dp[u][1]+v.se);
        dp[v.fi][1]=max(dp[v.fi][1],dp[v.fi][0]+v.se+dp[u][0]);
        dp[v.fi][0]+=max(dp[u][0],dp[u][1]+v.se);
        reroot(v.fi,u);
        dp[v.fi][0]-=max(dp[u][0],dp[u][1]+v.se);
        dp[v.fi][1]=tmp_dp;
        dp[u][0]+=max(dp[v.fi][0],dp[v.fi][1]+v.se);
        dp[u][1]+=max(dp[v.fi][0],dp[v.fi][1]+v.se);
        if(ma) dp[u][1]-=tmp.se-tmp.fi;
    }
}
 
int main() {
    fastIO;
#ifndef ONLINE_JUDGE
    //freopen("test.inp","r",stdin);
    //freopen("test.out","w",stdout);
#endif // ONLINE_JUDGE
 
    cin >> n;
    forw(i,1,n) {
        int u,v,w; cin >> u >> v >> w;
        u--, v--;
        edge[u].pb(mp(v,w));
        edge[v].pb(mp(u,w));
    }
    solve(0);
    reroot(0);
    cout << ans;
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5020 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5020 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5020 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5020 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5020 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 7 ms 5196 KB Output is correct
24 Correct 6 ms 5288 KB Output is correct
25 Correct 7 ms 5196 KB Output is correct
26 Correct 15 ms 5536 KB Output is correct
27 Correct 9 ms 5580 KB Output is correct
28 Correct 8 ms 5580 KB Output is correct
29 Correct 8 ms 5580 KB Output is correct
30 Correct 8 ms 5580 KB Output is correct
31 Correct 9 ms 5980 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5020 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 5020 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 7 ms 5196 KB Output is correct
24 Correct 6 ms 5288 KB Output is correct
25 Correct 7 ms 5196 KB Output is correct
26 Correct 15 ms 5536 KB Output is correct
27 Correct 9 ms 5580 KB Output is correct
28 Correct 8 ms 5580 KB Output is correct
29 Correct 8 ms 5580 KB Output is correct
30 Correct 8 ms 5580 KB Output is correct
31 Correct 9 ms 5980 KB Output is correct
32 Correct 37 ms 8004 KB Output is correct
33 Correct 32 ms 7924 KB Output is correct
34 Correct 35 ms 8020 KB Output is correct
35 Correct 274 ms 17532 KB Output is correct
36 Correct 249 ms 17492 KB Output is correct
37 Correct 249 ms 17492 KB Output is correct
38 Correct 177 ms 17840 KB Output is correct
39 Correct 155 ms 17908 KB Output is correct
40 Correct 176 ms 17800 KB Output is correct
41 Correct 237 ms 21436 KB Output is correct