zoukankan      html  css  js  c++  java
  • Pet

    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
     
        0为根  求到0距离大于D的点的个数
        
    #include<stdio.h>
    #include<cstring>
    int pre[100001];
    int juli;
    int  find(int p)
    {
    	juli=0;
    	while(p!=pre[p])
    	{
    		 p=pre[p];
    		 juli++;
    	} 
    	return juli;
    }
    int main()
    {
    	int n,a,b,t,m;
    	scanf("%d",&t);
    	while(t--)
    	{
    	   scanf("%d%d",&n,&m);
    		for(int i=0;i<n;i++)
    		{
    			pre[i]=i;
    		}
    		int k=n-1;
    		while(k--) 
    		{
    			scanf("%d%d",&a,&b);
    		    pre[b]=a;
    		}
    		int sum=0;
    		
    	   for(int i=0;i<n;i++)
    	   {
    		if(find(i)>m)
    		sum++;
    	   }
    			printf("%d
    ",sum);
    	}
    	return 0;
    }
    

    编程五分钟,调试两小时...
  • 相关阅读:
    HDU--2546 饭卡(01背包)
    UVA--562 Dividing coins(01背包)
    UVA--624 CD(01背包+路径输出)
    PKU--3628 Bookshelf 2(01背包)
    ExecutorService介绍2
    ExecutorService介绍
    mac下设置命令别名
    如何在sourcetree 下提交代码到gerrit上
    vim下如何删除某行之后的所有行
    VMware网络设置的三种方式
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027104.html
Copyright © 2011-2022 走看看