oj.uz

Submission #125122

# Submission time Handle Problem Language Result Execution time Memory
125122 2019-07-04T16:23:27 Z TadijaSebez Beads and wires (APIO14_beads) C++11
100 / 100
 245 ms 22372 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=200050;
const int inf=1e9+7;
vector<pair<int,int>> E[N];
int dp[N][2],up[N][2];
void DFS(int u, int p, int w)
{
	dp[u][0]=0;
	int mx=-inf;
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first;
		DFS(v,u,e.second);
		dp[u][0]+=max(dp[v][0],dp[v][1]);
		mx=max(mx,dp[v][0]+w+e.second-max(dp[v][0],dp[v][1]));
	}
	dp[u][1]=dp[u][0]+mx;
}
int ans;
void Solve(int u, int p, int w)
{
	ans=max(ans,max(up[u][0],up[u][1])+dp[u][0]);
	int fir=-inf,sec=-inf,cnt=0;
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first;
		int tmp=dp[v][0]-max(dp[v][0],dp[v][1])+e.second;
		if(fir<tmp) sec=fir,fir=tmp;
		else if(sec<tmp) sec=tmp;
		cnt++;
	}
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first;
		int tmp=dp[v][0]-max(dp[v][0],dp[v][1])+e.second;
		int sum=dp[u][0]-max(dp[v][0],dp[v][1]);
		if(u!=1) up[v][1]=up[u][0]+w+e.second+sum;
		if(cnt>1)
		{
			int add=fir;
			if(fir==tmp) add=sec;
			up[v][1]=max(up[v][1],max(up[u][1],up[u][0])+e.second+add+sum);
		}
		up[v][0]=max(up[u][0],up[u][1])+sum;
		Solve(v,u,e.second);
	}
}
int main()
{
	int n,u,v,w;
	scanf("%i",&n);
	for(int i=1;i<n;i++) scanf("%i %i %i",&u,&v,&w),E[u].pb({v,w}),E[v].pb({u,w});
	DFS(1,0,0);
	Solve(1,0,0);
    printf("%i\n",ans);
	return 0;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
beads.cpp:54:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<n;i++) scanf("%i %i %i",&u,&v,&w),E[u].pb({v,w}),E[v].pb({u,w});
                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 19 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 4984 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 9 ms 5116 KB Output is correct
24 Correct 9 ms 5368 KB Output is correct
25 Correct 10 ms 5240 KB Output is correct
26 Correct 13 ms 5496 KB Output is correct
27 Correct 12 ms 5496 KB Output is correct
28 Correct 11 ms 5624 KB Output is correct
29 Correct 12 ms 5624 KB Output is correct
30 Correct 12 ms 5496 KB Output is correct
31 Correct 13 ms 5884 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 19 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 4984 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 9 ms 5116 KB Output is correct
24 Correct 9 ms 5368 KB Output is correct
25 Correct 10 ms 5240 KB Output is correct
26 Correct 13 ms 5496 KB Output is correct
27 Correct 12 ms 5496 KB Output is correct
28 Correct 11 ms 5624 KB Output is correct
29 Correct 12 ms 5624 KB Output is correct
30 Correct 12 ms 5496 KB Output is correct
31 Correct 13 ms 5884 KB Output is correct
32 Correct 43 ms 7672 KB Output is correct
33 Correct 44 ms 7772 KB Output is correct
34 Correct 51 ms 7672 KB Output is correct
35 Correct 229 ms 19064 KB Output is correct
36 Correct 243 ms 19192 KB Output is correct
37 Correct 245 ms 19152 KB Output is correct
38 Correct 160 ms 19552 KB Output is correct
39 Correct 166 ms 19516 KB Output is correct
40 Correct 190 ms 19484 KB Output is correct
41 Correct 233 ms 22372 KB Output is correct