zoukankan      html  css  js  c++  java
  • UVa11183

    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<150). N test cases follow. Each one starts with two lines containing n (0<=n<=1000) andm (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, uv 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
     
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <vector>
    #include <string>
    #include <algorithm>
    #include <queue>
    using namespace std;
    const int maxn = 1000+10;
    const int inf = 1<<25;
    struct edge{
        int u,v,w;
        edge(int u,int v,int w):u(u),v(v),w(w){}
    };
    vector<edge>e;
    int n,m;
    int pre[maxn],inv[maxn],to[maxn],ID[maxn];
    
    int ZhuLiu(int rt){
        int ret = 0;
        while(true){
            for(int i = 0; i < n; i++){
                inv[i] = inf;
                ID[i] = -1;
                to[i] = -1;
            }
            for(int i = 0; i < m; i++){
                int u = e[i].u,v = e[i].v,w = e[i].w;
                if(inv[v] > w && u != v){
                    inv[v] = w;
                    pre[v] = u;
                }
            }
            inv[rt] = 0;
            for(int i = 0; i < n; i++){
                if(inv[i] == inf) return -1;
            }
            int cnt = 0;
            for(int i = 0; i < n; i++){
                ret += inv[i];
                int v = i;
                while(to[v] != i && ID[v]==-1 && v != rt){
                    to[v] = i;
                    v = pre[v];
                }
                if(ID[v]==-1 && v != rt){
                    for(int u = pre[v]; u != v; u = pre[u]) ID[u] = cnt;
                    ID[v] = 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 u = e[i].u,v = e[i].v, w = e[i].w;
                e[i].w -= inv[v];
                e[i].u = ID[u];
                e[i].v = ID[v];
            }
            rt = ID[rt];
            n = cnt;
    
        }
        return ret;
    
    }
    int main(){
        int ncase,T=1;
        cin >> ncase;
        while(ncase--){
            e.clear();
            scanf("%d%d",&n,&m);
            for(int i = 0; i < m; i++){
                int u,v,w;
                scanf("%d%d%d",&u,&v,&w);
                e.push_back(edge(u,v,w));
            }
            int ans = ZhuLiu(0);
            if(ans==-1){
                printf("Case #%d: Possums!
    ",T++);
            }else{
                printf("Case #%d: %d
    ",T++,ans);
            }
    
        }
        return 0;
    }
    




  • 相关阅读:
    【转】Intel Atom手机处理器“上窜下跳”
    神奇HVXC的MOS 分
    Skype 将支持 WebRTC 标准
    一篇文章算市值
    算法经典趣题三色旗
    Java基础(2)Java三大版本/体系
    一天一个 Linux 命令(27):mkfs 命令
    Java基础(1)Java特性及优势
    一天一个 Linux 命令(26):fdisk 命令
    关于Java中的整数类型值比较的疑问
  • 原文地址:https://www.cnblogs.com/mfmdaoyou/p/7094130.html
Copyright © 2011-2022 走看看