Submission #697832

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
697832	2023-02-11T07:12:03 Z	vjudge1	Beads and wires (APIO14_beads)	C++14	100 / 100	109 ms	15476 KB

beads

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5,INF=2e9;
int n,u,v,w,h[N],tot,f[N][2],g[N][2],ans,F0,F1,a[N],b[N],c[N];
struct edge {int to,val,nxt;}e[N<<1];
void add(int u,int v,int w)
{
	e[++tot]={v,w,h[u]};
	h[u]=tot;
}
void dfs1(int u,int fa)
{
	f[u][1]=-INF;
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].to,w=e[i].val;
		if(v==fa) continue;
		c[v]=w;dfs1(v,u);
		a[v]=max(f[v][0],f[v][1]+w);
		b[v]=w+f[v][0]-a[v];
		f[u][1]=max(f[u][1],b[v]);
		f[u][0]+=a[v];
	}
	f[u][1]+=f[u][0];
}
int F(int a,int b,int w) {return w+a-max(a,b+w);}
void dfs2(int u,int fa)
{
	int mx=-INF,sec=-INF;
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].to;
		if(v==fa) continue;
		if(b[v]>mx) sec=mx,mx=b[v];
		else sec=max(sec,b[v]);
	}
	int val=F(g[u][0],g[u][1],c[u]),sum=max(g[u][0],g[u][1]+c[u]);
	ans=max(ans,f[u][0]+sum);
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].to;
		if(v==fa) continue;
		g[v][0]=f[u][0]-a[v]+sum,g[v][1]=g[v][0];
		if(b[v]==mx) g[v][1]+=max(sec,val);
		else g[v][1]+=max(mx,val);
		dfs2(v,u);
	}
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<n;i++)
	{
		scanf("%d%d%d",&u,&v,&w);
		add(u,v,w),add(v,u,w);
	}
	dfs1(1,0);c[1]=-INF;dfs2(1,0);
	printf("%d",ans);
	return 0;
}

Compilation message

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

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	3 ms	852 KB	Output is correct
27	Correct	3 ms	852 KB	Output is correct
28	Correct	4 ms	896 KB	Output is correct
29	Correct	4 ms	852 KB	Output is correct
30	Correct	3 ms	852 KB	Output is correct
31	Correct	5 ms	1236 KB	Output is correct

Subtask #4
43.0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	3 ms	852 KB	Output is correct
27	Correct	3 ms	852 KB	Output is correct
28	Correct	4 ms	896 KB	Output is correct
29	Correct	4 ms	852 KB	Output is correct
30	Correct	3 ms	852 KB	Output is correct
31	Correct	5 ms	1236 KB	Output is correct
32	Correct	16 ms	3064 KB	Output is correct
33	Correct	17 ms	3028 KB	Output is correct
34	Correct	18 ms	3088 KB	Output is correct
35	Correct	101 ms	11260 KB	Output is correct
36	Correct	98 ms	11196 KB	Output is correct
37	Correct	109 ms	11244 KB	Output is correct
38	Correct	76 ms	11124 KB	Output is correct
39	Correct	69 ms	11132 KB	Output is correct
40	Correct	72 ms	11216 KB	Output is correct
41	Correct	91 ms	15476 KB	Output is correct

Submission #697832

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 15.0 / 15.0

Subtask #3 29.0 / 29.0

Subtask #4 43.0 / 43.0

Subtask #1
13.0 / 13.0

Subtask #2
15.0 / 15.0

Subtask #3
29.0 / 29.0

Subtask #4
43.0 / 43.0