prim和kruskal

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1102

prim：

 

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define mod int(1e9+7)
#define P pair<int,int>
#define pi acos(-1)
int n,a[108][108],d[108],x;
bool c[108];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    while(cin>>n)
    {
        REW(c,true);REW(d,inf);REW(a,0);
        ll s=0;
        for(int i=1;i<=n;i++)
         for(int j=1;j<=n;j++) cin>>a[i][j];
        cin>>x;
        while(x--)
        {
            int y,z;
            cin>>y>>z;
            a[y][z]=a[z][y]=0;
        }
        c[1]=false;
        for(int i=1;i<=n;i++) d[i]=a[1][i];
        for(int i=1;i<=n;i++)
        {
            int q=inf+10,qq=0,tt=0;
            for(int j=1;j<=n;j++)
             if(c[j]&&q>d[j]) q=d[j],qq=j,tt++;
            c[qq]=false;
            if(tt) s+=q;
            for(int j=1;j<=n;j++)
             if(c[j]) d[j]=min(d[j],a[qq][j]);
        }
        cout<<s<<endl;
    }
    return 0;
}

kruskal：

 

 

#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<long long> VI;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define SZ(x) ((long long)(x).size())
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
struct as{
int u,v,d;}a[10008];
int n,fa[108];
bool cmp(as a,as b) {return a.d<b.d;}
int fid(int x)
{
    int a=x,b;
    while(a!=fa[a]) a=fa[a];
    while(x!=fa[x]) b=fa[x],fa[x]=a,x=b;
    return a;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    while(cin>>n)
    {
        int qw=0,ans=0,x;
        FOR(i,1,n)
         FOR(j,1,n)
         {
             si(x);
             if(i>j) a[++qw].u=j,a[qw].v=i,a[qw].d=x;
         }
        FOR(i,1,n) fa[i]=i;
        sort(a+1,a+qw+1,cmp);
        cin>>x;
        while(x--)
        {
            int y,z,fy,fz;
            si(y),si(z);
            fy=fid(y);fz=fid(z);
            if(fy==fz) continue;
            fa[fy]=fz;
        }
        FOR(i,1,qw)
        {
            int fx=fid(a[i].u),fy=fid(a[i].v);
            if(fx==fy) continue;
            fa[fx]=fy;
            ans+=a[i].d;
        }
        cout<<ans<<endl;
    }
    return 0;
}