Submission #1166007


Source Code Expand

#include <cstdio>
const int M=101000;
#define A(a,b) y[++t]=b,N[t]=F[a],F[a]=t
int n,i,u,v,x,t,y[2*M],N[2*M],F[2*M],Q[2*M];
inline int DFS(int u,int f) {
	int K=0,P=0,S=0;
	for (int j=F[u];j;j=N[j])if(y[j]!=f)S|=((K=DFS(y[j],u))&P),P|=K;
	return(P|((1<<Q[S]+1)-1))+1;
}
int main() {
	scanf("%d",&n);
	for (i=0;i<n-1;i++) scanf("%d%d",&u,&v),A(u,v),A(v,u);
	for (Q[0]=-1,i=2;!(i>>17);i++) Q[i]=Q[i>>1]+1;
	printf("%d\n",Q[DFS(1,0)]);
}

Submission Info

Submission Time
Task D - Uninity
User vjudge1
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 435 Byte
Status AC
Exec Time 24 ms
Memory 4352 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:12:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (i=0;i<n-1;i++) scanf("%d%d",&u,&v),A(u,v),A(v,u);
                                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 2
AC × 74
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 AC 22 ms 2688 KB
02.txt AC 22 ms 2688 KB
03.txt AC 22 ms 2688 KB
04.txt AC 23 ms 2688 KB
05.txt AC 22 ms 2688 KB
06.txt AC 22 ms 2688 KB
07.txt AC 22 ms 2688 KB
08.txt AC 22 ms 2688 KB
09.txt AC 16 ms 2944 KB
10.txt AC 16 ms 3456 KB
11.txt AC 8 ms 2048 KB
12.txt AC 8 ms 2048 KB
13.txt AC 24 ms 4352 KB
14.txt AC 22 ms 4224 KB
15.txt AC 24 ms 3968 KB
16.txt AC 24 ms 3200 KB
17.txt AC 19 ms 2688 KB
18.txt AC 19 ms 2688 KB
19.txt AC 19 ms 2688 KB
20.txt AC 19 ms 2688 KB
21.txt AC 20 ms 2688 KB
22.txt AC 20 ms 2688 KB
23.txt AC 19 ms 2688 KB
24.txt AC 19 ms 2688 KB
25.txt AC 20 ms 2688 KB
26.txt AC 21 ms 2688 KB
27.txt AC 21 ms 2688 KB
28.txt AC 21 ms 2688 KB
29.txt AC 21 ms 2688 KB
30.txt AC 22 ms 2688 KB
31.txt AC 22 ms 2688 KB
32.txt AC 22 ms 2688 KB
33.txt AC 22 ms 2688 KB
34.txt AC 22 ms 2688 KB
35.txt AC 23 ms 2688 KB
36.txt AC 23 ms 2688 KB
37.txt AC 23 ms 2688 KB
38.txt AC 23 ms 2688 KB
39.txt AC 23 ms 2688 KB
40.txt AC 22 ms 2688 KB
41.txt AC 22 ms 2688 KB
42.txt AC 23 ms 2688 KB
43.txt AC 23 ms 2688 KB
44.txt AC 21 ms 2688 KB
45.txt AC 21 ms 2688 KB
46.txt AC 21 ms 2688 KB
47.txt AC 21 ms 2688 KB
48.txt AC 22 ms 2688 KB
49.txt AC 22 ms 2688 KB
50.txt AC 23 ms 2688 KB
51.txt AC 23 ms 2688 KB
52.txt AC 23 ms 2688 KB
53.txt AC 23 ms 2688 KB
54.txt AC 23 ms 2688 KB
55.txt AC 23 ms 2688 KB
56.txt AC 19 ms 2688 KB
57.txt AC 22 ms 3840 KB
58.txt AC 22 ms 3840 KB
59.txt AC 24 ms 2688 KB
60.txt AC 24 ms 2688 KB
61.txt AC 20 ms 3072 KB
62.txt AC 20 ms 3072 KB
63.txt AC 1 ms 640 KB
64.txt AC 1 ms 640 KB
65.txt AC 1 ms 640 KB
66.txt AC 1 ms 640 KB
67.txt AC 1 ms 640 KB
68.txt AC 1 ms 640 KB
69.txt AC 1 ms 640 KB
70.txt AC 1 ms 640 KB
71.txt AC 1 ms 640 KB
72.txt AC 1 ms 640 KB
s1.txt AC 1 ms 640 KB
s2.txt AC 1 ms 640 KB