[HDU 2121] Ice_cream’s world II 最小树形图

http://acm.hdu.edu.cn/showproblem.php?pid=2121

题意：输入有 n 个点 m 条有向边，求图的最小生成树。

思路：因为图中的边是有向边，所以题目要求的就是最小树形图，可以构建一个超级源点，到每个点的距离为所有边权值的和+1。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int maxn = 1005;
const int maxx = 11005;
const int inf = (1 << 31) - 1;

struct node
{
    int value;
    int in, to;
};

int cnt, pos;
int in[maxn];
node side[maxx];
int pre[maxn], id[maxn], vis[maxn];

int Mst(int rt, int n, int m)
{
    int sum = 0;
    while(true){
        for(int i = 0; i < n; i++){
            in[i] = inf;
        }
        for(int i = 0; i < m; i++)  //求最小入边
        {
            int x = side[i].to;
            if(in[x] > side[i].value && x != side[i].in){
                in[x] = side[i].value;
                pre[x] = side[i].in;
                if(side[i].in == rt) //保存真正的根
                    pos = i;
            }
        }
        for(int i = 0; i < n; i++){
            if(i != rt && in[i] == inf)  //判断是否有除根以外入度为0的点
                return -1;
        }
        cnt = in[rt] = 0;
        memset(id, -1, sizeof(id));
        memset(vis, -1, sizeof(vis));
        for(int i = 0; i < n; i++){
            sum += in[i];
            int x = i;
            while(vis[x] != i && x != rt && id[x] == -1){  //找环
                vis[x] = i;
                x = pre[x];
            }
            if(id[x] == -1 && x != rt){  //给边重新编号
                int y = pre[x];
                while(x != y){
                    id[y] = cnt;
                    y = pre[y];
                }
                id[x] = 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 = side[i].to;
            side[i].in = id[side[i].in];
            side[i].to = id[side[i].to];
            if(side[i].in  != side[i].to)
                side[i].value -= in[x];
        }
        n = cnt;
        rt = id[rt];
    }
    return sum;
}


int main()
{
    int n, m;
    while(~scanf("%d%d", &n, &m)){
        int x, y;
        int val, sum = 0;
        for(int i = 0; i < m; i++){
            scanf("%d%d%d", &x, &y, &val);
            side[i].in = x;
            side[i].to = y;
            side[i].value = val;
            sum += val;
        }
        sum++;
        for(int i = m; i < m + n; i++){  //构造超级源点
            side[i].in = n;
            side[i].to = i - m;
            side[i].value = sum;
        }
        int res = Mst(n, n+1, m+n);
        if(res == -1 || res >= 2*sum){
            printf("impossible\n\n");
        }
        else{
            printf("%d %d\n\n", res - sum, pos - m);
        }
    }
}