Pet<hdoj4707>
来源:互联网 发布:手机网络信息怎么收费 编辑:程序博客网 时间:2024/04/30 02:21
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
110 20 10 20 31 41 52 63 74 86 9
Sample Output
2
0为根 求到0距离大于D的点的个数
#include<stdio.h>#include<cstring>int pre[100001];int juli;int find(int p){juli=0;while(p!=pre[p]){ p=pre[p]; juli++;} return juli;}int main(){int n,a,b,t,m;scanf("%d",&t);while(t--){ scanf("%d%d",&n,&m);for(int i=0;i<n;i++){pre[i]=i;}int k=n-1;while(k--) {scanf("%d%d",&a,&b); pre[b]=a;}int sum=0; for(int i=0;i<n;i++) {if(find(i)>m)sum++; }printf("%d\n",sum);}return 0;}
0 0
- Pet<hdoj4707>
- Pet
- Pet
- Pet
- Pet
- PET
- PET
- PET模型
- pet sqlhelper
- pet shop
- PET基础
- DOMText(pet)
- SBT(pet)
- hdu4707 Pet
- Pet类
- hd4707 Pet
- Pet--hdu4707
- hdu4707 Pet
- 洗车器
- Volley联网开源框架
- HDU-4707-Pet【并查集】【搜索】
- struts2简介
- 第六篇.代码中的与或非运算
- Pet<hdoj4707>
- 工厂方法设计模式
- Ext.widget()和Ext.getCmp()区别,前者创建组件,后者获取组件
- 1080 线段树练习
- HDU 5326(并查集小心得)
- 【Leetcode】141. Linked List Cycle-判断链表是否有环
- Kubernetes1.3:QoS服务质量管理
- Must Know Tips/Tricks in Deep Neural Networks (by Xiu-Shen Wei)
- ZYNQ部分功能引脚定义