zoukankan      html  css  js  c++  java
  • uva 11183 最小树形图

    Problem I
    Teen Girl Squad
    Input: Standard Input

    Output: Standard Output

     

    -- 3 spring rolls please.
    -- MSG'D!!
    -- Oh! My stomach lining!

    Strong Bad

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

    Each of you is using a different phone service provider, and you know the price of girl A calling girl B for all possible A and B. Not all of your friends like each other, and some of them will never call people they don't like. Your job is to find the cheapest possible sequence of calls so that the news spreads 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 starts with two lines containing n (0<=n<=1000) and m (0 <= m <= 40,000). Girls are numbered from 0 to n-1, and you are girl 0. The next m lines will each contain 3 integers, u, v and w, meaning that a call from 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 method of distributing the news. If there is no solution, print "Possums!" instead.

    Sample Input                                  Output for Sample Input

    4
    2
    1
    0 1 10
    2
    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
    Case #1: 10
    Case #2: Possums!
    Case #3: 40
    Case #4: 130
     

    Problem setter: Igor Naverniouk

    模板即可。

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<vector>
    #include<cstdlib>
    #include<algorithm>
    #include<queue>
    #include<map>
    
    using namespace std;
    
    #define LL long long
    #define ULL unsigned long long
    #define UINT unsigned int
    #define MAX_INT 0x7fffffff
    #define cint const int
    #define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
    #define MIN(X,Y) ((X) < (Y) ? (X) : (Y))
    #define INF 100000000
    #define MAXN 1111
    #define MAXM 44444
    
    struct edge{
        int u, v, d, nxt;
    }e[MAXM];
    int h[MAXN], cc, n, m;
    
    void add(int u, int v, int w){
        e[cc]=(edge){u, v, w, h[u]};
        h[u]=cc++;
    }
    
    int id[MAXN], inv[MAXN], vis[MAXN];
    int pre[MAXN];
    int dmst(int s, int n){
        int u, v, i, d;
        int ret = 0;
        while(true){
            for(i=0; i<n; i++)
                inv[i]=INF;
            for(i=0; i<m; i++){
                u = e[i].u;
                v = e[i].v;
                d = e[i].d;
                if(d<inv[v] && u!=v) inv[v]=d, pre[v]=u;
            }
            for(i=0; i<n; i++) if(inv[i]==INF && i!=s)
                return -1;
            inv[s]=0;
            int cnt=0;
            fill_n(id, n, -1);
            fill_n(vis, n, -1);
            for(i=0; i<n; i++){
                ret += inv[i];
                v = i;
                while(vis[v]!=i && id[v]==-1 && v!=s)
                    vis[v]=i, v=pre[v];
                if(v!=s && id[v]==-1){
                    for(; id[v]==-1; v=pre[v])
                        id[v]=cnt;
                    cnt++;
                }
            }
            if(!cnt) break;
            for(i=0; i<n; i++) if(id[i]==-1)
                id[i]=cnt++;
            for(i=0; i<cc; i++){
                u=e[i].u;   v=e[i].v;   d=e[i].d;
                e[i]=(edge){id[u], id[v], (u==v ? d : d-inv[v])};
            }
            n=cnt;
            s=id[s];
        }
        return ret;
    }
    
    int main(){
    //    freopen("C:\Users\Administrator\Desktop\in.txt","r",stdin);
        int T, kase=1;
        scanf(" %d", &T);
        while(T--){
            scanf(" %d %d", &n, &m);
            int i, u, v, w;
            fill_n(h+1, n, -1);     cc=0;
            for(i=0; i<m; i++){
                scanf(" %d %d %d", &u, &v, &w);
                if(u!=v) add(u, v, w);
            }
            int ans = dmst(0, n);
            if(ans<0) printf("Case #%d: Possums!
    ", kase++);
            else printf("Case #%d: %d
    ", kase++, ans);
        }
        return 0;
    }
    

     

  • 相关阅读:
    【08月20日】A股滚动市净率PB历史新低排名
    沪深300指数的跟踪基金最近1年收益排名
    基金前15大重仓股持仓股排名
    中证500指数的跟踪基金最近1年收益排名
    【08月14日】A股ROE最高排名
    【08月13日】预分红股息率最高排名
    【08月09日】北上资金持股比例排名
    最近一月研报推荐次数最多的最热股票
    JDK源码阅读-------自学笔记(二十一)(java.util.ArrayList详细版集合类)
    MyBatis-Plus 3.0.3 Sql注入器添加,即全局配置Sql注入器,sqlInjector改写
  • 原文地址:https://www.cnblogs.com/ramanujan/p/3369420.html
Copyright © 2011-2022 走看看