From Evernote:

uva 10496

TSP 第二次學習狀壓DP，小心一開始就是0的情況

[sourcecode language="cpp"]
//============================================================================
// Name : Collecting Beepers.cpp
// Date : 2013 2013/2/7 下午1:10:25
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 25
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX-20000
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int mz[M][M];
int dp[1<<12][20];
int bx,by,sx,sy;
int beepx[15],beepy[15];
int main() {
ios_base::sync_with_stdio(0);
int test;
scanf("%d",&test);
while(test--){
fill(&dp[0][0],&dp[(1<<12)-1][20-1],oo);
Set(mz,0);
scanf("%d%d",&bx,&by);
scanf("%d%d",&beepx[0],&beepy[0]);
int m;
scanf("%d",&m);
for(int i=1;i<=m;i++){
scanf("%d%d",&beepx[i],&beepy[i]);
}
for(int i=0;i<=m;i++){
for(int j=i+1;j<=m;j++){
mz[i][j]=abs(beepx[i]-beepx[j])+abs(beepy[i]-beepy[j]);
mz[j][i]=abs(beepx[i]-beepx[j])+abs(beepy[i]-beepy[j]);
}
}
m++;
dp[(1<<m)-1][0]=0;
for(int s=(1<<m)-2;s>=0;s--){
for(int u=0;u<m;u++){
for(int v=0;v<m;v++){
if(!(s>>v&1)&&mz[u][v]!=0){
dp[s][u]=min(dp[s][u],dp[s|(1<<v)][v]+mz[u][v]);
}
}
}
}
if(dp[0][0]==oo)dp[0][0]=0;
printf("The shortest path has length %d\n",dp[0][0]);
}

}

[/sourcecode]