hdoj-4707

Pet

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2547    Accepted Submission(s): 1261

Problem Description

One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamster. He put the cheese trap in his room and waited for three days. Nothing but cockroaches was caught. He got the map of the school and foundthat there is no cyclic path and every location in the school can be reached from his room. The trap’s manual mention that the pet will always come back if it still in somewhere nearer than distance D. Your task is to help Lin Ji to find out how many possible locations the hamster may found given the map of the school. Assume that the hamster is still hiding in somewhere in the school and distance between each adjacent locations is always one distance unit.

 

Input

The input contains multiple test cases. Thefirst line is a positive integer T (0<T<=10), the number of test cases. For each test cases, the first line has two positive integer N (0<N<=100000) and D(0<D<N), separated by a single space. N is the number of locations in the school and D is the affective distance of the trap. The following N-1lines descripts the map, each has two integer x and y(0<=x,y<N), separated by a single space, meaning that x and y is adjacent in the map. Lin Ji’s room is always at location 0.

 

Output

For each test case, outputin a single line the number of possible locations in the school the hamster may be found.

 

Sample Input

  
  

   
   1
10 2
0 1
0 2
0 3
1 4
1 5
2 6
3 7
4 8
6 9
  
  

 

Sample Output

  
  

   
   2
  
  

 

Source

2013 ACM/ICPC Asia Regional Online —— Warmup

题目中输入表示哪个点和哪个点相连，来描述一个地图的情况，
这道题水的没天理，我用并查集做的 输入按照0点向外扩散输入也就是说0点永远就是根节点
先解释题意 主人公要找小松鼠 小松鼠只要在规定的范围内都能回来 这要这2个点相连单位距离
是 1
看样例
10 2  10个点0-9，在0周围2个距离就能回来 
0 1 0和1相连距离是1 
0 2 0和2相连距离是1(以此类推) 
0 3

#include<cstdio>
int pre[100000+11];

void count(int n)
{
	for(int i=0;i<n;++i)
		pre[i]=i;
}
int find(int x)
{
	int num=0;
	while(pre[x]!=x)
	{
		x=pre[x];
		++num;
	}
	return num;
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,d;
		scanf("%d%d",&n,&d);
		count(n);
		--n;
		int c=n;
		while(n--)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			pre[b]=a;
		}
		int sum=0;
		for(;c>=0;--c)
		{
			if(find(c)>d)
				++sum;
		}
		printf("%d\n",sum);
	}
}