zoukankan      html  css  js  c++  java
  • HDU 3001 Travelling (状态压缩DP)

    Travelling

    Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 2338    Accepted Submission(s): 668


    Problem Description
    After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind which city being his start station because superman can bring him to any city at first but only once.), and of course there are m roads here,following a fee as usual.But Mr Acmer gets bored so easily that he doesn't want to visit a city more than twice!And he is so mean that he wants to minimize the total fee!He is lazy you see.So he turns to you for help.
     
    Input
    There are several test cases,the first line is two intergers n(1<=n<=10) and m,which means he needs to visit n cities and there are m roads he can choose,then m lines follow,each line will include three intergers a,b and c(1<=a,b<=n),means there is a road between a and b and the cost is of course c.Input to the End Of File.
     
    Output
    Output the minimum fee that he should pay,or -1 if he can't find such a route.
     
    Sample Input
    2 1 1 2 100 3 2 1 2 40 2 3 50 3 3 1 2 3 1 3 4 2 3 10
     
    Sample Output
    100 90 7
     
    Source
     
    Recommend
    gaojie

    注意看清题目,并不是一个点只能走一次,而是一个点不能走超过两次。所以要用三进制表示状态。

    /*
     * HDU3001
     * 状态压缩DP
     */
    
    #include <iostream>
    #include <string.h>
    #include <stdio.h>
    #include <algorithm>
    using namespace std;
    const int MAXN=15;
    const int INF=0x3f3f3f3f;
    int g[MAXN][MAXN];
    int dp[60000][MAXN];
    
    int p[12];
    int n;
    int a[12];
    int ArrayToInt(int a[])
    {
        int ret=0;
        for(int i=n-1;i>=0;i--)
        {
            ret*=3;
            ret+=a[i];
        }
        return ret;
    }
    void intToArray(int x)
    {
        for(int i=0;i<n;i++)
        {
            a[i]=x%3;
            x/=3;
        }
    }
    
    int main()
    {
    //    freopen("in.txt","r",stdin);
    //    freopen("out.txt","w",stdout);
        p[0]=1;
        for(int i=1;i<=11;i++)p[i]=3*p[i-1];
        int u,v,w;
        int m;
        while(scanf("%d%d",&n,&m)==2)
        {
            memset(g,-1,sizeof(g));
            while(m--)
            {
                scanf("%d%d%d",&u,&v,&w);
                u--;
                v--;
                if(g[u][v]==-1)g[u][v]=g[v][u]=w;
                else g[u][v]=g[v][u]=min(w,g[u][v]);
            }
            if(n==1)
            {
                printf("0\n");
                continue;
            }
            memset(dp,-1,sizeof(dp));
            int tot=0;
            for(int i=0;i<n;i++)tot+=p[i];
            for(int i=0;i<n;i++)dp[p[i]][i]=0;
            int ans=INF;
            for(int i=0;i<p[n];i++)
                for(int j=0;j<n;j++)
                {
                    intToArray(i);
                    if(a[j]==0)continue;
                    if(dp[i][j]<0)continue;
                    bool full=true;
                    for(int t=0;t<n;t++)
                        if(a[t]==0)
                            full=false;
                    if(full)ans=min(ans,dp[i][j]);
                    for(int k=0;k<n;k++)
                        if(j!=k && g[j][k]!=-1 && a[k]<2)
                        {
                            a[k]++;
                            int s=ArrayToInt(a);
                            if(dp[s][k]==-1)dp[s][k]=dp[i][j]+g[j][k];
                            else dp[s][k]=min(dp[s][k],dp[i][j]+g[j][k]);
                            a[k]--;
                        }
                }
            if(ans==INF)printf("-1\n");
            else
                printf("%d\n",ans);
        }
        return 0;
    }
    人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想
  • 相关阅读:
    jupyter 更新环境变量 %env
    viterbi 维特比解码过程,状态转移矩阵
    ValueError: cannot index with vector containing NA / NaN values
    python ElasticSearch ES 搜索词 完全匹配 精准匹配
    首页 如何在Jupyter中抑制回溯?
    python 操作ES
    python 玩转 侦探游戏 嫌疑犯 真假话 侦探推理
    python – 解析pcfg语法树 提取其语法规则 Probabilistic Context-Free Grammar Parser
    2019-09-18 关键字匹配文件名--搜索文件
    2019-07-21 win10安装rabbitmq与启动
  • 原文地址:https://www.cnblogs.com/kuangbin/p/3043472.html
Copyright © 2011-2022 走看看