UVA 11183 Teen Girl Squad（最小树形图）

You are part of a group of n teenage girls armed with cellphones. You have some news you wantto tell everyone in the group. The problem is that no two of you are in the same room, and you mustcommunicate using only cellphones. What’s worse is that due to excessive usage, your parents haverefused to pay your cellphone bills, so you must distribute the news by calling each other in the cheapestpossible way. You will call several of your friends, they will call some of their friends, and so on untileveryone in the group hears the news.

Each of you is using a different phone service provider, and you know the price of girl A callinggirl B for all possible A and B. Not all of your friends like each other, and some of them will nevercall people they don’t like. Your job is to find the cheapest possible sequence of calls so that the newsspreads from you to all n-1 other members of the group.

Input

The first line of input gives the number of cases, N (N < 150). N test cases follow. Each one startswith two lines containing n (0 ≤ n ≤ 1000) and m (0 ≤ m ≤ 40, 000). Girls are numbered from 0 ton-1, and you are girl 0. The next m lines will each contain 3 integers, u, v and w, meaning that a callfrom girl u to girl v costs w cents (0 ≤ w ≤ 1000). No other calls are possible because of grudges,rivalries and because they are, like, lame. The input file size is around 1200 KB.

Output

For each test case, output one line containing ‘Case #x:’ followed by the cost of the cheapest methodof distributing the news. If there is no solution, print ‘Possums!’ instead. 

Sample Input

4
2
1
0 1 102

1
1 0 10
4
4
0 1 10
0 2 10
1 3 20
2 3 30
4
4
0 1 10
1 2 20
2 0 30
2 3 100

Sample Output

Case #1: 10
Case #2: Possums!
Case #3: 40
Case #4: 130

题意：

确定根的最小树形图，打一下模版就行。

根是0.

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <string>
typedef long long LL;
using namespace std;
const int maxn = 1111;
const int maxm = 44444;
const int inf = 0x3f3f3f3f;
int n,m;
struct edge
{
    int u,v;
    int w;
}len[maxm];
int zhuliu(int root)
{
    int in[maxn];
    int pre[maxn];
    int res=0;
    while(1){
        for(int i=1;i<=n;i++) in[i]=inf;
        for(int i=1;i<=m;i++)
        {
            if(len[i].u==len[i].v) continue;
            if(in[len[i].v]>len[i].w)
            {
                pre[len[i].v]=len[i].u;
                in[len[i].v]=len[i].w;
            }
        }
        in[root]=0;
        for(int i=1;i<=n;i++) if(in[i]==inf) return -1;
        int tn=0;
        int id[maxn];
        int vis[maxn];
        memset(id,-1,sizeof id);memset(vis,-1,sizeof vis);
        for(int i=1;i<=n;i++)
        {
            res+=in[i];
            int v=i;
            while(vis[v]!=i&&id[v]==-1&&v!=root)
            {
                vis[v]=i;
                v=pre[v];
            }
            if(v!=root&&id[v]==-1)
            {
                tn++;
                for(int u=pre[v];u!=v;u=pre[u])
                {
                    id[u]=tn;
                }
                id[v]=tn;
            }
        }
        if(tn==0) break;
        for(int i=1;i<=n;i++)
        {
            if(id[i]==-1) id[i]=++tn;
        }
        for(int i=1;i<=m;)
        {
            int v=len[i].v;
            len[i].v=id[len[i].v];
            len[i].u=id[len[i].u];
            if(len[i].u!=len[i].v)
            {
                len[i++].w-=in[v];
            }
            else
                swap(len[i],len[m--]);
        }
        n=tn;
        root=id[root];
    }
    return res;
}
int main()
{
    int T;scanf("%d",&T);
    int p=0;
    while(T--)
    {
        p++;
        scanf("%d %d",&n,&m);
        for(int i=1;i<=m;i++)
        {
            int u,v,w;scanf("%d %d %d",&u,&v,&w);
            len[i].u=u+1,len[i].v=v+1,len[i].w=w;
        }
        int ans=zhuliu(1);
        if(ans==-1) printf("Case #%d: Possums!\n",p);
        else printf("Case #%d: %d\n",p,ans);
    }
}