hdu 4707 Pet
2013-09-08 19:42
260 查看
Pet
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 181 Accepted Submission(s): 55
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, outputin a single line the number of possible locations in the school the hamster may be found.
[align=left]Sample Input[/align]
1
10 2
0 1
0 2
0 3
1 4
1 5
2 6
3 7
4 8
6 9
[align=left]Sample Output[/align]
2
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<vector> using namespace std; #define N 100010 vector<int>a ; int n,d,ans; int v ; void bfs(){ int x,y; queue<int>q; q.push(0); v[0]=0; ans=0; while(!q.empty()){ x=q.front();q.pop(); //cout<<x<<" "<<v[x]<<endl; //if(x!=0&&v[x]!=-1)continue; for(int i=a[x].size()-1;i>=0;i--){ y=a[x][i]; if(v[y]==-1){ v[y]=v[x]+1; q.push(y); } } } for(int i=0;i<n;i++)if(v[i]!=-1&&v[i]>d)ans++; } int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d%d",&n,&d); memset(a,0,sizeof(a)); memset(v,-1,sizeof(v)); for(int i=1,x,y;i<n;i++){ scanf("%d%d",&x,&y); a[x].push_back(y); a[y].push_back(x); } bfs(); printf("%d\n",ans); } system("pause"); return 0; }
相关文章推荐
- hdu 4707 Pet(图 + 邻接表)
- hdu 4707 Pet 2013年ICPC热身赛A题 dfs水题
- Pet(hdu 4707 BFS)
- HDU:4707 Pet(并查集+某元素到根节点的距离计算)
- hdu 4707 Pet
- hdu 4707 Pet【BFS求树的深度】
- HDU 4707 Pet
- hdu 4707 Pet(dfs)
- Hdu 4707 Pet -- 树形
- hdu 4707 Pet(dfs,bfs)
- HDU 4707 Pet 邻接表实现
- HDU 4707 Pet(BFS,统计树节点深度)
- HDU-4707-Pet【并查集】【搜索】
- hdu 4707 Pet
- hdu 4707 Pet(DFS && 邻接表)
- hdu - 4707 - Pet
- HDU 4707 Pet(DFS(深度优先搜索)+BFS(广度优先搜索))
- HDU 4707 Pet 图的遍历(BFS和DFS)
- HDU 4707 Pet (热身赛第二题)
- hdu 4707 Pet 2013年ICPC热身赛A题 dfs水题