Submission #2739111
Source Code Expand
#include<cmath> #include<math.h> #include<ctype.h> #include<algorithm> #include<bitset> #include<cassert> #include<cctype> #include<cerrno> #include<cfloat> #include<ciso646> #include<climits> #include<clocale> #include<complex> #include<csetjmp> #include<csignal> #include<cstdarg> #include<cstddef> #include<cstdio> #include<cstdlib> #include<cstring> #include<ctime> #include<cwchar> #include<cwctype> #include<deque> #include<exception> #include<fstream> #include<functional> #include<iomanip> #include<ios> #include<iosfwd> #include<iostream> #include<istream> #include<iterator> #include<limits> #include<list> #include<locale> #include<map> #include<memory> #include<new> #include<numeric> #include<ostream> #include<queue> #include<set> #include<sstream> #include<stack> #include<stdexcept> #include<streambuf> #include<string> #include<typeinfo> #include<utility> #include<valarray> #include<vector> #include<string.h> #include<stdlib.h> #include<stdio.h> using namespace std; int n,f[200010],g[200010],high[200010],low[200010]; int cnt,head[200010],to[400010],nxt[400010]; char s[200010]; int in[200010],out[200010]; void add(int x,int y) { cnt++; to[cnt]=y; nxt[cnt]=head[x]; head[x]=cnt; } void dfs1(int x,int fa) { if (s[x]=='1') { in[x]=true; } for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } dfs1(y,x); in[x]|=in[y]; f[x]=max(f[x],f[y]+1); } } void dfs2(int x,int fa) { int mx=0,mx2=0,sum=0; for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } if (f[y]+1>mx) { mx2=mx; mx=f[y]+1; } else if (f[y]+1>mx2) { mx2=f[y]+1; } sum+=in[y]; } for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } if (f[y]+1==mx) { g[y]=max(g[x]+1,mx2+1); } else { g[y]=max(g[x]+1,mx+1); } out[y]=out[x]; if (sum-in[y] || s[x]=='1') { out[y]=1; } dfs2(y,x); } } void dfs3(int x,int fa) { int mx=g[x],mx2=0; for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } if (f[y]+1>mx) { mx2=mx; mx=f[y]+1; } else if (f[y]+1>mx2) { mx2=f[y]+1; } } high[x]=min(mx2+1,mx-1); if (s[x]=='1') { low[x]=0; } else { low[x]=high[x]+1; if (out[x]) { low[x]=min(low[x],g[x]); } for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } if (in[y]) { low[x]=min(low[x],f[y]+1); } } } for (int i=head[x];i;i=nxt[i]) { int y=to[i]; if (y==fa) { continue; } dfs3(y,x); } } int main() { scanf("%d",&n); for (int i=1;i<n;i++) { int x,y; scanf("%d%d",&x,&y); add(x,y); add(y,x); } scanf("%s",s+1); dfs1(1,0); dfs2(1,0); dfs3(1,0); long long ans=0; for (int i=1;i<=n;i++) { ans+=1LL*(high[i]-low[i]+1); } ans++; printf("%lld\n",ans); return 0; } //一顾倾人城,再顾倾人国。 //——李延年《李延年歌》
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | Emma194 |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 3123 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 20992 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:187:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:191:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&x,&y); ^ ./Main.cpp:195:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s+1); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | 600 / 600 | ||||||
Status |
|
|
|
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 | 6400 KB |
0_01.txt | AC | 2 ms | 6400 KB |
0_02.txt | AC | 2 ms | 6400 KB |
1_00.txt | AC | 2 ms | 6400 KB |
1_01.txt | AC | 79 ms | 20992 KB |
1_02.txt | AC | 73 ms | 16768 KB |
1_03.txt | AC | 67 ms | 9088 KB |
1_04.txt | AC | 57 ms | 9088 KB |
1_05.txt | AC | 49 ms | 8448 KB |
1_06.txt | AC | 62 ms | 9088 KB |
1_07.txt | AC | 63 ms | 9088 KB |
1_08.txt | AC | 64 ms | 9984 KB |
1_09.txt | AC | 71 ms | 14976 KB |
1_10.txt | AC | 68 ms | 14080 KB |
1_11.txt | AC | 72 ms | 20864 KB |
1_12.txt | AC | 64 ms | 11776 KB |
1_13.txt | AC | 70 ms | 14592 KB |
1_14.txt | AC | 65 ms | 11392 KB |
1_15.txt | AC | 65 ms | 10368 KB |
1_16.txt | AC | 67 ms | 12288 KB |
1_17.txt | AC | 70 ms | 13696 KB |
1_18.txt | AC | 65 ms | 9088 KB |
1_19.txt | AC | 63 ms | 9088 KB |
1_20.txt | AC | 70 ms | 9216 KB |
1_21.txt | AC | 68 ms | 9856 KB |
1_22.txt | AC | 57 ms | 9088 KB |
1_23.txt | AC | 59 ms | 9088 KB |
1_24.txt | AC | 63 ms | 9856 KB |
1_25.txt | AC | 59 ms | 10880 KB |
1_26.txt | AC | 59 ms | 8960 KB |
1_27.txt | AC | 57 ms | 9088 KB |
1_28.txt | AC | 55 ms | 9344 KB |
1_29.txt | AC | 63 ms | 11776 KB |
2_00.txt | AC | 2 ms | 6400 KB |
2_01.txt | AC | 74 ms | 20480 KB |
2_02.txt | AC | 75 ms | 18560 KB |
2_03.txt | AC | 75 ms | 18048 KB |
2_04.txt | AC | 72 ms | 14848 KB |
2_05.txt | AC | 72 ms | 14976 KB |
2_06.txt | AC | 73 ms | 15872 KB |
2_07.txt | AC | 68 ms | 9088 KB |
2_08.txt | AC | 68 ms | 9088 KB |
2_09.txt | AC | 68 ms | 9216 KB |
2_10.txt | AC | 56 ms | 9088 KB |
2_11.txt | AC | 56 ms | 9088 KB |
2_12.txt | AC | 57 ms | 9088 KB |
2_13.txt | AC | 50 ms | 7680 KB |
2_14.txt | AC | 49 ms | 8192 KB |
2_15.txt | AC | 50 ms | 8448 KB |
2_16.txt | AC | 67 ms | 9088 KB |
2_17.txt | AC | 65 ms | 9088 KB |
2_18.txt | AC | 66 ms | 9088 KB |
2_19.txt | AC | 64 ms | 9088 KB |
2_20.txt | AC | 64 ms | 9088 KB |
2_21.txt | AC | 64 ms | 9088 KB |
2_22.txt | AC | 67 ms | 9856 KB |
2_23.txt | AC | 67 ms | 10496 KB |
2_24.txt | AC | 69 ms | 10240 KB |
2_25.txt | AC | 71 ms | 15360 KB |
2_26.txt | AC | 72 ms | 14208 KB |
2_27.txt | AC | 74 ms | 15360 KB |
2_28.txt | AC | 68 ms | 13696 KB |
2_29.txt | AC | 74 ms | 19072 KB |
2_30.txt | AC | 72 ms | 17280 KB |
2_31.txt | AC | 71 ms | 13824 KB |
2_32.txt | AC | 64 ms | 9344 KB |
2_33.txt | AC | 67 ms | 11520 KB |
2_34.txt | AC | 69 ms | 13440 KB |
2_35.txt | AC | 71 ms | 16256 KB |
2_36.txt | AC | 67 ms | 9088 KB |
2_37.txt | AC | 66 ms | 9088 KB |
2_38.txt | AC | 66 ms | 10112 KB |
2_39.txt | AC | 67 ms | 9216 KB |
2_40.txt | AC | 59 ms | 9088 KB |
2_41.txt | AC | 62 ms | 9088 KB |
2_42.txt | AC | 56 ms | 8960 KB |
2_43.txt | AC | 69 ms | 14720 KB |
2_44.txt | AC | 57 ms | 8960 KB |
2_45.txt | AC | 54 ms | 9088 KB |
2_46.txt | AC | 54 ms | 9216 KB |
2_47.txt | AC | 64 ms | 12416 KB |