POJ3311 Hie with the Pie

Hie with the Pie

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7624		Accepted: 4106

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

Source

East Central North America 2006

 

 

大意如下：

给定一张有n + 1个节点的有向图，每两个点之间均有两条方向不一的边，权值不一定相同。问你从0号节点出发，走过所有1...n个节点并回到0号节点所花费的时间。

 

首先Floyd预处理多源最短路。

 

状压方程：

f[S][i]表示从0号点出发，走过集合S中的点并到达i点的最短路长度。

 

转移：

f[S][i] = f[S/i][j] + g[j][i];

 

初始状态:

f[(1 << (i - 1))][i] = g[0][i]

 

答案:

min(f[(1 << n) - 1][i] + g[i][0]),i为1....n

 

Code

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
inline void read(int &x){x = 0;char ch = getchar();char c = ch;while(ch < '0' || ch > '9')c = ch, ch = getchar();while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();if(c == '-')x = -x;}
inline int max(int a, int b){return a > b ? a : b;}
inline int min(int a, int b){return a < b ? a : b;}

const int INF = 0x3f3f3f3f;
const int MAXN = 10 + 4;

int n,g[MAXN][MAXN],dp[1 << MAXN][MAXN],ans;

inline void init()
{
    //清空
    memset(g, 0, sizeof(g));
    memset(dp, 0, sizeof(dp));
    //读入
    for(int i = 0;i <= n;++ i)
        for(int j = 0;j <= n;j ++)
            read(g[i][j]);
}

inline void Floyd()
{
    for(int k = 0;k <= n;++ k)
        for(int i = 0;i <= n;++ i)
            for(int j = 0;j <= n;++ j)
                if(g[i][j] > g[i][k] + g[k][j])
                    g[i][j] = g[i][k] + g[k][j];
}

//dp[S][j]  表示已经经过点集i到达j点的最短时间   1表示经过，0表示未经过
//dp[S][j] = min(dp[S/k][k] + g[k][j])  k∈S  iS/k表示i去掉k 

inline void DP()
{    
    //枚举点集 
    for (int S = 1;S < (1 << n); ++ S)
        //枚举出发点 
        for (int i = 1;i <= n;++ i)
        {
            if(!(S & (1 << (i - 1))))continue; 
            //如果集合中只有出发点一个点  到达它需要g[0][i]的时间 
            if (S == (1 << (i - 1)))
            {
                dp[S][i] = g[0][i];
                break;
            }
            dp[S][i] = INF;
            for (int j = 1;j <= n;++ j)
            {
                if (j == i)continue;
                if (!(S & (1 << (j - 1))))continue;
                dp[S][i] = min(dp[S][i], dp[S ^ (1 << (i - 1))][j] + g[j][i]);
            }    
        }
    ans = INF;
    for (int i = 1;i <= n;++ i)
        ans = min(ans, dp[(1 << n) - 1][i] + g[i][0]);
}

inline void out()
{
    printf("%d
", ans);
}

int main()
{
    while (scanf("%d", &n))
    {
        if (!n)break;
        //初始化操作 
        init(); Floyd();DP(); out();
    }
    return 0;
}