[图论]最小生成树

kruskal算法

#include<bits/stdc++.h>
#define maxn 10005
struct edge{
    int u, v, c;
}g[maxn];
int par[maxn];
int find(int x){return par[x] < 0 ? x : par[x] = find(par[x]);}
bool comp(edge a, edge b){return a.c < b.c;}
int main()
{
    int n, m;
    while (scanf("%d %d", &n, &m) && n){
        memset(par, -1, sizeof(par));
        for (int i = 0; i < n; ++i) scanf("%d %d %d", &g[i].u, &g[i].v, &g[i].c);
        std::sort(g, g + n, comp);
        long long ans = 0;
        for (int i = 0; i < n; ++i){
            int x = find(g[i].u), y = find(g[i].v);
            if (x != y){
                ans += g[i].c;
                par[x] += par[y];
                par[y] = x;
            }
        }
        if (-par[find(g[0].u)] != m) puts("?");
        else printf("%lld\n", ans);
    }
    return 0;
}

生成路径版

#include<bits/stdc++.h>
#define maxn 10005
struct edge{
    int u, v;
    double c;
}g[maxn];
int par[maxn], px[105], py[105];
int find(int x){return par[x] < 0 ? x : par[x] = find(par[x]);}
bool comp(edge a, edge b){return a.c < b.c;}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--){
        memset(par, -1, sizeof(par));
        int n, m = 0;
        scanf("%d", &n);
        for (int i = 0; i < n; ++i) scanf("%d %d", &px[i], &py[i]);
        for (int i = 0; i < n; ++i){
            for (int j = i + 1; j < n; ++j){
                double t = sqrt((px[i] - px[j]) * (px[i] - px[j]) + (py[i] - py[j]) * (py[i] - py[j]));
                if (t < 10 || t > 1000) continue;
                g[++m].c = t;
                g[m].u = i, g[m].v = j;
            }
        }
        std::sort(g + 1, g + 1 + m, comp);
        double ans = 0;
        for (int i = 1; i <= m; ++i){
            int x = find(g[i].u), y = find(g[i].v);
            if (x != y){
                ans += g[i].c;
                par[x] += par[y];
                par[y] = x;
            }
        }
        if (-par[find(g[0].u)] != n) puts("oh!");
        else printf("%.1f\n", 100 * ans);
    }
    return 0;
}

bfs建图最小生成树：
多看几遍题目就会发现是建一个所有点之间的完全图，然后再求最小生成树。
但是这题巨麻烦，输入里有很多空格，首次把我的输入输出外挂搞爆了。

#include<vector>
#include<queue>
#include<stdio.h>
#include<map>
#include<string.h>
#include<algorithm>
#define mp make_pair
using namespace std;
typedef long long ll;
inline ll in()
{
    ll res=0,p=1;
    char c=getchar();
    while(c<'0'||c>'9') {if(c=='-') p=-1; c=getchar();}
    while(c>='0'&&c<='9') res=res*10+c-48,c=getchar();
    return p*res;
}
void out(ll x)
{
    if (x>9) out(x/10);
    putchar(x%10+48);
}
void outn(ll x)
{
    if (x<0){
        putchar('-');
        out(-x);
    }else out(x);
    putchar(10);
}
const int mod = 1e9 + 7, inf = 0x3f3f3f3f;
//const double pi = acos(-1.0);
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int dx[4] = {0, 0, -1, 1}, dy[4] = {1, -1, 0, 0};
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll quickpow(ll x, ll k)
{
    ll res = 1;
    while(k){
        if(k & 1) res = (res * x) % mod;
        k >>= 1, x = (x * x) % mod;
    }
    return res;
}

const int maxn = 1005;

struct edge{
    int u, v, c;
}g[maxn * maxn];
int dis[maxn][maxn], par[maxn];
map<pair<int, int>, int> mpiii;
vector<pair<int, int> > vp;
bool comp(edge a, edge b){return a.c < b.c;}
int find(int x){return par[x] < 0 ? x : par[x] = find(par[x]);}
int main()
{
    char cg[maxn][maxn];
    int t;
    scanf("%d", &t);
    while (t--){
        int n, m, tp = 0;
        scanf("%d %d", &m, &n);
        gets(cg[0]);
        for (int i = 1; i <= n; ++i) gets(cg[i] + 1);

        for (int i = 1; i <= n; ++i){
            for (int j = 1; j <= m; ++j){
                if (cg[i][j] == 'A' || cg[i][j] == 'S'){
                    mpiii[mp(i, j)] = ++tp;
                    vp.push_back(mp(i, j));
                }
            }
        }

        int tb = 0;
        for (int i = 0; i < vp.size(); ++i){
            memset(dis, 0x3f, sizeof(dis));
            int curi = vp[i].first, curj = vp[i].second;
            int tid = mpiii[mp(curi, curj)];
            dis[curi][curj] = 0;
            queue<pair<int, int> > q;
            q.push(mp(curi, curj));
            while (!q.empty()){
                pair<int, int> t = q.front(); q.pop();
                int tx = t.first, ty = t.second;
                for (int i = 0; i < 4; ++i){
                    if (cg[tx + dx[i]][ty + dy[i]] == '#' || dis[tx + dx[i]][ty + dy[i]] != inf) continue;
                    dis[tx + dx[i]][ty + dy[i]] = dis[tx][ty] + 1;
                    q.push(mp(tx + dx[i], ty + dy[i]));
                }
            }
            for (int i = 1; i <= n; ++i){
                for (int j = 1; j <= m; ++j){
                    if (cg[i][j] == 'A' || cg[i][j] == 'S'){
                        g[tb].u = tid, g[tb].v = mpiii[mp(i, j)], g[tb].c = dis[i][j];
                        ++tb;
                    }
                }
            }
        }

        int ans = 0;
        sort(g, g + tb, comp);
        memset(par, -1, sizeof(par));
        for (int i = 0; i < tb; ++i){
            int x = find(g[i].u), y = find(g[i].v);
            if (x != y){
                ans += g[i].c;
                par[x] += par[y];
                par[y] = x;
            }
        }
        outn(ans);
        vp.clear();
    }
    return 0;
}