【POJ 3311】 Hie with the Pie 状态压缩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个点（1 ≤ n ≤ 10），编号为 1~n，出发点为0，并给定这n+1个点之间的有向路长度。要求从0点出发，通过其余n个点后又回到原点，求最短路径长度。

 

分析

由于在寻找最短路径过程中，对于经过相同中间路径的不同路径会造成重复计算（例如0-1-2-3-4-5 和 0-1-2-3-7-8），因此可以使用动态规划避免重复计算。

我们定义 dp[s][v] 表示经过了 s 集合中的所有点后停在 v 点的最小花费，其中 s 的二进制第 i 位为1代表经过该点，为0代表没经过该点（因为1 ≤ n ≤ 10，所以使用一个 int 就足够压缩所有的状态）。

转移方程为：

• dp[s][v] = min {dp[s][v], dp[s除去点v][u] + dis[u][v]}

 

AC代码

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;

const int N = 12;

int dis[N][N], dp[1 << N][N];



int main()
{
  int n;
  while(scanf("%d", &n))
  {
    if(!n)  break;
    for(int i = 0; i <= n; i++)
    {
      for(int j = 0; j <= n; j++)
      {
        scanf("%d", &dis[i][j]);
      }
    }
    
    for(int k = 0; k <= n; k++)
      for(int i = 0; i <= n; i++)  
        for(int j = 0; j <= n; j++)  
          if(dis[i][k] + dis[k][j] < dis[i][j])  dis[i][j] = dis[i][k] + dis[k][j];
    
    for(int s = 0; s < (1 << n); s++)
    {
      for(int i = 1; i <= n; i++)
      {
        if(s & (1 << (i - 1)))  //city i has been visited 
        {
          if(s == (1 << (i - 1)))  dp[s][i] = dis[0][i];
          else
          {
            dp[s][i] = INF;
            for(int j = 1; j <= n; j++)
            {
              if(j != i && s & (1 << (j - 1)))
              {
                dp[s][i] = min(dp[s][i], dp[s ^ (1 << (i - 1))][j] + dis[j][i]);
              }
            }
          }
        }
      }
    }
    
    int res = INF;
    for(int i = 1; i <= n; i++)
    {
      res = min(res, dp[(1 << n) - 1][i] + dis[i][0]);
    }
    printf("%d\n", res);

  }
  
  return 0;
}