最小树形图：带注释+虚拟源点【HDU2121】

#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1) 
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define hash Hash
#define next Next
#define count Count
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 3e4+10, mod = 1e9 + 7;
const double eps = 1e-10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
    read(first);
    read(args...);
}
struct Edge{
    int x,y;
    int w;
}edge[N];
int minroot;
int vis[N];
int id[N];//结点所属环编号
int in[N],pre[N];//in[]为最小入边权,pre[]为其对应的起点
int zhuLiu(int root,int n,int m){//root结点、点数、边数
    int res=0;//最小树形图总权值
    while(true){
        for(int i=0;i<n;i++)//初始化为无穷大
            in[i]=INF;
 
        //寻找每个点的最小入边
        for(int i=0;i<m;i++){//遍历每条边
            int x=edge[i].x;
            int y=edge[i].y;
            if(edge[i].w<in[y] && x!=y){//更新最小入边
                pre[y]=x;//记录前驱
                in[y]=edge[i].w;//更新
                if(x == root) minroot = i;
            }
        }
 
        //判断是否存在最小树形图
        for(int i=0;i<n;i++){
            if(i==root)
                continue;
            if(in[i]==INF)//除根节点外的点存在孤立点
                return -1;
        }
 
        //寻找所有的环
        int cnt=0;//记录环数
        in[root]=0;
        memset(id,-1,sizeof(id));
        memset(vis,-1,sizeof(vis));
        for(int i=0;i<n;i++){//标记每个环
            res+=in[i];//记录权值
 
            int y=i;
            while(vis[y]!=i&&id[y]==-1&&y!=root){//寻找图中有向环
                //三种情况会终止：找到出现同样标记的点、结点已属其他环、遍历到根
                vis[y]=i;//标记
                y=pre[y];//向上找
            }
 
            if(y!=root&&id[y]==-1){//没有遍历到根或没有找到结点属于其他环,说明找到有向环
                for(int x=pre[y];x!=y;x=pre[x])//标记结点x为第几个环
                    id[x]=cnt;//记录结点所属环号
                id[y]=cnt++;//记录结点所属环号并累加
            }
        }
        if(cnt==0)//无环
                break;
        for(int i=0;i<n;i++)//可能存在独立点
            if(id[i]==-1)//环数累加
                id[i]=cnt++;
 
        //建立新图,缩点重新标记
        for(int i=0;i<m;i++){
            int x=edge[i].x;
            int y=edge[i].y;
            edge[i].x=id[x];
            edge[i].y=id[y];
 
            if(id[x]!=id[y])//两点不在同一环内,更新边权值
                edge[i].w-=in[y];//x到y的距离为边权-in[y]
        }
 
        n=cnt;//以环数为下次操作的点数,继续上述操作,直到无环
        root=id[root];
    }
    return res;
}
int main(){
    int n,m;//n个点m条有向边
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int sum = 0;
        for(int i=0;i<m;i++){//建图
            scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
            edge[i].x ++, edge[i].y ++;
            sum += edge[i].w;
            if(edge[i].x==edge[i].y)//除去自环,即点到自身距离为INF
                edge[i].w=INF;
        }
        for(int i = m, j = 1; i < m + n; ++ i, ++ j)
        {
            edge[i].x = 0, edge[i].y = j;
            edge[i].w = sum + 1;
        }
        int res = zhuLiu(0,n+1,n+m);
        if(res==-1||res >= sum * 2 + 2)
            printf("impossible\n");
        else
            printf("%d %d\n",res-sum-1,minroot-m);
            printf("\n");
    }
    return 0;
}