Submission #1776183
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=100007;
std::vector<int>p[N];
int n,sz[N],rsz,nro,nsz;
bool vis[N];
inline void dfs1(int x,int fa)
{
sz[x]=1;
foe(i,p[x])if(*i!=fa&&!vis[*i])
dfs1(*i,x),sz[x]+=sz[*i];
}
inline void dfs2(int x,int fa)
{
int t=rsz-sz[x];
foe(i,p[x])if(*i!=fa&&!vis[*i])
dfs2(*i,x),repr(t,sz[*i]);
if(t<nsz)nsz=t,nro=x;
}
inline int work(int x)
{
dfs1(x,0);
rsz=nsz=sz[nro=x];
dfs2(x,0);
vis[x=nro]=1;
int t=0;
foe(i,p[x])if(!vis[*i])repr(t,work(*i));
return t+1;
}
int main()
{
in,n;
fo1(i,n-1)
{
int x,y;
in,x,y;
p[x].pb(y);
p[y].pb(x);
}
out,work(1)-1,'\n';
}
Submission Info
Submission Time |
|
Task |
D - Uninity |
User |
mcfx |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3861 Byte |
Status |
WA |
Exec Time |
195 ms |
Memory |
8832 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
WA |
96 ms |
6272 KB |
02.txt |
AC |
96 ms |
6272 KB |
03.txt |
WA |
100 ms |
6272 KB |
04.txt |
WA |
96 ms |
6272 KB |
05.txt |
AC |
96 ms |
6272 KB |
06.txt |
WA |
96 ms |
6272 KB |
07.txt |
AC |
94 ms |
6272 KB |
08.txt |
WA |
95 ms |
6272 KB |
09.txt |
AC |
109 ms |
6144 KB |
10.txt |
AC |
110 ms |
6784 KB |
11.txt |
AC |
43 ms |
4608 KB |
12.txt |
AC |
43 ms |
4736 KB |
13.txt |
AC |
195 ms |
8448 KB |
14.txt |
AC |
169 ms |
8064 KB |
15.txt |
AC |
191 ms |
7936 KB |
16.txt |
AC |
183 ms |
7040 KB |
17.txt |
AC |
27 ms |
6648 KB |
18.txt |
AC |
37 ms |
6644 KB |
19.txt |
AC |
34 ms |
6784 KB |
20.txt |
AC |
34 ms |
6656 KB |
21.txt |
AC |
36 ms |
6656 KB |
22.txt |
AC |
42 ms |
6656 KB |
23.txt |
AC |
25 ms |
6648 KB |
24.txt |
AC |
25 ms |
6648 KB |
25.txt |
AC |
33 ms |
6396 KB |
26.txt |
AC |
41 ms |
6528 KB |
27.txt |
AC |
41 ms |
6528 KB |
28.txt |
AC |
48 ms |
6528 KB |
29.txt |
AC |
50 ms |
6528 KB |
30.txt |
AC |
61 ms |
6528 KB |
31.txt |
WA |
61 ms |
6528 KB |
32.txt |
WA |
71 ms |
6400 KB |
33.txt |
WA |
70 ms |
6400 KB |
34.txt |
WA |
80 ms |
6400 KB |
35.txt |
WA |
82 ms |
6400 KB |
36.txt |
WA |
90 ms |
6272 KB |
37.txt |
WA |
90 ms |
6272 KB |
38.txt |
WA |
100 ms |
6272 KB |
39.txt |
WA |
100 ms |
6272 KB |
40.txt |
WA |
105 ms |
6400 KB |
41.txt |
WA |
106 ms |
6400 KB |
42.txt |
WA |
120 ms |
6272 KB |
43.txt |
WA |
120 ms |
6272 KB |
44.txt |
WA |
70 ms |
8832 KB |
45.txt |
WA |
75 ms |
6784 KB |
46.txt |
WA |
86 ms |
6784 KB |
47.txt |
WA |
86 ms |
6784 KB |
48.txt |
WA |
105 ms |
6656 KB |
49.txt |
WA |
100 ms |
6656 KB |
50.txt |
WA |
133 ms |
6400 KB |
51.txt |
WA |
133 ms |
6400 KB |
52.txt |
WA |
154 ms |
6272 KB |
53.txt |
WA |
148 ms |
6272 KB |
54.txt |
WA |
167 ms |
6272 KB |
55.txt |
WA |
152 ms |
6272 KB |
56.txt |
AC |
25 ms |
6648 KB |
57.txt |
WA |
112 ms |
7932 KB |
58.txt |
WA |
112 ms |
7932 KB |
59.txt |
AC |
115 ms |
6272 KB |
60.txt |
AC |
114 ms |
6272 KB |
61.txt |
WA |
53 ms |
7032 KB |
62.txt |
WA |
53 ms |
7032 KB |
63.txt |
AC |
2 ms |
2560 KB |
64.txt |
AC |
2 ms |
2560 KB |
65.txt |
AC |
3 ms |
2560 KB |
66.txt |
AC |
2 ms |
2560 KB |
67.txt |
AC |
2 ms |
2560 KB |
68.txt |
AC |
2 ms |
2560 KB |
69.txt |
AC |
2 ms |
2560 KB |
70.txt |
AC |
2 ms |
2560 KB |
71.txt |
AC |
2 ms |
2560 KB |
72.txt |
AC |
2 ms |
2560 KB |
s1.txt |
AC |
2 ms |
2560 KB |
s2.txt |
AC |
2 ms |
2560 KB |