oj.uz

Submission #198217

# Submission time Handle Problem Language Result Execution time Memory
198217 2020-01-25T06:57:15 Z mehrdad_sohrabi Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 860 KB 
#include <bits/stdc++.h>
typedef int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int, int >
#define F first
#define S second
//#define int long long int
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define endl '\n'
using namespace std;
const int N=10002;
vector <pii> g[N];
ll vis[N];
ll ans=0;
ll dp[N][2];
void dfs(ll v,ll p,ll w){
    vector <pii> a;
    for (auto u : g[v]){
        if (u.F==p) continue;
        dfs(u.F,v,u.S);
        dp[v][1]+=dp[u.F][0];
        a.pb({dp[u.F][1]+u.S-dp[u.F][0],dp[u.F][0]});
    }
    sort(a.begin(),a.end());
    reverse(a.begin(),a.end());
    if (p!=-1 && a.size()){
        ll cnt=0;
        for (int i=0;i<a.size();i++){
            cnt+=a[i].S;
        }
        cnt+=a[0].F+w;
        dp[v][0]=max(dp[v][1],cnt);
    }
}
int32_t main(){
    sync;
    ll n;
    cin >> n;
    for (int i=0;i<n-1;i++){
        ll u,v,w;
        cin >> u >> v >> w;
        g[u].pb({v,w});
        g[v].pb({u,w});
    }
    ll ma=0;
    ll q=1e9,z=1;
    for (int i=1;i<=n;i++){
        if (g[i].size()!=1) continue;
        if (g[i][0].S<q){
            q=g[i][0].S;
            z=i;
        }
    }
    for (int i=z;i<=z;i++){
        //if (g[i].size()!=1) continue;
        memset(vis,0,sizeof vis);
        memset(dp,0,sizeof dp);
        ans=0;
        dfs(i,-1,0);
        ma=max(ma,dp[i][1]);
      //  cout << i << " " << dp[i][1] << endl;
    }
    z=g[z][0].F;
    for (int i=1;i<=n;i++){
        //if (g[i].size()!=1) continue;
        memset(vis,0,sizeof vis);
        memset(dp,0,sizeof dp);
        ans=0;
        dfs(i,-1,0);
        ma=max(ma,dp[i][1]);
      //  cout << i << " " << dp[i][1] << endl;
    }
    cout << ma << endl;
}
/*
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
*/
/*
6
1 2 20
2 3 20
3 4
10
3 5 10
3 6 10
*/

Compilation message

beads.cpp: In function 'void dfs(ll, ll, ll)':
beads.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<a.size();i++){
                      ~^~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 4 ms 764 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 6 ms 636 KB Output is correct
17 Correct 6 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 632 KB Output is correct
20 Correct 6 ms 760 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Execution timed out 1006 ms 860 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 4 ms 764 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 6 ms 636 KB Output is correct
17 Correct 6 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 632 KB Output is correct
20 Correct 6 ms 760 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Execution timed out 1006 ms 860 KB Time limit exceeded
24 Halted 0 ms 0 KB -