oj.uz

Submission #198225

# Submission time Handle Problem Language Result Execution time Memory
198225 2020-01-25T07:19:31 Z mehrdad_sohrabi Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 1144 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){
    ll ma=-1e9;
    ll d=0;
    for (auto u : g[v]){
        if (u.F==p) continue;
        dfs(u.F,v,u.S);
        dp[v][1]+=dp[u.F][0];
        d+=dp[u.F][0];
        ma=max(ma,u.S+dp[u.F][1]-dp[u.F][0]);
    }
    if (p!=-1 && ma>-1e9){
      //  if (ma!=a[0].F) cout << " oeijoehnr " << endl;
        ll cnt=d+ma+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});
    }
    for (int i=1;i<=n;i++){
        vector <pii> a;
        for (auto  q : g[i]){
           ll u=q.F;
            if (g[u].size()==1) a.pb({q.S,u});
        }
        sort(a.begin(),a.end());
        for (int j=1;j<a.size();j++){
            vis[a[j].S]=1;
        }
    }
    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;
        }
    }
    ll cnt=0;
    for (int i=1;i<=n;i++){
        if (g[i].size()!=1 && vis[i]!=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 'int32_t main()':
beads.cpp:52:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j=1;j<a.size();j++){
                      ~^~~~~~~~~
beads.cpp:57:14: warning: variable 'z' set but not used [-Wunused-but-set-variable]
     ll q=1e9,z=1;
              ^
beads.cpp:65:8: warning: unused variable 'cnt' [-Wunused-variable]
     ll cnt=0;
        ^~~

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 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 2 ms 660 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 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 636 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 4 ms 760 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 3 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 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 636 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 4 ms 760 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 474 ms 936 KB Output is correct
24 Correct 487 ms 988 KB Output is correct
25 Correct 479 ms 888 KB Output is correct
26 Execution timed out 1064 ms 1144 KB Time limit exceeded
27 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 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 3 ms 636 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 4 ms 760 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 474 ms 936 KB Output is correct
24 Correct 487 ms 988 KB Output is correct
25 Correct 479 ms 888 KB Output is correct
26 Execution timed out 1064 ms 1144 KB Time limit exceeded
27 Halted 0 ms 0 KB -