记忆化搜索+状态压缩DP, 1 表示之前没有选择过
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <cmath>
using namespace std;
#define MAXN (1<<20) + 100
#define INF 1e10;
double dp[MAXN];
int n, S, cnt;
struct Point
{
int x, y;
} pos[20];
void init()
{
for( int i = 0; i < MAXN; i++)
dp[i] = -1;
dp[0] = 0;
}
double getdis( Point a, Point b )
{
return sqrt((double)(a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
double solve( int p )
{
if(dp[p]!=-1) return dp[p];
dp[p]=INF;
int i,j;
for(i = 2*n-1; i >= 0; i--)
if(p & (1<<i))
break;
for(j = i-1; j >= 0; j--)
if(p & (1<<j))
{dp[p]=min(dp[p],getdis(pos[i],pos[j])+solve(p^(1<<i)^(1<<j)));}
return dp[p];
}
int main()
{
char s[20];
int cnt = 1;
while(scanf("%d",&n) != EOF && n)
{
init();
for( int i = 0; i < 2*n; i++)
{
scanf("%s%d%d",s, &pos[i].x, &pos[i].y);
}
S = (1 << 2*n) - 1;
solve(S);
printf("Case %d: %.2lf\n",cnt++, dp[S]);
}
return 0;
}