oj.uz

Submission #409747

# Submission time Handle Problem Language Result Execution time Memory
409747 2021-05-21T12:53:13 Z Kerim Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 3572 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
map<PII,int>dp[2];
vector<PII>adj[MAXN];
void dfs(int nd,int pr=-1,int w_p=-1){
	dp[0][mp(nd,pr)]=0;int mx=-INF,mx1=-INF;
	for(int i=0;i<int(adj[nd].size());i++){
		int to=adj[nd][i].ff;
		int w=adj[nd][i].ss;
		if(to==pr)continue;
		dfs(to,nd,w);
		w+=dp[0][mp(to,nd)]-dp[1][mp(to,nd)];
		dp[0][mp(nd,pr)]+=dp[1][mp(to,nd)];
		if(mx<w) mx1=mx,mx=w;
		else umax(mx1,w);
	}
	if(~pr)dp[1][mp(nd,pr)]=dp[0][mp(nd,pr)]+max(0,mx+w_p);
	else dp[0][mp(nd,pr)]+=max(0,mx+mx1);
}
int main(){
    //freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);
    for(int i=0;i<n-1;i++){
    	int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		adj[u].pb(mp(v,w));
		adj[v].pb(mp(u,w));	
    }int ans=0;
    for(int i=1;i<=n;i++)dfs(i),umax(ans,dp[0][mp(i,-1)]);
    printf("%d\n",ans);
	return 0;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
beads.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   scanf("%d%d%d",&u,&v,&w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 5 ms 2636 KB Output is correct
14 Correct 5 ms 2636 KB Output is correct
15 Correct 5 ms 2636 KB Output is correct
16 Correct 19 ms 2636 KB Output is correct
17 Correct 18 ms 2700 KB Output is correct
18 Correct 18 ms 2696 KB Output is correct
19 Correct 16 ms 2692 KB Output is correct
20 Correct 16 ms 2636 KB Output is correct
21 Correct 17 ms 2684 KB Output is correct
22 Correct 21 ms 2692 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 5 ms 2636 KB Output is correct
14 Correct 5 ms 2636 KB Output is correct
15 Correct 5 ms 2636 KB Output is correct
16 Correct 19 ms 2636 KB Output is correct
17 Correct 18 ms 2700 KB Output is correct
18 Correct 18 ms 2696 KB Output is correct
19 Correct 16 ms 2692 KB Output is correct
20 Correct 16 ms 2636 KB Output is correct
21 Correct 17 ms 2684 KB Output is correct
22 Correct 21 ms 2692 KB Output is correct
23 Execution timed out 1095 ms 3572 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 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 5 ms 2636 KB Output is correct
14 Correct 5 ms 2636 KB Output is correct
15 Correct 5 ms 2636 KB Output is correct
16 Correct 19 ms 2636 KB Output is correct
17 Correct 18 ms 2700 KB Output is correct
18 Correct 18 ms 2696 KB Output is correct
19 Correct 16 ms 2692 KB Output is correct
20 Correct 16 ms 2636 KB Output is correct
21 Correct 17 ms 2684 KB Output is correct
22 Correct 21 ms 2692 KB Output is correct
23 Execution timed out 1095 ms 3572 KB Time limit exceeded
24 Halted 0 ms 0 KB -