Codeforces Round #277 (Div. 2)D(树形DP计数类)
1 second
256 megabytes
standard input
standard output
As you know, an undirected connected graph with n nodes and n - 1 edges
is called a tree. You are given an integer d and a tree consisting of n nodes.
Each node i has a value ai associated
with it.
We call a set S of tree nodes valid if following conditions are satisfied:
- S is non-empty.
- S is connected. In other words, if nodes u and v are
in S, then all nodes lying on the simple path between u and v should
also be presented in S. - .
Your task is to count the number of valid sets. Since the result can be very large, you must print its remainder modulo 1000000007(109 + 7).
The first line contains two space-separated integers d (0 ≤ d ≤ 2000)
and n (1 ≤ n ≤ 2000).
The second line contains n space-separated positive integers a1, a2, ..., an(1 ≤ ai ≤ 2000).
Then the next n - 1 line each contain pair of integers u and v (1 ≤ u, v ≤ n)
denoting that there is an edge between u and v.
It is guaranteed that these edges form a tree.
Print the number of valid sets modulo 1000000007.
1 4
2 1 3 2
1 2
1 3
3 4
8
0 3
1 2 3
1 2
2 3
3
4 8
7 8 7 5 4 6 4 10
1 6
1 2
5 8
1 3
3 5
6 7
3 4
41
In the first sample, there are exactly 8 valid sets: {1}, {2}, {3}, {4}, {1, 2}, {1, 3}, {3, 4} and {1, 3, 4}.
Set {1, 2, 3, 4} is not valid, because the third condition isn't satisfied. Set {1, 4} satisfies
the third condition, but conflicts with the second condition.
最新文章
- EntityFramework linq 多条件查询,不定条件查询
- HTTP权威指南阅读笔记三:HTTP报文
- html总结----------------------看这个就够了
- 解读CSS文本(text)样式
- C语言数组的学习
- Java之对象序列化和反序列化
- ACM个人零散知识点整理
- 云计算之路-阿里云上:docker swarm 集群再次出现故障
- PAT1096:Consecutive Factors
- C++ 中用cin方式获取输入的几种常用方式
- Vue相关文章
- Hdoj 2563.统计问题 题解
- windows环境下面批量修改文件夹名称
- jquery 中后代遍历之children、find区别
- PostgreSQL中的group by
- js前台数据校验
- Android-Android/APP-理解
- Java IO流-NIO简介
- Windows和Ubuntu双系统
- C#操作Redis String字符串