[Kruskal] POJ 1789

题意:

用一个7位的string代表一个编号，两个编号之间的distance代表这两个编号之间不同字母的个数。一个编号只能由另一个编号“衍生”出来，代价是这两个编号之间相应的distance，现在要找出一个“衍生”方案，使得总代价最小，也就是distance之和最小。

思路

首先计算出任意两个string之间的距离,然后对Kruskal添加边,计算最小生成树即可.
由于本题是完全图,所以一定存在最小生成树.

代码

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 2010;
const int M = 2000 * 2000 + 10;

struct Edge {
    int u, v, dis;

    bool operator< ( const Edge &rhs ) const { return dis < rhs.dis; }
};

struct Kruskal {
    int n, m;
    Edge edges[ M ];
    int fa[ N ];
    int findset ( int x ) { return fa[ x ] == -1 ? x : fa[ x ] = findset ( fa[ x ] ); }

    void init ( int _n ) {
        n = _n;
        m = 0;
        memset ( fa, -1, sizeof ( fa ) );
    }

    void AddEdge ( int u, int v, int d ) { edges[ m++ ] = Edge{u, v, d}; }

    int kruskal () {
        int sum = 0, cnt = 0;
        sort ( edges, edges + m );

        for ( int i = 0; i < m; ++i ) {
            int u = edges[ i ].u, v = edges[ i ].v;
            if ( findset ( u ) != findset ( v ) ) {
                fa[ findset ( u ) ] = findset ( v );
                sum += edges[ i ].dis;

                if ( ++cnt >= n - 1 )
                    return sum;
            }
        }
        return -1;
    }
} KK;

char str[ N ][ 8 ];

int getdis ( int u, int v ) {
    int cnt = 0;
    for ( int i = 0; i < 7; ++i )
        if ( str[ u ][ i ] != str[ v ][ i ] )
            ++cnt;
    return cnt;
}

int main () {
    int n;
    while ( scanf ( "%d", &n ) && n ) {
        for ( int i = 0; i < n; ++i )
            scanf ( "%s", str[ i ] );

        KK.init ( n );

        for ( int i = 0; i < n; ++i )
            for ( int j = i + 1; j < n; ++j )
                KK.AddEdge ( i, j, getdis ( i, j ) );

        int sol = KK.kruskal ();
        printf ( "The highest possible quality is 1/%d.\n", sol );
    }
    return 0;
}