HDU 4003 Find Metal Mineral (树形dp)

原创 2016年11月01日 22:45:42

Find Metal Mineral

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 3510    Accepted Submission(s): 1634

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;
Source
Recommend
lcy   |   We have carefully selected several similar problems for you:  4001 4007 4006 4009 4008 

题解:树形dp。设dp[ i ][ j ]表示对于以 i 结点为根结点的子树,放 j 个机器人所需要的权值和。先将dp[son][0]放进树中,因为dp[son][0]是表示用一个机器人去走完所有子树,最后又回到 pos这个节点,所以花费要乘以2。然后再找到最优的,这里类似于分组背包。

AC代码:
#include<bits/stdc++.h>
using namespace std;
struct Node
{
    int now,next,val;
}tree[20005];

int dp[10005][15];
int head[10005];
int n,s,k,len;

void addedge(int x,int y,int w)
{
    tree[len].now = y;
    tree[len].val = w;
    tree[len].next = head[x];
    head[x] = len++;
}

void dfs(int root,int fa)
{
    
    for(int i = head[root];i!=-1;i = tree[i].next)
    {
        int son = tree[i].now;
        if(son == fa)  continue;
        dfs(son,root);
        for(int j = k; j>=0;j--)
        {
            //先将dp[son][0]放进树中,因为dp[son][0]是表示用一个机器人去走完所有子树,最后又回到 pos这个节点,所以花费要乘以2
            dp[root][j]+=dp[son][0]+2*tree[i].val;
            for(int l = 1;l<=j;l++)//再找到更优的,就是分组背包 
            dp[root][j] = min(dp[root][j],dp[root][j-l]+dp[son][l]+l*tree[i].val);
        }
    }
}

int main()
{
    int i,x,y,w;
    while(~scanf("%d%d%d",&n,&s,&k))
    {
        len = 0;
        memset(head,-1,sizeof(head));
        memset(dp,0,sizeof(dp));
        for(i = 1;i<n;i++)
        {
            scanf("%d%d%d",&x,&y,&w);
            addedge(x,y,w);
            addedge(y,x,w);
        }
        dfs(s,0);
        printf("%d\n",dp[s][k]);
    }
    return 0;
}
WA:
#include<bits/stdc++.h>
#include<vector>
using namespace std;
vector<int> V[20010];
//dp[i][j]表示对于以i结点为根结点的子树,放j个机器人所需要的权值和。 
int dp[20010][30];
int val[20010];
int n,s,k;
void dfs(int root,int fa)
{
    
    for(int i=0; i< V[root].size();i++)
    {
        int son=V[root][i];
        if(son==fa)continue;
        dfs(son,root);
        for(int j=k;j>=0;--j)
        {
            //先将dp[son][0]放进树中,因为dp[son][0]是表示用一个机器人去走完所有子树,最后又回到 pos这个节点,所以花费要乘以2 
            dp[root][j]+=dp[son][0]+ 2*val[i];
            //再找到更优的
            for(int l=1;l<=j;l++) 
            {
                dp[root][j] = min(dp[root][j],dp[root][j-l]+dp[son][l]+l*val[i]);
            }
        }
    }
}

int main()
{
    int x,y;
    while(~scanf("%d%d%d",&n,&s,&k))
    {
        for(int i=0;i<n;i++) V[i].clear();
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n-1;i++)
        {
            scanf("%d%d%d",&x,&y,&val[i]);
            V[x].push_back(y);
            V[y].push_back(x);
        }
        dfs(s,0);
        printf("%d\n",dp[s][k]);
    }
    return 0;
}


版权声明:如果发现错误或者其他什么不足之处。请留言。博主尽量回复!转载要注明出处哦!

相关文章推荐

hdu 4003 Find Metal Mineral(树形DP)

题意:

HDU 4003--Find Metal Mineral(树形dp)

来源:http://acm.hdu.edu.cn/showproblem.php?pid=4003 题意:给定k个机器人去遍历n个节点的树,求最小花费 分析:dp[root][j]表示以root为...

HDU4003 Find Metal Mineral(树形DP+分组背包)

Find Metal Mineral Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Other...

HDU 4003 Find Metal Mineral (树形dp)

Find Metal Mineral Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Other...

HDU4003_Find_Metal_Mineral_树形DP分组

额- -其实也是看的别人的题解才做出来的,不过自己完完整整的写了一遍加详尽注释,感觉理解的透彻了些,又给同级的同学们讲了一遍,总之收获还是蛮大的。 写的代码是交的一道DIY的改编题,里面数据被肖神变态...

hdu 4003 Find Metal Mineral(树形DP+分组背包)

Find Metal Mineral Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Othe...
  • caduca
  • caduca
  • 2014年09月10日 22:06
  • 424

HDU4003:Find Metal Mineral(树形DP)

Problem Description Humans have discovered a kind of new metal mineral on Mars which are distributed...

hdu 4003 Find Metal Mineral K个机器人从S出发遍历树上所有点的经过的最小权值 树形DP

Problem Description Humans have discovered a kind of new metal mineral on Mars which are distribu...

hdu 4003 Find Metal Mineral (树形背包dp)

题意 给一棵n个节点的树, 节点编号为1~n, 每条边都有一个花费值. 有k个机器人从S点出发, 问让机器人遍历所有边,最少花费值多少? 思路 很好的一题, 推荐! ...

HDU 4003 Find Metal Mineral(树形dp,从根节点出发k个机器人遍历所有边的最小代价和)

题目链接; HDU 4003 Find Metal Mineral 题意: 给一个nn个节点和n−1n-1条边的树,每条边有权值,在给定的根节点rootroot有KK个机器人,要用这KK个机器...
  • Ramay7
  • Ramay7
  • 2016年08月08日 20:43
  • 392
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4003 Find Metal Mineral (树形dp)
举报原因:
原因补充:

(最多只允许输入30个字)