hdu4707 Pet
Pet
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 472 Accepted Submission(s): 229
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
Source
Recommend
liuyiding
应该是bfs dfs都可以过的吧,很水啦!
#include <iostream> #include <stdio.h> #include <vector> #include <string.h> using namespace std; #define MAXN 100050 vector<int > vec[MAXN]; int visit[MAXN]; int dis,ans; int dfs(int u,int d) { ans++; visit[u]=1; int i; if(d>=dis) return 1; for(i=0;i<vec[u].size();i++) { if(!visit[vec[u][i]]) dfs(vec[u][i],d+1); } return 1; } int main() { int tcase,n,s,e,i; scanf("%d",&tcase); while(tcase--) { scanf("%d%d",&n,&dis); for(i=0;i<n;i++) vec[i].clear(); for(i=0;i<n-1;i++) { scanf("%d%d",&s,&e); vec[s].push_back(e); vec[e].push_back(s); } ans=0; memset(visit,0,sizeof(visit)); dfs(0,0); printf("%d\n",n-ans); } return 0; }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步