标签：
Pet
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1737 Accepted Submission(s): 835
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
题意：所有房子组成一颗树，求出离根节点0的距离大于d的节点数目
思路：邻接表建树深搜
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#define maxm 100000 + 1000
using namespace std;
struct node{
int u, v, sum, next;
};
int n, k, ans, cnt;
node edge[maxm];
int head[maxm];
void init(){
cnt = 0;
memset(head, -1, sizeof(head));
}
void add(int u,int v){
edge[cnt].u = u;
edge[cnt].v = v;
edge[cnt].next = head[u];
head[u] = cnt++;
}
void dfs(int pos,int sum){
if(head[pos] == -1)
return ;
for(int i = head[pos]; i != -1; i = edge[i].next){
int v = edge[i].v;
edge[i].sum = sum + 1;
if(edge[i].sum > k)
ans++;
dfs(v, edge[i].sum);
}
}
int main (){
int T;
scanf("%d", &T);
while(T--){
init();
scanf("%d%d", &n, &k);
for(int i = 1; i < n; ++i){
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
}
ans = 0;
dfs(0, 0);
printf("%d\n", ans);
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。
HDU 4707--Pet【DFS && 邻接表】
标签：
原文地址：http://blog.csdn.net/hpuhjh/article/details/47280147
