UVA11183-Teen Girl Squad

题意：有n个点，m条有向边，问能不能从0号点做到所有点，并求出最小权值

解题思路：最小树形图

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;
const int MAXN = 1010;
const int MAXM = 40010;

struct Edge
{
    int u,v;
    int cost;
}edge[MAXM];

int pre[MAXN],id[MAXN],visit[MAXN],in[MAXN];

int zhuliu(int root,int n,int m,Edge edge[])
{
    int res = 0,u,v;
    while(1)
    {
        for(int i = 0; i < n; i++) in[i] = INF;
        for(int i = 0; i < m; i++)
        {
            if(edge[i].u != edge[i].v && edge[i].cost < in[edge[i].v])
            {
                pre[edge[i].v] = edge[i].u;
                in[edge[i].v] = edge[i].cost;
            }
        }
        for(int i = 0; i < n; i++)
            if(i != root && in[i] == INF) return -1; //不存在最小树形图
        int tn = 0;
        memset(id,-1,sizeof(id));
        memset(visit,-1,sizeof(visit));
        in[root] = 0;
        for(int i = 0; i < n; i++)
        {
            res += in[i];
            v = i;
            while( visit[v] != i && id[v] == -1 && v != root)
            {
                visit[v] = i;
                v = pre[v];
            }
            if( v != root && id[v] == -1 )
            {
                for(u = pre[v]; u != v ; u = pre[u])
                    id[u] = tn;
                id[v] = tn++;
            }
        }
        if(tn == 0) break;//没有有向环
        for(int i = 0; i < n; i++)
            if(id[i]==-1) id[i]=tn++;
        for(int i = 0; i < m;i++)
        {
            v = edge[i].v;
            edge[i].u = id[edge[i].u];
            edge[i].v = id[edge[i].v];
            if(edge[i].u != edge[i].v) edge[i].cost -= in[v];
            //else swap(edge[i],edge[--m]);
        }
        n = tn;
        root = id[root];
    }
    return res;
}

int main()
{
    int t,cas=0;
    int n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        int u,v,w;
        int L = 0;
        while(m--)
        {
            scanf("%d%d%d",&u,&v,&w);
            edge[L].u = u;
            edge[L].v = v;
            edge[L++].cost = w;
        }
        int ans=zhuliu(0,n,L,edge);
        printf("Case #%d: ",++cas);
        if(ans==-1) printf("Possums!\n");
        else printf("%d\n",ans);
    }
    return 0;
}