B. Appleman and Tree 树状DP
来源:互联网 发布:cf宏鼠标一键瞬狙数据 编辑:程序博客网 时间:2024/06/02 10:46
Appleman has a tree with n vertices. Some of the vertices (at least one) are colored black and other vertices are colored white.
Consider a set consisting of k (0 ≤ k < n) edges of Appleman's tree. If Appleman deletes these edges from the tree, then it will split into(k + 1) parts. Note, that each part will be a tree with colored vertices.
Now Appleman wonders, what is the number of sets splitting the tree in such a way that each resulting part will have exactly one black vertex? Find this number modulo1000000007 (109 + 7).
The first line contains an integer n (2 ≤ n ≤ 105) — the number of tree vertices.
The second line contains the description of the tree: n - 1 integersp0, p1, ..., pn - 2 (0 ≤ pi ≤ i). Where pi means that there is an edge connecting vertex(i + 1) of the tree and vertex pi. Consider tree vertices are numbered from0 to n - 1.
The third line contains the description of the colors of the vertices: n integers x0, x1, ..., xn - 1 (xi is either 0 or 1). Ifxi is equal to1, vertex i is colored black. Otherwise, vertexi is colored white.
Output a single integer — the number of ways to split the tree modulo 1000000007 (109 + 7).
30 00 1 1
2
60 1 1 0 41 1 0 0 1 0
1
100 1 2 1 4 4 4 0 80 0 0 1 0 1 1 0 0 1
27题意: 给一个树,节点只有黑色或者白色,求砍任意条边,把树分割成若干的只有一个黑色节点的小树 的方案数;思路: 树状DP; 一条边<v,u> 有四种状态: <1,1>, <1, 0> ,<0,1>, <0,0>用dp[i][0] 代表含节点i的子树不含黑色点的方案数;dp[i][1] : 含节点i的子数含了一个黑色节点的方案数;假设v 的父节点, u 为其一子节点;dp[v][1] = dp[v][1] (含黑色节点) * dp[u][1] (子含黑色节点) + dp[v][1] * dp[u][0] 【保留<v,u>边, 把v所在含黑色的子树 与 u所在不含黑色的子树连接起来构成新的子树可能数有: dp[v][1] * dp[u][0]】
- B. Appleman and Tree 树状DP
- Codeforces 461B - Appleman and Tree 树状DP
- codeforces 461B B. Appleman and Tree(树形dp)
- CF 461B - Appleman and Tree(树形DP)
- Appleman and Tree - CodeForces 461 B 树形dp
- CF 461B Appleman and Tree (树形dp)
- CF 461B Appleman and Tree 树形dp
- Codeforces 461B Appleman and Tree(树形dp)
- 【CodeForces】461B Appleman and Tree 树型DP
- codeforces 461B Appleman and Tree (树形dp)
- CF 461B Appleman and Tree (树形dp)
- Codeforces 461 B. Appleman and Tree
- codeforces 461B Appleman and Tree
- codeforces 461B Appleman and Tree
- 【codeforces】 461B Appleman and Tree
- Codeforces 461B Appleman and Tree
- Codeforces 461B Appleman and Tree
- Codeforces Round #263 (Div. 1) B. Appleman and Tree( 树形DP )
- 分享实用工具源码--实现Windows IDE中查看Linux下编译信息
- IOS沙盒(sandbox)机制和文件操作
- iOS设计模式:工厂方法
- (一)线程管理_4---线程休眠和恢复
- c++的容器类简介
- B. Appleman and Tree 树状DP
- HDU-1702-ACboy needs your help again!
- 大文件获取百度网盘地址
- 《TCP/IP详解卷2:实现》笔记--协议控制块
- 数据结构笔记——第四章字符串和多维数组
- 康托展开/逆康托展开
- Android CursorLoader实例详解(附源码)
- sgu-163-Wise King (水到不忍直视)
- 九度OJ—题目1525:子串逆序打印