Submission #1868339


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];
void DFS(int x,int fa){
    Max[x]=up[x];
    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[x],另一个深度为up[v]
        ans+=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;
        DFS(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);
	dfs(1,0);DFS(1,0);
	printf("%lld\n",ans+Max[1]);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:47: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:50: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 × 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 3 ms 8448 KB
0_01.txt AC 3 ms 8448 KB
0_02.txt WA 3 ms 8448 KB
1_00.txt AC 3 ms 8448 KB
1_01.txt AC 65 ms 17920 KB
1_02.txt AC 63 ms 15360 KB
1_03.txt AC 60 ms 10880 KB
1_04.txt AC 48 ms 10752 KB
1_05.txt AC 44 ms 10752 KB
1_06.txt AC 55 ms 10752 KB
1_07.txt AC 55 ms 10752 KB
1_08.txt AC 56 ms 11392 KB
1_09.txt AC 60 ms 14336 KB
1_10.txt AC 59 ms 13824 KB
1_11.txt AC 62 ms 17920 KB
1_12.txt AC 56 ms 12416 KB
1_13.txt AC 60 ms 14080 KB
1_14.txt AC 57 ms 12160 KB
1_15.txt AC 56 ms 11520 KB
1_16.txt AC 59 ms 12800 KB
1_17.txt AC 62 ms 13568 KB
1_18.txt AC 58 ms 10752 KB
1_19.txt AC 56 ms 10752 KB
1_20.txt AC 59 ms 10880 KB
1_21.txt AC 61 ms 11264 KB
1_22.txt AC 51 ms 10752 KB
1_23.txt AC 52 ms 10752 KB
1_24.txt AC 55 ms 11264 KB
1_25.txt AC 52 ms 11904 KB
1_26.txt AC 51 ms 10752 KB
1_27.txt AC 51 ms 10752 KB
1_28.txt AC 48 ms 11008 KB
1_29.txt AC 57 ms 12416 KB
2_00.txt WA 3 ms 8448 KB
2_01.txt WA 66 ms 17664 KB
2_02.txt WA 64 ms 16512 KB
2_03.txt WA 64 ms 16128 KB
2_04.txt WA 63 ms 14208 KB
2_05.txt WA 64 ms 14336 KB
2_06.txt WA 65 ms 14848 KB
2_07.txt WA 61 ms 10880 KB
2_08.txt WA 61 ms 10880 KB
2_09.txt WA 61 ms 10880 KB
2_10.txt WA 49 ms 10752 KB
2_11.txt WA 48 ms 10752 KB
2_12.txt WA 48 ms 10752 KB
2_13.txt WA 46 ms 10752 KB
2_14.txt WA 44 ms 10752 KB
2_15.txt WA 44 ms 10752 KB
2_16.txt WA 55 ms 10752 KB
2_17.txt WA 55 ms 10752 KB
2_18.txt WA 56 ms 10752 KB
2_19.txt WA 55 ms 10752 KB
2_20.txt WA 55 ms 10752 KB
2_21.txt WA 59 ms 10752 KB
2_22.txt WA 57 ms 11264 KB
2_23.txt WA 56 ms 11648 KB
2_24.txt WA 57 ms 11520 KB
2_25.txt WA 61 ms 14592 KB
2_26.txt WA 61 ms 13952 KB
2_27.txt WA 61 ms 14592 KB
2_28.txt WA 61 ms 13568 KB
2_29.txt WA 64 ms 16768 KB
2_30.txt WA 69 ms 15744 KB
2_31.txt WA 63 ms 13696 KB
2_32.txt WA 56 ms 11008 KB
2_33.txt WA 57 ms 12288 KB
2_34.txt WA 58 ms 13440 KB
2_35.txt WA 61 ms 15104 KB
2_36.txt WA 60 ms 10752 KB
2_37.txt WA 58 ms 10752 KB
2_38.txt WA 57 ms 11392 KB
2_39.txt WA 60 ms 10880 KB
2_40.txt WA 50 ms 10752 KB
2_41.txt WA 53 ms 10752 KB
2_42.txt WA 48 ms 10752 KB
2_43.txt WA 58 ms 14208 KB
2_44.txt WA 49 ms 10752 KB
2_45.txt WA 46 ms 10752 KB
2_46.txt WA 46 ms 10880 KB
2_47.txt WA 54 ms 12800 KB