[Acwing] 1148. 秘密的牛奶运输 次小生成树模板题

前言

传送门 :

思路

次小生成树裸题

因为数据范围很小,我们考虑跑一遍$kruskal$之后

枚举所有非树边

mycode

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 510,M = 20010;
int dist1[N][N],dist2[N][N]; //dist1[i][j]表示从i - j这条路径中权值的最大值,dist2表示次大值
struct Edge{
    int a,b,w;
    bool f;  //表示当前边是否是树边
    bool operator< (const Edge& W) const{
        return w < W.w;
    }
}edges[M];
int h[N],ne[M],e[M],w[M],idx;
int pa[N];
int n,m;


void add(int a,int b,int c){
    e[idx] = b;
    w[idx] = c;
    ne[idx] = h[a];
    h[a] = idx++;
}

int find(int x){
    if(x != pa[x]) pa[x] = find(pa[x]);
    return pa[x];
}

//fa表示上一个遍历的节点，作用是防止反向遍历
void dfs(int u,int fa,int max1,int max2,int d1[],int d2[]){  //求出i~u这段路径当中的最大值，邻接表的边是最小生成树中的边
    d1[u] = max1;   d2[u] = max2;
    for(int i = h[u];i != -1;i = ne[i]){
        int j = e[i];

        if(j == fa) continue;

        //记得用临时变量，不然后面遍历u的其他邻边的时候,max1和max2会由其他分支更新过来
        int t1 = max1, t2 = max2;

        if(t1 < w[i]) t2 = t1 , t1 = w[i];
        else if(t1 > w[i] && t2 < w[i]) t2 = w[i];

        dfs(j,u,t1,t2,d1,d2);
    }
}



int main()
{
    scanf("%d%d", &n, &m);
    memset(h, -1, sizeof h);
    for (int i = 0; i < m; i ++ )
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        edges[i] = {a, b, c};
    }

    sort(edges, edges + m);
    for (int i = 1; i <= n; i ++ ) pa[i] = i;

    LL sum = 0;  //记录最小生成树的权值
    for (int i = 0; i < m; i ++ )   //构造最小生成树的同时构造邻接表
    {
        int a = edges[i].a, b = edges[i].b, w = edges[i].w;
        int fa = find(a), fb = find(b);
        if (fa != fb)
        {
            pa[fa] = fb;
            sum += w;
            //双向图
            add(a, b, w), add(b, a, w);
            edges[i].f = true;  //标记为树边
        }
    }

    //求出i节点到图上各各节点之间的距离
    for (int i = 1; i <= n; i ++ ) dfs(i, -1, -1e9, -1e9, dist1[i], dist2[i]);

     LL res = 1e18;
    for (int i = 0; i < m; i ++ )   //求次小生成树
        if (!edges[i].f)   //是非树边
        {
            int a = edges[i].a, b = edges[i].b, w = edges[i].w;
            LL t;
            if (w > dist1[a][b])  //必须是严格大于才能得到次小的生成树
                //减去一条树边，加上一条非树边
                t = sum + w - dist1[a][b];
            else if (w > dist2[a][b])   //如果等于树中a~b的最大边，那么就比较次大边
                t = sum + w - dist2[a][b];
            res = min(res, t);
        }

    printf("%lld\n", res);

    return 0;
}