hdu 4003 Find Metal Mineral(树形dp+分组背包)
来源:互联网 发布:宫外孕肛门坠胀 知乎 编辑:程序博客网 时间:2024/04/19 22:09
Problem Description
Humans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them which formed a tree. Now Humans launches k robots on Mars to collect them, and due to the unknown reasons, the landing site S of all robots is identified in advanced, in other word, all robot should start their job at point S. Each robot can return to Earth anywhere, and of course they cannot go back to Mars. We have research the information of all paths on Mars, including its two endpoints x, y and energy cost w. To reduce the total energy cost, we should make a optimal plan which cost minimal energy cost.
Input
There are multiple cases in the input.
In each case:
The first line specifies three integers N, S, K specifying the numbers of metal mineral, landing site and the number of robots.
The next n‐1 lines will give three integers x, y, w in each line specifying there is a path connected point x and y which should cost w.
1<=N<=10000, 1<=S<=N, 1<=k<=10, 1<=x, y<=N, 1<=w<=10000.
Output
For each cases output one line with the minimal energy cost.
Sample Input
3 1 1
1 2 1
1 3 1
3 1 2
1 2 1
1 3 1
Sample Output
3
2
Hint
In the first case: 1->2->1->3 the cost is 3;
In the second case: 1->2; 1->3 the cost is 2;
这道题目思索了半天,递推式倒是想出来了,但是始终想不到如何进行初始化,最后还是没能做出来……
dp[i][0]的含义为只有一个机器人遍历一遍子树后回到i节点,这也是耗费最大的方法,所以在进行背包时每次现将0的状态放入背包,就可顺利进行dp。
还有……这个数据量用cin会超时……奇怪……
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <vector>#include <algorithm>#define maxn 10010#define inf 0x3f3f3f3fusing namespace std;struct node{ int to,len; node() {}; node(int _to,int _len) :to(_to),len(_len) {};};vector<node> g[maxn];int dp[maxn][20];int n,k,s;void dfs(int now,int fa){ for(int i=0;i<g[now].size();i++) { int v=g[now][i].to; int len=g[now][i].len; if(v==fa) continue; dfs(v,now); for(int p=k;p>=0;p--) { dp[now][p]+=dp[v][0]+2*len; for(int j=1;j<=p;j++) dp[now][p]=min(dp[now][p],dp[now][p-j]+dp[v][j]+j*len); } }}int main(){ while(cin>>n>>s>>k) { memset(dp,0,sizeof(dp)); for(int i=0;i<=n;i++) g[i].clear(); for(int i=1;i<=n-1;i++) { int a,b,val; // cin>>a>>b>>val; scanf("%d%d%d",&a,&b,&val); g[a].push_back(node(b,val)); g[b].push_back(node(a,val)); } dfs(s,0); cout<<dp[s][k]<<endl; } return 0;}
- hdu 4003 Find Metal Mineral(树形DP+分组背包)
- hdu 4003 Find Metal Mineral(树形dp+分组背包)
- hdu 4003 Find Metal Mineral(树形dp+分组背包)
- hdu 4003 Find Metal Mineral (树形dp+分组背包)
- hdu 4003 Find Metal Mineral 【树形dp,分组背包】
- hdu 4003 Find Metal Mineral 树形dp+分组背包
- HDU 4003 Find Metal Mineral(树形dp + 分组背包)
- HDU 4003 Find Metal Mineral (树形DP+分组背包)
- (中等) 树形分组背包 HDU 4003 Find Metal Mineral
- hdu 4003 Find Metal Mineral(树形DP+分组背包,每个物品必须只能选一次)
- hdu 4003 Find Metal Mineral (树形背包dp)
- hdu 4003 Find Metal Mineral (树形dp+背包)
- HDU 4003 Find Metal Mineral【经典树形DP背包】
- HDU 4003 Find Metal Mineral 树形DP
- hdu 4003 Find Metal Mineral 树形DP
- HDU-4003 Find Metal Mineral 树形dp
- HDU4003 Find Metal Mineral(树形DP+分组背包)
- HDU 4003--Find Metal Mineral(树形dp)
- 深度剖析开源分布式监控CAT
- Caused by: org.hibernate.hql.internal.ast.QuerySyntaxException: Student is not mapped
- 虚拟机Linux访问usb设备,通过Libusb库方法实现读写usb设备所获取的实时图像数据
- 2016.3 idea 注册码
- 总结一些经典的JS项目
- hdu 4003 Find Metal Mineral(树形dp+分组背包)
- opencv学习_1(VS2010-openCV2.4.3-win7 配置说明)
- IntelliJ IDEA 2016 自定义JDK路径
- MacOS下修改MySQL的字符集
- ubuntu大容量硬盘分区
- 733D Kostya the Sculptor
- 21天学通C++之C++绪论
- VS2013常用快捷键
- 怎么在sublime/emmet中加自定义的内容-sublime使用心得(3)