UVa 10911 - Forming Quiz Teams

集合上的dp问题，和佳神给的例题是类似。d （S ) 表示是把集合S中的元素两两配对后的最小距离和。

d（S）= min { |Pi Pj| + d ( S - {i} - {j} ）}；

 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
const int MAX = 10;
const int INF = 1 << 30;

using namespace std;

double dp[1 << ( 2 * MAX )];
int Case, x[MAX * 2], y[MAX * 2], cnt;

double dist ( int i, int j ) {
    return sqrt ( pow( (double)( x[i] - x[j] ), 2 ) + pow( (double)( y[i] - y[j] ), 2 ) );
}
int main ( ) {
    //freopen("input.txt", "r", stdin);
    cnt = 1;
    while ( scanf ( "%d", &Case ) == 1 ) {
        if ( !Case ) break;
        int nn = 2 * Case;
        char name[25];
        for ( int i = 0; i < nn; ++i )
            scanf ( "%s%d%d", name, &x[i], &y[i] );

        for ( int S = 0; S < ( 1 << nn ); ++S ) {
            int i, j;
            dp[S] = INF;
            bool flag = 1;
            for ( i = 0; i < nn; ++i )
                if ( S & ( 1 << i ) ) break;
            for ( j = i + 1; j < nn; ++j )
                if ( S & ( 1 << j ) ) dp[S] = min ( dp[S], dist ( i, j ) + dp[S ^ ( 1 << i ) ^ ( 1 << j )] ), flag = 0;
            if ( flag ) dp[S] = 0;
        }

        printf ( "Case %d: %.2lf\n", cnt++, dp[(1 << nn) - 1] );
    }
}