[HNOI/AHOI2018]道路

[Luogu4438] [BZOJ5290]

强者的题解

看到道路条数<=40就可以想到加一维,甚至可以加两维.

设\(f[u][i][j]\)表示从根到\(u\)有\(i\)条道路\(1,j\)条道路\(2\)的最小值

直接树形DP即可,也可以用记忆化搜索

//卡空间版代码
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define Debug(x) cout<<#x<<"="<<x<<endl
using namespace std;
typedef long long LL;
const int INF=1e9+7;
inline LL read(){
    register LL x=0,f=1;register char c=getchar();
    while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
    while(c>=48&&c<=57)x=(x<<3)+(x<<1)+(c&15),c=getchar();
    return f*x;
}

const int MAXN=20005;
const int MAXX=45;

LL f[MAXN][MAXX][MAXX];
int ls[MAXN],rs[MAXN],a[MAXN],b[MAXN],c[MAXN];
int n;

/*inline void dfs(int u,int x,int y){
    if(!ls[u]&&!rs[u]){
        for(int i=0;i<=x;i++)
            for(int j=0;j<=y;j++)
                f[u][i][j]=1ll*c[u]*(a[u]+i)*(b[u]+j);
        return;
    }
    dfs(ls[u],x+1,y);
    dfs(rs[u],x,y+1);
    for(int i=0;i<=x;i++)
        for(int j=0;j<=y;j++)
            f[u][i][j]=min(f[ls[u]][i+1][j]+f[rs[u]][i][j],f[ls[u]][i][j]+f[rs[u]][i][j+1]);
}*/

inline LL dfs(int u,int x,int y){
    if(u>=n) return 1ll*c[u-n]*(a[u-n]+x)*(b[u-n]+y);
    if(f[u][x][y]<f[0][0][0]) return f[u][x][y];
    return f[u][x][y]=min(dfs(ls[u],x+1,y)+dfs(rs[u],x,y),dfs(ls[u],x,y)+dfs(rs[u],x,y+1));
}

int main(){
    n=read();
    for(int i=1;i<=n-1;i++){
        int x=read(),y=read();
        if(x<0) x=n-x;
        if(y<0) y=n-y;
        ls[i]=x,rs[i]=y;
    }
    for(int i=1;i<=n;i++) 
        a[i]=read(),b[i]=read(),c[i]=read();
    memset(f,127,sizeof f);
    printf("%lld\n",dfs(1,0,0));
}

转载于:https://www.cnblogs.com/lizehon/p/10572755.html