Submission #1869210


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=4e5+10;
int n,w[N],head[N],nxt[N];
void add(int f,int t){
	static int cnt=0;
	w[++cnt]=t;
	nxt[cnt]=head[f];
	head[f]=cnt;
}
char tp[N];
long long ans;
int mp[N],cp[N],up[N];
void dfs(int x,int fa){
    for (int i=head[x];i;i=nxt[i]){
        int v=w[i];
        if (v==fa) continue;
        dfs(v,x);
        if (up[v]>up[mp[x]]) cp[x]=mp[x],mp[x]=v;else
        if (up[v]>up[cp[x]]) cp[x]=v;
    }
    up[x]=up[mp[x]]+1;
}
int Max[N],Min[N];
void getmax(int x,int fa){
    for (int i=head[x];i;i=nxt[i]){
        int v=w[i];
        if (v==fa) continue;
        up[x]=up[v==mp[x]?cp[x]:mp[x]]+1;
        Max[v]=min(up[v]+1,up[x]);
        if (up[x]>up[mp[v]]) cp[v]=mp[v],mp[v]=x;else
        if (up[x]>up[cp[v]]) cp[v]=x;
        up[v]=up[mp[v]]+1;
        getmax(v,x);
        up[v]=up[x==mp[v]?cp[v]:mp[v]]+1;
        up[x]=up[mp[x]]+1;
    }
}
int ma[N],ci[N];
void DFS(int x,int fa){
	if (tp[x]=='0') ma[x]=ci[x]=1e9;else ma[x]=ci[x]=1;
	for (int i=head[x];i;i=nxt[i]){
		int v=w[i];
		if (v==fa) continue;
		up[x]=up[v==mp[x]?cp[x]:mp[x]]+1;
		up[v]=up[mp[v]]+1;
		DFS(v,x);
		up[v]=up[x==mp[v]?cp[v]:mp[v]]+1;
		if (tp[x]=='0'){
			int R=max(ma[v],min(up[v]+2,up[x]+1));
			R=max(min(R,up[v])+1,min(R-1,up[x]));
			if (R<ma[x]) ci[x]=ma[x],ma[x]=R;else ci[x]=min(ci[x],R);
		}
		up[x]=up[mp[x]]+1;
	}
}
void getmin(int x,int fa){
	Min[x]=ma[x];
	ans+=Max[x]-Min[x]+1;
	for (int i=head[x];i;i=nxt[i]){
		int v=w[i];
		if (v==fa) continue;
		up[x]=up[v==mp[x]?cp[x]:mp[x]]+1;
		if (tp[v]=='0'){
			int R=max(ma[x],min(up[x]+2,up[v]+1));
			R=max(min(R,up[x])+1,min(R-1,up[v]));
			if (R<ma[v]) ci[v]=ma[v],ma[v]=R;else ci[v]=min(ci[v],R);
		}
		up[v]=up[mp[v]]+1;
		getmin(v,x);
		up[v]=up[x==mp[v]?cp[v]:mp[v]]+1;
        up[x]=up[mp[x]]+1;
	}
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<n;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		add(u,v);add(v,u);
	}
	scanf("%s",tp+1);
	int root=0;
	for (int i=1;i<=n;i++)
		if (tp[i]=='1') root=i;
	dfs(root,0);getmax(root,0);
	DFS(root,0);getmin(root,0);
	printf("%lld\n",ans+up[root]);
	return 0;
}

Submission Info

Submission Time
Task F - Black Radius
User FoolMike
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 2220 Byte
Status WA
Exec Time 92 ms
Memory 23296 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:78:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:81:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&u,&v);
                      ^
./Main.cpp:84:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",tp+1);
                  ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 1300 / 1300 0 / 600
Status
AC × 3
AC × 31
AC × 38
WA × 43
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 3 ms 12544 KB
0_01.txt AC 3 ms 12544 KB
0_02.txt AC 3 ms 12544 KB
1_00.txt AC 3 ms 12544 KB
1_01.txt AC 89 ms 22272 KB
1_02.txt AC 87 ms 20992 KB
1_03.txt AC 82 ms 15360 KB
1_04.txt AC 60 ms 15360 KB
1_05.txt AC 58 ms 15360 KB
1_06.txt AC 72 ms 15360 KB
1_07.txt AC 72 ms 15360 KB
1_08.txt AC 74 ms 16256 KB
1_09.txt AC 82 ms 18176 KB
1_10.txt AC 81 ms 20608 KB
1_11.txt AC 85 ms 22016 KB
1_12.txt AC 75 ms 17152 KB
1_13.txt AC 82 ms 17792 KB
1_14.txt AC 75 ms 16768 KB
1_15.txt AC 75 ms 16128 KB
1_16.txt AC 81 ms 16768 KB
1_17.txt AC 85 ms 19200 KB
1_18.txt AC 79 ms 15360 KB
1_19.txt AC 74 ms 15360 KB
1_20.txt AC 80 ms 15488 KB
1_21.txt AC 83 ms 15872 KB
1_22.txt AC 65 ms 15360 KB
1_23.txt AC 67 ms 15360 KB
1_24.txt AC 72 ms 16000 KB
1_25.txt AC 66 ms 16512 KB
1_26.txt AC 67 ms 15232 KB
1_27.txt AC 65 ms 15360 KB
1_28.txt AC 63 ms 15616 KB
1_29.txt AC 74 ms 18048 KB
2_00.txt AC 3 ms 12544 KB
2_01.txt WA 90 ms 20608 KB
2_02.txt WA 91 ms 22784 KB
2_03.txt AC 92 ms 23296 KB
2_04.txt WA 90 ms 21248 KB
2_05.txt WA 90 ms 21120 KB
2_06.txt WA 89 ms 19072 KB
2_07.txt WA 85 ms 15360 KB
2_08.txt WA 85 ms 15360 KB
2_09.txt WA 85 ms 15360 KB
2_10.txt WA 63 ms 15360 KB
2_11.txt WA 63 ms 15360 KB
2_12.txt WA 63 ms 15360 KB
2_13.txt AC 59 ms 15360 KB
2_14.txt AC 57 ms 15360 KB
2_15.txt AC 57 ms 15360 KB
2_16.txt WA 76 ms 15360 KB
2_17.txt WA 76 ms 15360 KB
2_18.txt WA 76 ms 15360 KB
2_19.txt WA 77 ms 15360 KB
2_20.txt WA 76 ms 15360 KB
2_21.txt WA 77 ms 15360 KB
2_22.txt WA 79 ms 16256 KB
2_23.txt WA 78 ms 15872 KB
2_24.txt WA 79 ms 16128 KB
2_25.txt WA 87 ms 18688 KB
2_26.txt WA 85 ms 19712 KB
2_27.txt WA 86 ms 19456 KB
2_28.txt WA 82 ms 19200 KB
2_29.txt WA 91 ms 20864 KB
2_30.txt WA 85 ms 19456 KB
2_31.txt WA 87 ms 18432 KB
2_32.txt WA 78 ms 15616 KB
2_33.txt WA 80 ms 17024 KB
2_34.txt WA 82 ms 17024 KB
2_35.txt WA 88 ms 19584 KB
2_36.txt WA 83 ms 15360 KB
2_37.txt WA 82 ms 15360 KB
2_38.txt WA 78 ms 15872 KB
2_39.txt WA 85 ms 15488 KB
2_40.txt WA 67 ms 15360 KB
2_41.txt WA 73 ms 15360 KB
2_42.txt WA 62 ms 15360 KB
2_43.txt WA 80 ms 17792 KB
2_44.txt WA 66 ms 15360 KB
2_45.txt WA 61 ms 15360 KB
2_46.txt WA 62 ms 15488 KB
2_47.txt WA 72 ms 17408 KB