zoukankan      html  css  js  c++  java
  • [POJ 3311] Hie with the Pie

    Hie with the Pie
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 4712   Accepted: 2502

    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
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    #define INF 0x7ffffff
    
    int n;
    int mpt[12][12];
    int dp[12][1<<12];                               //dp[i][j]表示到达第i个点状态为j时的最小花费
    
    void floyd()
    {
        for(int k=0;k<n;k++)
        {
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<n;j++)
                {
                    mpt[i][j]=min(mpt[i][j],mpt[i][k]+mpt[k][j]);
                }
            }
        }
    }
    
    int main()
    {
        int i,j,k;
        while(scanf("%d",&n),n)
        {
            n++;
            for(i=0;i<n;i++)
            {
                for(j=0;j<n;j++)
                {
                    scanf("%d",&mpt[i][j]);
                    
                }
            }
            int MAX=1<<n;
            for(i=0;i<n;i++)
            {
                for(j=0;j<MAX;j++)
                {
                    dp[i][j]=INF;
                }
            }
            
            floyd();
            for(i=0;i<n;i++)
            {
                dp[i][1<<i]=mpt[0][i];
            }
    
            for(j=0;j<MAX;j++)
            {
                for(i=0;i<n;i++)
                {
                    for(k=0;k<n;k++)
                    {
                        dp[i][j]=min(dp[i][j],dp[k][j&(~(1<<i))]+mpt[k][i]);
                    }
                }
            }
            printf("%d
    ",dp[0][MAX-1]);
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    你不知道的多重循环的事情
    【浅墨Unity3D Shader编程】之三 光之城堡篇:子着色器、通道与标签的写法 &amp; 纹理混合
    ssh 远程登陆指定port
    GMT和CST的转换
    Swift新手教程系列5-函数+selector在swift中的使用方法
    Mac OS X 10.10, Eclipse+ADT真机调试代码时,Device Chooser中不显示真机的解决方式
    android studio 0.8.1使用和遇到问题解决
    C语言之函数调用17—递归法之中的一个般函数的调用(2)
    C语言之基本算法25—牛顿迭代法求方程近似根
    FineUI之使用SQL脚本从数据库表中生成对应的输入控件
  • 原文地址:https://www.cnblogs.com/hate13/p/4101290.html
Copyright © 2011-2022 走看看