hdoj 5326 Work <半步并查集>

Work

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1567    Accepted Submission(s): 943

Problem Description

It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company.
As is known to all, every stuff in a company has a title, everyone except the boss has a direct leader, and all the relationship forms a tree. If A’s title is higher than B(A is the direct or indirect leader of B), we call it A manages B.
Now, give you the relation of a company, can you calculate how many people manage k people. 

 

Input

There are multiple test cases.
Each test case begins with two integers n and k, n indicates the number of stuff of the company.
Each of the following n-1 lines has two integers A and B, means A is the direct leader of B.

1 <= n <= 100 , 0 <= k < n
1 <= A, B <= n

 

Output

For each test case, output the answer as described above.

 

Sample Input

  
  

   
   7 2
1 2
1 3
2 4
2 5
3 6
3 7
  
  

 

Sample Output

  
  

   
   2
  
  

 

Author

ZSTU

 

Source

2015 Multi-University Training Contest 3

代码：

#include<cstdio>
#include<cstring>
int n,k;
int fer[120],ren[120];
void find(int xx)
{
    while (xx!=fer[xx])
    {
        xx=fer[xx];
        ren[xx]++;
    }
}
int main()
{
    while (~scanf("%d%d",&n,&k))
    {
        for (int i=1;i<=n;i++)
        {
            ren[i]=0;
            fer[i]=i;
        }
        int a,b;
        for (int i=1;i<n;i++)
        {
            scanf("%d%d",&a,&b);
            fer[b]=a;
        }

        for (int i=1;i<=n;i++)
        {
         //   printf("%d        %d          66\n",i,fer[i]);
            int kk=fer[i];
            find(i);
            fer[i]=kk;
        }

        int s=0;
        for (int i=1;i<=n;i++)
        //    printf("%d   %d\n",i,ren[i]);
            if (ren[i]==k)
            s++;
        printf("%d\n",s);
    }
    return 0;
}