Submission #1843486


Source Code Expand

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long

struct edge { int t,next; }a[400010];

int head[200010],mx1[200010],mx2[200010],mn[200010],sum[200010],n,tot;
char bo[200010];
ll ans;

inline int rd()
{
	int x=0;char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar());
	for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
	return x;
}

inline void add(int x,int y) { a[++tot].t=y;a[tot].next=head[x];head[x]=tot; }

inline void dfs(int x,int y)
{
	mn[x]=2123333333;
	if (bo[x]=='1') sum[x]++,mn[x]=0;
	for (int i=head[x];i;i=a[i].next)
	{
		int t=a[i].t;
		if (t==y) continue;
		dfs(t,x);
		sum[x]+=sum[t];
		int hh=mx1[t]+1;
		if (mx1[x]<hh) mx2[x]=mx1[x],mx1[x]=hh;
		else mx2[x]=max(mx2[x],hh);
		if (sum[t]) mn[x]=min(mn[x],hh);
	}
}

inline void dfs1(int x,int y)
{
	for (int i=head[x];i;i=a[i].next)
	{
		int t=a[i].t;
		if (t==y) continue;
		int hh=(mx1[x]==mx1[t]+1)?mx2[x]+1:mx1[x]+1;
		if (mx1[t]<hh) mx2[t]=mx1[t],mx1[t]=hh;
		else mx2[t]=max(mx2[t],hh);
		if (sum[t]<sum[1]) mn[t]=min(mn[t],hh);
		dfs1(t,x);
	}
	int hh=min(mx2[x]+1,mx1[x]-1);
	if (hh>=mn[x]) ans+=hh-mn[x]+1;
}

int main()
{
	n=rd();tot=0;
	for (int i=1;i<n;i++)
	{
		int x=rd(),y=rd();
		add(x,y);add(y,x);
	}
	scanf("%s",bo+1);
	ans=0LL;dfs(1,0);dfs1(1,0);
	printf("%lld\n",ans+1);
	return 0;
}

Submission Info

Submission Time
Task F - Black Radius
User DCXDCX
Language C++14 (GCC 5.4.1)
Score 1900
Code Size 1411 Byte
Status AC
Exec Time 53 ms
Memory 11136 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",bo+1);
                  ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 1300 / 1300 600 / 600
Status
AC × 3
AC × 31
AC × 81
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 AC 2 ms 4352 KB
0_01.txt AC 2 ms 4352 KB
0_02.txt AC 2 ms 4352 KB
1_00.txt AC 2 ms 4352 KB
1_01.txt AC 49 ms 11136 KB
1_02.txt AC 48 ms 9856 KB
1_03.txt AC 48 ms 7552 KB
1_04.txt AC 38 ms 7424 KB
1_05.txt AC 30 ms 7424 KB
1_06.txt AC 42 ms 7424 KB
1_07.txt AC 42 ms 7424 KB
1_08.txt AC 44 ms 7808 KB
1_09.txt AC 47 ms 9344 KB
1_10.txt AC 45 ms 8960 KB
1_11.txt AC 47 ms 11136 KB
1_12.txt AC 43 ms 8192 KB
1_13.txt AC 47 ms 9216 KB
1_14.txt AC 44 ms 8192 KB
1_15.txt AC 44 ms 7808 KB
1_16.txt AC 45 ms 8448 KB
1_17.txt AC 48 ms 8960 KB
1_18.txt AC 44 ms 7424 KB
1_19.txt AC 43 ms 7424 KB
1_20.txt AC 45 ms 7424 KB
1_21.txt AC 47 ms 7680 KB
1_22.txt AC 39 ms 7424 KB
1_23.txt AC 40 ms 7424 KB
1_24.txt AC 46 ms 7680 KB
1_25.txt AC 40 ms 8064 KB
1_26.txt AC 40 ms 7296 KB
1_27.txt AC 38 ms 7424 KB
1_28.txt AC 39 ms 7552 KB
1_29.txt AC 42 ms 8320 KB
2_00.txt AC 2 ms 4352 KB
2_01.txt AC 48 ms 11008 KB
2_02.txt AC 48 ms 10496 KB
2_03.txt AC 53 ms 10240 KB
2_04.txt AC 48 ms 9216 KB
2_05.txt AC 47 ms 9344 KB
2_06.txt AC 49 ms 9600 KB
2_07.txt AC 46 ms 7424 KB
2_08.txt AC 45 ms 7424 KB
2_09.txt AC 46 ms 7424 KB
2_10.txt AC 37 ms 7424 KB
2_11.txt AC 35 ms 7424 KB
2_12.txt AC 36 ms 7424 KB
2_13.txt AC 31 ms 6656 KB
2_14.txt AC 29 ms 7296 KB
2_15.txt AC 30 ms 7424 KB
2_16.txt AC 44 ms 7424 KB
2_17.txt AC 42 ms 7424 KB
2_18.txt AC 44 ms 7424 KB
2_19.txt AC 42 ms 7424 KB
2_20.txt AC 41 ms 7424 KB
2_21.txt AC 43 ms 7424 KB
2_22.txt AC 43 ms 7680 KB
2_23.txt AC 43 ms 7936 KB
2_24.txt AC 47 ms 7808 KB
2_25.txt AC 47 ms 9472 KB
2_26.txt AC 48 ms 9088 KB
2_27.txt AC 49 ms 9472 KB
2_28.txt AC 44 ms 8832 KB
2_29.txt AC 47 ms 10624 KB
2_30.txt AC 46 ms 9984 KB
2_31.txt AC 47 ms 8960 KB
2_32.txt AC 41 ms 7552 KB
2_33.txt AC 45 ms 8192 KB
2_34.txt AC 45 ms 8704 KB
2_35.txt AC 46 ms 9600 KB
2_36.txt AC 48 ms 7424 KB
2_37.txt AC 44 ms 7424 KB
2_38.txt AC 45 ms 7808 KB
2_39.txt AC 45 ms 7552 KB
2_40.txt AC 37 ms 7424 KB
2_41.txt AC 40 ms 7424 KB
2_42.txt AC 34 ms 7424 KB
2_43.txt AC 45 ms 9216 KB
2_44.txt AC 35 ms 7424 KB
2_45.txt AC 32 ms 7424 KB
2_46.txt AC 33 ms 7552 KB
2_47.txt AC 42 ms 8448 KB