zoukankan      html  css  js  c++  java
  • Hie with the Pie(POJ 3311)状压DP

    Description

    The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait for 1 or more (up to 10) orders to be processed before he starts any deliveries. Needless to say, he would like to take the shortest route in delivering these goodies and returning to the pizzeria, even if it means passing the same location(s) or the pizzeria more than once on the way. He has commissioned you to write a program to help him.

    Input

    Input will consist of multiple test cases. The first line will contain a single integer n indicating the number of orders to deliver, where 1 ≤ n ≤ 10. After this will be n + 1 lines each containing n + 1 integers indicating the times to travel between the pizzeria (numbered 0) and the n locations (numbers 1 to n). The jth value on the ith line indicates the time to go directly from location i to location j without visiting any other locations along the way. Note that there may be quicker ways to go from i to j via other locations, due to different speed limits, traffic lights, etc. Also, the time values may not be symmetric, i.e., the time to go directly from location i to j may not be the same as the time to go directly from location j to i. An input value of n = 0 will terminate input.

    Output

    For each test case, you should output a single number indicating the minimum time to deliver all of the pizzas and return to the pizzeria.

    Sample Input

    3
    0 1 10 10
    1 0 1 2
    10 1 0 10
    10 2 10 0
    0

    Sample Output

    8

    题目大意:给你 n 个目的地,以 0 为起点,给出一个邻接矩阵,求经过每个点最后返回 起点0 的最小距离

    冉了我一上午的状压DP,但总算解决啦

    代码^-^

    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int f[20][2050],dis[20][20];
    
    int main()
    {
        int n,size;
        while(scanf("%d",&n)!=EOF)
        {
            if(n==0) break;
            n++;
            size=(1<<n)-1;
            memset(dis,13,sizeof(dis));
            for(int i=1;i<=n;++i)
                for(int j=1;j<=n;++j) {
                    int temp;
                    scanf("%d",&temp);
                    if(i!=j) dis[i][j]=temp;
                }
                
            for(int k=1;k<=n;++k)
                for(int i=1;i<=n;++i)
                    for(int j=1;j<=n;++j)
                        if(i!=j)
                            dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
            
            memset(f,13,sizeof(f));
            for(int i=2;i<=n;++i) f[i][1<<(i-1)]=dis[1][i];
            
            for(int j=1;j<=size;++j)
                for(int i=1;i<=n;++i) {
                    if( j&(1<<(i-1)) ) 
                        for(int k=1;k<=n;++k) {
                            if( j&(1<<(k-1)) )
                                f[i][j]=min(f[i][j],f[k][ j& ~(1<<(i-1)) ]+dis[k][i]);
                        }
                }
            printf("%d
    ",f[1][size]);
        }
        return 0;
    }

    学长哒

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int co[15][15],f[15][2050],dis[15][15];
    int main()
    {
        int n,siz;
        while(scanf("%d",&n)!=EOF)
        {
            if(n==0) break;
            memset(dis,0x3f,sizeof(dis));
            n++;
            siz=(1<<n)-1;
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                {
                    scanf("%d",&co[i][j]);
                    if(i!=j) dis[i][j]=co[i][j];
                }
            
            for(int i=1;i<=n;i++)//
                for(int j=1;j<=n;j++)
                    if(i!=j)
                        for(int k=1;k<=n;k++)
                            if(k!=j&&k!=i)
                                dis[j][k]=min(dis[j][k],dis[j][i]+dis[i][k]);
            
            memset(f,0x3f,sizeof(f));//
            for(int i=2;i<=n;i++) f[i][(1<<(i-1))]=dis[1][i]; 
            
            for(int j=1;j<=siz;j++)//
                for(int i=1;i<=n;i++)
                    if( j&(1<<(i-1)) )//*
                        for(int k=1;k<=n;k++)
                            if( j&(1<<(k-1)) ) {
                                f[i][j]=min(f[i][j],f[k][ j& ~(1<<(i-1)) ]+dis[k][i]);
                            }
                                
            printf("%d
    ",f[1][siz]);
        }
        return 0;
    }
     
  • 相关阅读:
    git 查看远程分支、本地分支、创建分支、把分支推到远程repository、删除本地分支
    bootstrap-glyphicons图标
    linux下批量替换文件夹下某个字符串
    php 按照图片名下载图片到对应文件夹
    win7设置电脑定时关机
    转 Nginx+FastCGI到底是谁影响超时时间
    linux添加系统负载日志
    PHP计划任务:如何使用Linux的Crontab执行PHP脚本(转载)
    ubuntu php执行计划任务
    phpStudy:使用localhost无法访问的解决方案
  • 原文地址:https://www.cnblogs.com/qseer/p/9454450.html
Copyright © 2011-2022 走看看