POJ 1789 ruck History

题目大意 给你n个串 2个串之间的距离为 相同位置上不同字符的数量

暴力处理出距离建边即可 这题属于稠密图 Kruscal 要跑1800ms 而prim 只需跑400ms

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<set>
#include<stack>
#define bug puts("bugbugbug");
using namespace std;
typedef long long ll;
const int maxm=4000005;
int f[2005];
int n,m;
struct node
{
    int x, y, v;
    bool operator<(const node &b)const
    {
        if(this->v!=b.v)
            return (this->v<b.v);
        if(this->x!=b.x)
            return (this->x<b.x);
        return (this->y<b.y);
    }
} e[maxm];
int find(int x)
{
    return f[x]= f[x]==x?x:find(f[x]);
}
int Kruscal()
{
    sort(e, e + m);
    int cnt = n, ans = 0;
    for(int i = 0; i <= n; i++) f[i] = i;
    for (int i = 0; i < m; i++)
    {
        int x = find(e[i].x);
        int y = find(e[i].y);
        if (x != y)
        {
            f[x] = y;
            cnt--;
            ans+= e[i].v;
            if (cnt == 1) break;
        }
    }
    if(cnt!=1)return -1;
    return ans;
}
char a[2005][10];
int main()
{
    while(scanf("%d",&n)&&n)
    {
        m=0;
        for(int i=0; i<n; i++)
            {
                scanf("%s",a[i]);
            }
            for(int i=0;i<n;i++)
                for(int j=i+1;j<n;j++)
            {
                int cnt=0;
                for(int k=0;k<7;k++)
                    if(a[i][k]!=a[j][k])cnt++;
                e[m].x=i;
                e[m].y=j;
                e[m++].v=cnt;
            }
        printf("The highest possible quality is 1/%d.\n",Kruscal());
    }
}

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<set>
#include<stack>
#define bug puts("bugbugbug");
using namespace std;
typedef long long ll;
//适合稠密图 复杂度n*n n为点数
const int INF=1000000010;
const int N=2005;//N 为点的数量
int vis[N],dis[N];
//vector<int> V[N];//邻接表存边
int g[N][N]={0};//邻接矩阵存边
int n,m;
int prim() {
    memset(vis, 0,sizeof(vis));
    for (int i = 1; i <= n; i++) dis[i] = i==1? 0 : INF;//初始化
    int ans = 0;
    int i;
    for (i = 1; i <= n; i++) {
        int k = -1, minn = INF;
        for (int j = 1; j <= n; j++)
            if (!vis[j] && dis[j] < minn) {
            minn = dis[j];
            k = j;
        }
        if (k == -1) break;
        vis[k] = 1, ans += dis[k];
        for (int j = 1; j <= n; j++)
            if(j!=k)
            {
            int u = j;
            if (!vis[u] && g[k][u] < dis[u]) dis[u] = g[k][u];
        }
    }
    return ans;
}
char a[2005][10];
int main()
{
    while(scanf("%d",&n)&&n)
    {
        for(int i=1; i<=n; i++)
            {
                scanf("%s",a[i]);
            }
            for(int i=1;i<=n;i++){
                    g[i][i]=0;
                for(int j=i+1;j<=n;j++)
            {
                int cnt=0;
                for(int k=0;k<7;k++)
                    if(a[i][k]!=a[j][k])cnt++;
               g[i][j]=g[j][i]=cnt;
            }
            }
        printf("The highest possible quality is 1/%d.\n",prim());
    }
}

暴力处理出距离建边即可 这题属于稠密图 Kruscal 要跑1800ms 而prim 只需跑400ms