HDU 4707:Pet
2016-05-01 19:43
357 查看
Pet
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2248 Accepted Submission(s): 1098
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
2013 ACM/ICPC Asia Regional Online —— Warmup
迷失在幽谷中的鸟儿,独自飞翔在这偌大的天地间,却不知自己该飞往何方……
#include <iostream> #include <cmath> #include <stdio.h> #include <string> #include <cstring> #include <map> #include <set> #include <vector> #include <stack> #include <queue> #include <iomanip> #include <algorithm> #define maxn 100010 using namespace std; struct P { int num; int dis; }; int vis[maxn]; vector<int> v[maxn]; int N,D; void init() { for(int i=0; i<=N; i++) v[i].clear(); } int bfs() { int ans=0; P tmp,n; queue<P> q; while(!q.empty()) q.pop(); tmp.dis=0; tmp.num=0; q.push(tmp); memset(vis,0,sizeof(vis)); while(!q.empty()) { n=q.front(); q.pop(); if(n.dis>D)ans++; for(int i=0; i<(int)v[n.num].size(); i++) { if(vis[v[n.num][i]]==0) { vis[v[n.num][i]]=1; tmp.dis=n.dis+1; tmp.num=v[n.num][i]; q.push(tmp); } } } return ans; } int main() { int T; int x,y; cin>>T; while(T--) { scanf("%d%d",&N,&D); init(); for(int i=0; i<N-1; i++) { scanf("%d%d",&x,&y); v[x].push_back(y); } cout<<bfs()<<endl; } return 0; }
相关文章推荐
- Python编码报错
- 20145215《Java程序设计》第9周学习总结
- STL算法_数值算法篇
- Unity学习笔记10——旋转(四元数和欧拉角)
- 关于C++里的find查找函数的简单说明
- iOS9 http无法请求的解决方法
- HDU 4706:Children's Day
- Loadrunner中socket脚本分析
- UVa 439 Knight Moves
- 浏览器获取MAC地址
- 线程
- 【LeetCode】Merge Two Sorted Lists 解题报告(Java & Python)
- 在oschina上创建项目并初始化工程
- SICP 习题2.6之丘奇数
- 学习进度第九周
- 深入理解Java虚拟机(四)-垃圾收集算法
- apache commons pool之GenericObjectPool分析(通用对象池技术)
- hadoop各种常见错误总结
- 图论最短路径算法-Floyd算法-JAVA代码实现
- 深入理解Java内存模型——锁