Manthan, Codefest 17 C. Helga Hufflepuff's Cup(树形DP)
来源:互联网 发布:阿里云 微信公众平台 编辑:程序博客网 时间:2024/05/29 10:10
Harry, Ron and Hermione have figured out that Helga Hufflepuff's cup is a horcrux. Through her encounter with Bellatrix Lestrange, Hermione came to know that the cup is present in Bellatrix's family vault in Gringott's Wizarding Bank.
The Wizarding bank is in the form of a tree with total n vaults where each vault has some type, denoted by a number between 1 to m. A tree is an undirected connected graph with no cycles.
The vaults with the highest security are of type k, and all vaults of type k have the highest security.
There can be at most x vaults of highest security.
Also, if a vault is of the highest security, its adjacent vaults are guaranteed to not be of the highest security and their type is guaranteed to be less than k.
Harry wants to consider every possibility so that he can easily find the best path to reach Bellatrix's vault. So, you have to tell him, given the tree structure of Gringotts, the number of possible ways of giving each vault a type such that the above conditions hold.
The first line of input contains two space separated integers, n and m — the number of vaults and the number of different vault types possible. (1 ≤ n ≤ 105, 1 ≤ m ≤ 109).
Each of the next n - 1 lines contain two space separated integers ui and vi (1 ≤ ui, vi ≤ n) representing the i-th edge, which shows there is a path between the two vaults ui and vi. It is guaranteed that the given graph is a tree.
The last line of input contains two integers k and x (1 ≤ k ≤ m, 1 ≤ x ≤ 10), the type of the highest security vault and the maximum possible number of vaults of highest security.
Output a single integer, the number of ways of giving each vault a type following the conditions modulo 109 + 7.
4 21 22 31 41 2
1
3 31 21 32 1
13
3 11 21 31 1
0
题意:给你一棵树,可以染m种颜色,现在定义一种最高值k,一棵树上最多能有x个最高值,如果一个节点为最高值k,那么他相邻的节点的值只能选比他小的。现在问你一共有多少种染色的方法。
思路:dp [i] [j] [k] 表示以i节点为根的字数上选j个最高值有多少种方法,k = 0表示选比K小的值,k = 1表示选值为k,k = 2表示选比k大的值
#include<vector>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define LL long longusing namespace std;const int mod = 1e9 + 7;int n,m,K,X;vector<int> e[100010];LL dp[100010][12][3];int sz[100010];int t[12][3];LL dfs(int x,int pre){ dp[x][0][0] = K-1; dp[x][1][1] = 1; dp[x][0][2] = m-K; sz[x] = 1; for(int i=0;i<e[x].size();i++) { int xx = e[x][i]; if(xx == pre) continue; dfs(xx,x); memset(t,0,sizeof(t)); for(int j=0;j<=sz[x];j++) for(int k=0;k<=sz[xx];k++) { if(j+k > X) continue; t[j+k][0] = (t[j+k][0] + dp[x][j][0]*(dp[xx][k][0] + dp[xx][k][1] + dp[xx][k][2])%mod)%mod; t[j+k][1] = (t[j+k][1] + dp[x][j][1]*(dp[xx][k][0])%mod)%mod; t[j+k][2] = (t[j+k][2] + dp[x][j][2]*(dp[xx][k][0] + dp[xx][k][2])%mod)%mod; } sz[x] = min(sz[x]+sz[xx],X); for(int j=0;j<=sz[x];j++) for(int k=0;k<3;k++) dp[x][j][k] = t[j][k]; }}int main(void){ int i,j,k; while(scanf("%d%d",&n,&m)==2) { for(i=1;i<=n;i++) e[i].clear(); for(i=1;i<n;i++) { int x,y; scanf("%d%d",&x,&y); e[x].push_back(y); e[y].push_back(x); } scanf("%d%d",&K,&X); dfs(1,-1); LL ans = 0; for(j=0;j<=X;j++) for(k=0;k<3;k++) ans = (ans + dp[1][j][k])%mod; cout << ans << endl; }}
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup(树形DP)
- Manthan, Codefest 17: C. Helga Hufflepuff's Cup(树形DP)
- Manthan, Codefest 17-C-Helga Hufflepuff's Cup(树形DP)
- Codefest 17 C. Helga Hufflepuff's Cup(树形DP)
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup
- Codeforces Manthan, Codefest 17 C. Helga Hufflepuff's Cup 树型DP
- Codeforces 855 C. Helga Hufflepuff’s Cup (树形dp)
- CodeForces 855C Helga Hufflepuff's Cup(树形dp)
- C. Helga Hufflepuff's Cup(树形dp)
- codeforces 855C Helga Hufflepuff's Cup (树形dp)
- Codeforces Manthan Codefest 17 C 855CHelga Hufflepuff's Cup(树型DP)
- CF 855C. Helga Hufflepuff's Cup【树形DP】
- codeforce 855C. Helga Hufflepuff's Cup 树形DP
- Manthan, Codefest 17 E. Salazar Slytherin's Locket 数位DP
- codeforces Manthan, Codefest 17 B Marvolo Gaunt's Ring(dp)
- Manthan, Codefest 17 E. Salazar Slytherin's Locket(数位DP)(进制)
- Manthan, Codefest 17 E. Salazar Slytherin's Locket(数位DP)
- PHP实现数组中两个数的和等于给定的目标值
- 高数引言3反了你个三角函数
- 更智能,更利落,更快速,新版IntelliJ IDEA 即将登场
- Visual Studio 运行程序时,结果画面为什么会一闪而过?
- 每日掌握一个Linux命令 之 选取命令 cut,grep
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup(树形DP)
- 技术畅想 美国硅谷正在成为永生梦的新传播者
- Java的类型擦除
- Qt--Http请求封装(Get Post)
- Python中的random模块
- maven中出现依赖冲突问题
- 104. Maximum Depth of Binary Tree
- Centos7+Hadoop+Spark+Zookeeper+Hbase之集群搭建
- 图