HDU 4707 简单树状dp

最新推荐文章于 2021-07-16 19:25:50 发布

原创最新推荐文章于 2021-07-16 19:25:50 发布 · 437 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#HDU #DP

本文介绍了一个基于图论的算法问题——HDU4707宠物寻找挑战。该问题要求根据一张无环图（学校地图），确定宠物可能藏匿的位置数量。输入包含多个测试案例，每个案例由学校地点数、陷阱有效距离及地点间的连接关系构成。通过递推计算距离并排序，最终输出可能找到宠物的地点数目。

HDU 4707

Pet

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2387 Accepted Submission(s): 1160

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

Sample Output

Source

2013 ACM/ICPC Asia Regional Online —— Warmup

Recommend

liuyiding | We have carefully selected several similar problems for you: 5701 5700 5699 5698 5697

DP水题

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

const int MAXN=100000;
int main()
{
    int dp[MAXN+5],n,m,t,a,b;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            for(int i=0;i<=MAXN+5;i++)
                dp[i]=MAXN+10;
            dp[0]=0;
            scanf("%d%d",&n,&m);
            int k=n;
            n--;
            while(n--)
            {
                scanf("%d%d",&a,&b);
                dp[b]=dp[a]+1;//题目中指明此树不会成环，所以这样写
                dp[b]=min(dp[b],dp[a]+1);//若成环,这样写
            }
            sort(dp,dp+k);
            cout<<k-(upper_bound(dp,dp+k,m)-dp)<<endl;
        }
    }
}