Submission #1694968


Source Code Expand

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>

using namespace std;
typedef long long LL;
const int maxn = 200005;

int ehead[maxn],ecnt;
struct edge {
	int u,v,next;
}edg[maxn<<1];
void add(int u,int v) {
	edg[++ecnt]=(edge){u,v,ehead[u]};
	ehead[u]=ecnt;
	edg[++ecnt]=(edge){v,u,ehead[v]};
	ehead[v]=ecnt;
}
char s[maxn];int n,low[maxn],high[maxn];LL ans;
int fa[maxn],f[maxn],g[maxn],stk[maxn],top,pos[maxn],idx;
void upd(int &x,int y) {x<y?x=y:0;}
void dfs(int u) {
	pos[++idx]=u;
	for (int v,j=ehead[u];j;j=edg[j].next)
	if ((v=edg[j].v)!=fa[u]) {
		fa[v]=u;dfs(v);f[u]=max(f[u],f[v]+1);
	}
}
void solve(int u) {
	int mx1=0,mx2=0,cur;top=0;
	g[u]>mx1?(mx2=mx1,mx1=g[u]):(g[u]>mx2?mx2=g[u]:0);
	for (int v,j=ehead[u];j;j=edg[j].next)
		if ((v=edg[j].v)!=fa[u]) stk[++top]=v;
	cur=g[u];
	for (int j=1;j<=top;j++) {
		int res=f[stk[j]]+1;
		res>mx1?(mx2=mx1,mx1=res):(res>mx2?mx2=res:0);
		upd(g[stk[j]],cur+1);upd(cur,res);
	}
	cur=g[u];
	for (int j=top;j>=1;j--) {
		int res=f[stk[j]]+1;
		upd(g[stk[j]],cur+1);upd(cur,res);
	}
	high[u]=min(mx1-1,mx2+1);
}
int main()
{
	#ifdef Amberframe
		freopen("agc008f.in","r",stdin);
		freopen("agc008f.out","w",stdout);
	#endif
	scanf("%d",&n);
	for (int u,v,i=1;i<n;i++)
		scanf("%d %d",&u,&v),add(u,v);
	scanf("%s",s+1);dfs(1);
	for (int i=1;i<=n;i++) solve(pos[i]);
	for (int i=1;i<=n;i++)
		ans+=max(0,high[i]-low[i]+1);
	printf("%lld",ans+1);
	return 0;
}

Submission Info

Submission Time
Task F - Black Radius
User Amberframe
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1501 Byte
Status WA
Exec Time 141 ms
Memory 17792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:54:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:56:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&u,&v),add(u,v);
                                ^
./Main.cpp:57:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);dfs(1);
                 ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 1300 / 1300 0 / 600
Status
AC × 1
WA × 2
AC × 31
AC × 31
WA × 50
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt, 2_41.txt, 2_42.txt, 2_43.txt, 2_44.txt, 2_45.txt, 2_46.txt, 2_47.txt
Case Name Status Exec Time Memory
0_00.txt WA 2 ms 4352 KB
0_01.txt AC 2 ms 4352 KB
0_02.txt WA 2 ms 4352 KB
1_00.txt AC 2 ms 4352 KB
1_01.txt AC 135 ms 17792 KB
1_02.txt AC 135 ms 15232 KB
1_03.txt AC 125 ms 10624 KB
1_04.txt AC 94 ms 11008 KB
1_05.txt AC 71 ms 11392 KB
1_06.txt AC 115 ms 10624 KB
1_07.txt AC 110 ms 10624 KB
1_08.txt AC 111 ms 11136 KB
1_09.txt AC 124 ms 14208 KB
1_10.txt AC 130 ms 13696 KB
1_11.txt AC 119 ms 17664 KB
1_12.txt AC 103 ms 12160 KB
1_13.txt AC 116 ms 13952 KB
1_14.txt AC 109 ms 11904 KB
1_15.txt AC 107 ms 11392 KB
1_16.txt AC 117 ms 12544 KB
1_17.txt AC 131 ms 13440 KB
1_18.txt AC 117 ms 10496 KB
1_19.txt AC 108 ms 10496 KB
1_20.txt AC 121 ms 10624 KB
1_21.txt AC 117 ms 11136 KB
1_22.txt AC 94 ms 10752 KB
1_23.txt AC 102 ms 10752 KB
1_24.txt AC 106 ms 11136 KB
1_25.txt AC 104 ms 12032 KB
1_26.txt AC 96 ms 10624 KB
1_27.txt AC 89 ms 10880 KB
1_28.txt AC 82 ms 11264 KB
1_29.txt AC 98 ms 12416 KB
2_00.txt WA 2 ms 4352 KB
2_01.txt WA 116 ms 17408 KB
2_02.txt WA 115 ms 16384 KB
2_03.txt WA 129 ms 16000 KB
2_04.txt WA 127 ms 14080 KB
2_05.txt WA 139 ms 14208 KB
2_06.txt WA 133 ms 14720 KB
2_07.txt WA 135 ms 10624 KB
2_08.txt WA 136 ms 10624 KB
2_09.txt WA 140 ms 10624 KB
2_10.txt WA 89 ms 11008 KB
2_11.txt WA 103 ms 11008 KB
2_12.txt WA 94 ms 11008 KB
2_13.txt WA 75 ms 11392 KB
2_14.txt WA 67 ms 11392 KB
2_15.txt WA 72 ms 11392 KB
2_16.txt WA 108 ms 10624 KB
2_17.txt WA 115 ms 10624 KB
2_18.txt WA 110 ms 10624 KB
2_19.txt WA 108 ms 10624 KB
2_20.txt WA 115 ms 10624 KB
2_21.txt WA 116 ms 10624 KB
2_22.txt WA 118 ms 11136 KB
2_23.txt WA 104 ms 11520 KB
2_24.txt WA 110 ms 11392 KB
2_25.txt WA 129 ms 14464 KB
2_26.txt WA 134 ms 13696 KB
2_27.txt WA 134 ms 14336 KB
2_28.txt WA 127 ms 13312 KB
2_29.txt WA 139 ms 16640 KB
2_30.txt WA 128 ms 15488 KB
2_31.txt WA 141 ms 13440 KB
2_32.txt WA 109 ms 10752 KB
2_33.txt WA 120 ms 12032 KB
2_34.txt WA 117 ms 13184 KB
2_35.txt WA 135 ms 14848 KB
2_36.txt WA 131 ms 10624 KB
2_37.txt WA 116 ms 10624 KB
2_38.txt WA 110 ms 11264 KB
2_39.txt WA 123 ms 10752 KB
2_40.txt WA 93 ms 10880 KB
2_41.txt WA 102 ms 10624 KB
2_42.txt WA 89 ms 10880 KB
2_43.txt WA 118 ms 14080 KB
2_44.txt WA 91 ms 10880 KB
2_45.txt WA 79 ms 11264 KB
2_46.txt WA 68 ms 11264 KB
2_47.txt WA 105 ms 12800 KB