UOJ #31654 次小生成树

链接：https://darkbzoj.tk/submission/31654

思路：倍增维护最大值和严格次大值

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
const int maxm = 600005;
int he[maxn],ver[maxm],tot,ne[maxm],cost[maxm];
void add( int x,int y,LL z ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
    cost[tot] = z;
}
struct edge{
    int x,y;
    LL z;
    edge( int _x,int _y,LL _z ){
        x = _x;
        y = _y;
        z = _z;
    }
    bool operator <( const edge& b )const{
        return z < b.z;
    }
};
vector<edge> ve;
int f[maxn];
int get( int x ){
    if( x == f[x] ) return x;
    return f[x] = get(f[x]);
}
int vis[maxm],d[maxn],fa[maxn][21],dis[maxn][21],dis2[maxn][21];
queue<int> que;
void build(){
    d[1] = 1;
    que.push(1);
    while(que.size()){
        int x= que.front();
        que.pop();
        for( int cure=  he[x];cure;cure = ne[cure] ){
            int y = ver[cure];
            if(d[y]) continue;
            d[y] = d[x]+1;
            fa[y][0] =x;
            dis[y][0] = cost[cure];
            for( int i = 1;i <= 20;i++ ){
                fa[y][i] = fa[ fa[y][i-1] ][i-1];
                dis[y][i] = max( dis[y][i-1],dis[fa[y][i-1]][i-1] );
                if( dis[y][i] == dis[y][i-1] && dis[y][i] == dis[fa[y][i-1]][i-1] ){
                    dis2[y][i] = max(dis2[y][i-1],dis2[fa[y][i-1]][i-1]);
                }else if( dis[y][i] == dis[y][i-1] ){
                    dis2[y][i] = max( dis2[y][i-1],dis[fa[y][i-1]][i-1] );
                }else if( dis[y][i] == dis[fa[y][i-1]][i-1] ){
                    dis2[y][i] = max( dis2[fa[y][i-1]][i-1],dis[y][i-1] );
                }
            }
            que.push(y);
        }
    }
}
pair<LL,LL> lca( int x,int y ){
    LL res = 0,res2 = 0;
    if( d[y] > d[x] ) swap(x,y);
    for( int i = 20; i >= 0;i-- ){
        if( d[fa[x][i]] >= d[y] ) {
            if( dis[x][i] > res ){
                swap(res,res2);
                res = dis[x][i];
            }
            if( dis[x][i] > res2 && dis[x][i] < res ){
                res2 = dis[x][i];
            }
            if( dis2[x][i] > res2 && dis2[x][i] < res ){
                res2 = dis2[x][i];
            }
            x = fa[x][i];
        }
    }
    if( x == y ) return make_pair(res,res2);
    for( int i = 20; i >= 0;i-- ){
        if( fa[x][i] == fa[y][i] ) continue;
        if( dis[x][i] > res ){
            swap(res,res2);
            res = dis[x][i];
        }
        if( dis[x][i] > res2 && dis[x][i] < res ){
            res2 = dis[x][i];
        }
        if( dis2[x][i] > res2 && dis2[x][i] < res ){
            res2 = dis2[x][i];
        }
        if( dis[y][i] > res ){
            swap(res,res2);
            res = dis[y][i];
        }
        if( dis[y][i] > res2 && dis[y][i] < res ){
            res2 = dis[y][i];
        }
        if( dis2[y][i] > res2 && dis2[y][i] < res ){
            res2 = dis2[y][i];
        }
        x = fa[x][i];y = fa[y][i];
    }
    if( dis[x][0] > res ){
        swap(res,res2);
        res = dis[x][0];
    }
    if( dis[x][0] > res2 && dis[x][0] < res ){
        res2 = dis[x][0];
    }
    if( dis2[x][0] > res2 && dis2[x][0] < res ){
        res2 = dis2[x][0];
    }
    if( dis[y][0] > res ){
        swap(res,res2);
        res = dis[y][0];
    }
    if( dis[y][0] > res2 && dis[y][0] < res ){
        res2 = dis[y][0];
    }
    if( dis2[y][0] > res2 && dis2[y][0] < res ){
        res2 = dis2[y][0];
    }
    return make_pair(res,res2);
}
int main(){
    int n,m,x,y;
    LL z;
    scanf("%d%d",&n,&m);
    for( int i = 1;i <= m;i++ ){
        scanf("%d%d%lld",&x,&y,&z);
        ve.push_back( edge(x,y,z) );
    }
    LL ans = 0;
    sort(ve.begin(),ve.end());
    for( int i = 1;i <= n;i++ ) f[i] = i;
    for( int i = 0; i < ve.size();i++ ){
        int x = ve[i].x;
        int y = ve[i].y;
        int xx = get(x);int yy = get(y);
        if( xx != yy ) {
            f[xx] = yy;
            vis[i] = 1;
            add( ve[i].x,ve[i].y,ve[i].z );
            add(ve[i].y,ve[i].x,ve[i].z);
            ans += ve[i].z;
        }
    }
    build();
    LL dt = 0x3f3f3f3f3f3f;
    for( int i = 0;i < ve.size();i++ ){
        if( vis[i] ) continue;
        pair<LL,LL> v = lca( ve[i].x,ve[i].y );
        if( v.first != ve[i].z ){
            dt = min(dt,ve[i].z - v.first );
        }else if( v.second != ve[i].z ){
            dt = min( dt,ve[i].z - v.second );
        }
    }
    printf("%lld",ans+dt);
    return 0;
}