hdu 5326 Work 水题

Work

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

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
  
  

 

Source

2015 Multi-University Training Contest 3

 

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5326

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <limits.h>
using namespace std;
typedef long long LL;
#define y1 y234
#define MAXN 1000010 // 1e6
vector <int> edge[MAXN];
int n, k;
int sum[MAXN];
void DFS(int u) {
    int res = 0;
    int len = edge[u].size();
    for(int i = 0; i < len; i++) {
        int v = edge[u][i];
        if(!sum[v]) {
            DFS(v);
        }
        res++;
        res += sum[v];
    }
    sum[u] = res;
}
int main() {
    while(~scanf("%d%d", &n, &k)) {
        int ans = 0;
        memset(sum, 0, sizeof(sum));
        for(int i = 0; i <= n; i++) edge[i].clear();
        for(int i = 0; i < n - 1; i++) {
            int a, b;
            scanf("%d%d",&a, &b);
            edge[a].push_back(b);
        }
        for(int i = 1; i <= n; i++) {
            if(sum[i]) continue;
            DFS(i);
        }
        for(int i = 1; i <= n; i++) {
            if(sum[i] == k) ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}