这是一道来自2019CCPC湖南全国邀请赛的题目，要求在树形结构中选择关键节点，使得任意两个节点间的距离不超过k。给定树的节点数n、关键节点数m和最大距离k，求解不同的选择方式数量，并模10^9+7。输入包括树的边信息和关键节点列表，输出应为满足条件的选择方式总数。可以通过预处理树的距离并暴力枚举关键节点来解决，但时间复杂度较高。
Neko and tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
Neko has a tree with n nodes.
There are m key nodes on tree. Neko want to you to selecte some key nodes satisfying the distance between any two selected nodes less than or equal to k.
Neko thinks this work is too easy,so Neko want to know how many different way for selecting nodes.
Calculate the answer after mod 109+7.
Note that you have to select at least one key node.
Input
The first line contains three integers n,m,k(1≤n,m,k≤5000).
The next n−1 line, each line c
最低0.47元/天 解锁文章
2025
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
