kuangbin_MST A (POJ 1251)

模板题 Kruskal直接过 调试时候居然在sort(edge + 1, edge + 1 + m)上浪费好多时间...

不过本着ACMer的心态自然要测试一下两种方法分别的速度

Kruskal : Memory 392 Time 16

Prim: Memory 576 Time 16

...........哦居然一样啊

Prim

#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#define INF 0x3F3F3F3F
using namespace std;

typedef pair<int, int> pii;
struct cmp{
    bool operator() (const pii a, const pii b){
        return a.first > b.first;
    }
};

int size, head[], point[], nxt[], val[];
int n, dist[];

void init()
{
    size = ;
    memset(head, - ,sizeof head);
}

void add(int from, int to, int value)
{
    val[size] = value;
    point[size] = to;
    nxt[size] = head[from];
    head[from] = size++;
}

int prim(int s)
{
    int ans = ;
    bool vis[];
    memset(dist, 0x3f, sizeof dist);
    memset(vis, false, sizeof vis);

    priority_queue<pii, vector<pii>, cmp> q;
    for(int i = head[s]; ~i; i = nxt[i]){
        dist[point[i]] = val[i];
        q.push(make_pair(val[i], point[i]));
    }
    dist[s] = ;
    vis[s] = true;
    while(!q.empty()){
        pii u = q.top();
        q.pop();
        if(vis[u.second]) continue;
        vis[u.second] = true;
        ans += u.first;
        for(int i = head[u.second]; ~i; i = nxt[i]){
            int j = point[i];
            //printf("check edge[%d][%d] vis = %d value = %d\n", u.second, j, vis[j], val[i]);
            if(!vis[j] && dist[j] > val[i]){
                //printf("add edge[%d][%d]\n", u.second, j);
                dist[j] = val[i];
                q.push(make_pair(dist[j], j));
            }
        }
    }
    return ans;
}

int main()
{
    while(scanf("%d", &n), n){
        init();
        for(int i = ; i < n; i++){
            int k;
            scanf("%*s%d", &k);
            while(k--){
                char to[];
                int value;
                scanf("%s%d", to, &value);
                add(i, to[]-'A'+, value);
                add(to[]-'A'+, i, value);
            }
        }
        printf("%d\n", prim());
    }
    return ;
}

Kruskal

#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#define INF 0x3F3F3F3F
using namespace std;

int n, m;
int parent[], rank[];
struct Edge{int u, v, w;}edge[];

bool cmp(Edge a, Edge b)
{
    return a.w < b.w;
}

inline int FindSet(int x)
{
    while(x != parent[x]) x = parent[x];
    return x;
}

void UnionSet(int l, int r)
{
    int x = FindSet(l);
    int y = FindSet(r);
    if(rank[x] > rank[y]){
        rank[x] += rank[y];
        parent[y] = x;
    }
    else{
        rank[y] += rank[x];
        parent[x] = y;
    }
}

int kruskal()
{
    for(int i = ; i <= n; i++){
        parent[i] = i;
        rank[i] = ;
    }
    int ans = ;
    sort(edge+, edge+m+, cmp);
    for(int i = , num = ; num < n- && i <= m; i++){
        int x = FindSet(edge[i].u);
        int y = FindSet(edge[i].v);
        if(x != y){
            num++;
            UnionSet(x, y);
            ans += edge[i].w;
        }
    }
    return ans;
}

int main()
{
    while(scanf("%d", &n), n){
        m = ;
        for(int i = ; i < n; i++){
            int k;
            scanf("%*s%d", &k);
            while(k--){
                m++;
                edge[m].u = i;
                char v[];
                scanf("%s%d", v, &edge[m].w);
                edge[m].v = v[] - 'A' + ;
                //printf("Edge %d : u = %d v = %d w = %d\n", m, edge[m].u, edge[m].v, edge[m].w);
            }
        }
        printf("%d\n", kruskal());
    }
    return ;
}