Submission #1690256


Source Code Expand

#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=200007;

std::vector<int>p[N];
int n,tot,sz[N],lk[N];
char s[N];
ll ans;

inline void dfs(int x,int fa)
{
	foe(i,p[x])if(*i!=fa)
		dfs(*i,x),sz[x]+=sz[*i],repr(lk[x],lk[*i]);
	sz[x]+=s[x];
	lk[x]++;
}

inline void dfs2(int x,int fa,int d)
{
	int ma=-1,m2=-1,l=1e9,r;
	std::vector<pii>t;
	foe(i,p[x])if(*i!=fa)
	{
		if(lk[*i]>ma)m2=ma,ma=lk[*i];
		else if(lk[*i]>m2)m2=lk[*i];
		t.pb(mp(lk[*i],sz[*i]));
	}
	t.pb(mp(0,s[x]));
	t.pb(mp(d,tot-sz[x]));
	foe(i,p[x])if(*i!=fa)
		dfs2(*i,x,(lk[*i]==ma?m2:ma)+1);
	std::sort(t.begin(),t.end());
	//foe(i,t)out,'(',i->xx,',',i->yy,')',' ';out,'\n';
	foe(i,t)if(i->yy){l=i->xx;break;}
	r=min(t.back().xx-1,2+(++t.rbegin())->xx);
	//out,l,' ',r,'\n';
	ans+=max(0,r-l+1);
}

int main()
{
	in,n;
	fo0(i,n-1)
	{
		int x,y;
		in,x,y;
		p[x].pb(y);
		p[y].pb(x);
	}
	fo1(i,n)in,s[i];
	fo1(i,n)tot+=s[i]-=48;
	dfs(1,0);
	dfs2(1,0,0);
	out,ans+1,'\n';
}

Submission Info

Submission Time
Task F - Black Radius
User mcfx
Language C++14 (GCC 5.4.1)
Score 0
Code Size 4179 Byte
Status WA
Exec Time 131 ms
Memory 33536 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 1300 0 / 600
Status
AC × 3
AC × 2
WA × 29
AC × 7
WA × 74
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 4992 KB
0_01.txt AC 3 ms 4992 KB
0_02.txt AC 2 ms 4992 KB
1_00.txt WA 3 ms 4992 KB
1_01.txt WA 131 ms 33536 KB
1_02.txt WA 126 ms 26240 KB
1_03.txt WA 106 ms 13056 KB
1_04.txt WA 88 ms 14456 KB
1_05.txt AC 70 ms 15860 KB
1_06.txt WA 102 ms 13184 KB
1_07.txt WA 104 ms 13184 KB
1_08.txt WA 110 ms 15104 KB
1_09.txt WA 121 ms 23680 KB
1_10.txt WA 109 ms 21760 KB
1_11.txt WA 126 ms 33408 KB
1_12.txt WA 106 ms 17792 KB
1_13.txt WA 115 ms 22784 KB
1_14.txt WA 105 ms 17152 KB
1_15.txt WA 108 ms 15232 KB
1_16.txt WA 110 ms 18816 KB
1_17.txt WA 117 ms 21120 KB
1_18.txt WA 104 ms 13056 KB
1_19.txt WA 104 ms 13056 KB
1_20.txt WA 116 ms 13184 KB
1_21.txt WA 106 ms 14464 KB
1_22.txt WA 95 ms 13948 KB
1_23.txt WA 98 ms 13948 KB
1_24.txt WA 104 ms 14848 KB
1_25.txt WA 99 ms 17140 KB
1_26.txt WA 95 ms 13820 KB
1_27.txt WA 92 ms 14456 KB
1_28.txt WA 84 ms 15220 KB
1_29.txt WA 102 ms 18044 KB
2_00.txt WA 2 ms 4992 KB
2_01.txt WA 126 ms 32768 KB
2_02.txt WA 125 ms 29568 KB
2_03.txt WA 127 ms 28544 KB
2_04.txt WA 120 ms 22912 KB
2_05.txt WA 123 ms 23296 KB
2_06.txt WA 124 ms 24704 KB
2_07.txt WA 106 ms 13056 KB
2_08.txt WA 107 ms 13056 KB
2_09.txt WA 113 ms 13056 KB
2_10.txt WA 89 ms 14456 KB
2_11.txt WA 89 ms 14456 KB
2_12.txt WA 90 ms 14456 KB
2_13.txt AC 73 ms 15860 KB
2_14.txt AC 69 ms 15860 KB
2_15.txt AC 72 ms 15860 KB
2_16.txt WA 105 ms 13184 KB
2_17.txt WA 110 ms 13184 KB
2_18.txt WA 105 ms 13184 KB
2_19.txt WA 105 ms 13184 KB
2_20.txt WA 105 ms 13184 KB
2_21.txt WA 107 ms 13184 KB
2_22.txt WA 109 ms 14976 KB
2_23.txt WA 108 ms 16128 KB
2_24.txt WA 112 ms 15744 KB
2_25.txt WA 119 ms 24448 KB
2_26.txt WA 119 ms 22272 KB
2_27.txt WA 118 ms 24320 KB
2_28.txt WA 111 ms 20992 KB
2_29.txt WA 121 ms 30208 KB
2_30.txt WA 120 ms 27392 KB
2_31.txt WA 116 ms 21248 KB
2_32.txt WA 104 ms 13824 KB
2_33.txt WA 110 ms 17408 KB
2_34.txt WA 113 ms 20608 KB
2_35.txt WA 118 ms 25344 KB
2_36.txt WA 107 ms 12928 KB
2_37.txt WA 104 ms 13056 KB
2_38.txt WA 107 ms 15360 KB
2_39.txt WA 106 ms 13312 KB
2_40.txt WA 94 ms 14456 KB
2_41.txt WA 102 ms 13440 KB
2_42.txt WA 89 ms 14328 KB
2_43.txt WA 119 ms 23420 KB
2_44.txt WA 87 ms 14456 KB
2_45.txt WA 78 ms 15736 KB
2_46.txt WA 79 ms 15860 KB
2_47.txt WA 99 ms 19224 KB