zoukankan      html  css  js  c++  java
  • Pet--hdu4707

    Pet

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


    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
     
     
     
    这是个搜索题,我用并查集也过了,明天会附上搜索代码!
     
     
     
     
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 #define maxn 100100
     5 using namespace std;
     6 int p[maxn],a,b;
     7 void init()
     8 {
     9     int i;
    10     for(i=0;i<a;i++)
    11     p[i]=i;
    12 }
    13 int find(int x)
    14 {
    15     int t=x;
    16     while(t!=p[t])//不用压缩路径
    17     t=p[t];
    18     return t;
    19 }
    20 int fun(int x)
    21 {
    22     int i=x,num=0;
    23     while(i!=p[i])
    24     {
    25         //p[i]=find(i);//查找x的深度
    26         i=p[i];
    27         num++;
    28     }
    29     return num;
    30 }
    31 
    32 int main()
    33 {
    34     int N,n,i,x,y,cot;
    35     scanf("%d",&N);
    36     while(N--)
    37     {
    38         
    39         cot=0;
    40         scanf("%d%d",&a,&b);
    41         init();
    42         for(i=0;i<a-1;i++)
    43         {
    44             scanf("%d%d",&x,&y);
    45             p[y]=x; 
    46         }
    47         for(i=a-1;i>=0;i--)
    48         {
    49             if(find(i)==0)
    50             if(fun(i)>b)
    51             cot++;
    52         }
    53         printf("%d
    ",cot);
    54     }
    55     return 0;
    56 }
  • 相关阅读:
    POJ 2750 Potted Flower (单点改动求线段树上最大子序列和)
    [异能程序猿]第四章 偶遇(第四更)
    【web开发学习笔记】Struts-Tags学习笔记1
    UVa 10100
    【算法拾遗】大数相加(不开辟额外空间)
    cocos2d-html5学习笔记(六)--alpha2中cc.Sequence.create中的bug
    大一暑假和大二专业学习的规划
    Android如何获得系统版本
    Struts2——(1)Struts2入门
    设置m_pszAppName值的做法
  • 原文地址:https://www.cnblogs.com/Eric-keke/p/4712134.html
Copyright © 2011-2022 走看看