POJ1789

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2000+10;
const int maxm=5000000;

struct Edge
{
    int u,v,dist;
    Edge(){}
    Edge(int u,int v,int d):u(u),v(v),dist(d){}
    bool operator<(const Edge &rhs)const
    {
        return dist < rhs.dist;
    }
};

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

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

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

    int kruskal()
    {
        int sum=0;
        int 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))
            {
                sum +=edges[i].dist;
                fa[findset(u)] = findset(v);
                if(++cnt>=n-1) break;
            }
        }
        if(cnt<n-1) return -1;
        return sum;
    }
}KK;

//const int maxn=2000+4;
int n;
char str[maxn][10];

int main()
{
    while(scanf("%d",&n))
    {
        if(n==0)break;
        for(int i=1;i<=n;i++){
            scanf("%s",&str[i]);
        }
        KK.init(n);
        for(int i=1;i<=n;i++)
            for(int j=i+1;j<=n;j++)
        {
            int cnt=0;
            for(int k=0;k<7;k++)
            {
                if(str[i][k]!=str[j][k])cnt++;
            }
            KK.AddEdge(i,j,cnt);
        }
        printf("The highest possible quality is 1/%d.\n",KK.kruskal());

    }
    return 0;
}