zoukankan      html  css  js  c++  java
  • POJ1125 Stockbroker Grapevine

    POJ1125 Stockbroker Grapevine

    Time Limit: 1000MS Memory Limit: 10000K

    Total Submissions: 17847 Accepted: 9624

    Description

    Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock market. For maximum effect, you have to spread the rumours in the fastest possible way. 

    Unfortunately for you, stockbrokers only trust information coming from their "Trusted sources" This means you have to take into account the structure of their contacts when starting a rumour. It takes a certain amount of time for a specific stockbroker to pass the rumour on to each of his colleagues. Your task will be to write a program that tells you which stockbroker to choose as your starting point for the rumour, as well as the time it will take for the rumour to spread throughout the stockbroker community. This duration is measured as the time needed for the last person to receive the information.

    Input

    Your program will input data for different sets of stockbrokers. Each set starts with a line with the number of stockbrokers. Following this is a line for each stockbroker which contains the number of people who they have contact with, who these people are, and the time taken for them to pass the message to each person. The format of each stockbroker line is as follows: The line starts with the number of contacts (n), followed by n pairs of integers, one pair for each contact. Each pair lists first a number referring to the contact (e.g. a '1' means person number one in the set), followed by the time in minutes taken to pass a message to that person. There are no special punctuation symbols or spacing rules.

    Each person is numbered 1 through to the number of stockbrokers. The time taken to pass the message on will be between 1 and 10 minutes (inclusive), and the number of contacts will range between 0 and one less than the number of stockbrokers. The number of stockbrokers will range from 1 to 100. The input is terminated by a set of stockbrokers containing 0 (zero) people. 

    Output

    For each set of data, your program must output a single line containing the person who results in the fastest message transmission, and how long before the last person will receive any given message after you give it to this person, measured in integer minutes. 

    It is possible that your program will receive a network of connections that excludes some persons, i.e. some people may be unreachable. If your program detects such a broken network, simply output the message "disjoint". Note that the time taken to pass the message from person A to person B is not necessarily the same as the time taken to pass it from B to A, if such transmission is possible at all.

    Sample Input

    3

    2 2 4 3 5

    2 1 2 3 6

    2 1 2 2 2

    5

    3 4 4 2 8 5 3

    1 5 8

    4 1 6 4 10 2 7 5 2

    0

    2 2 5 1 5

    0

    Sample Output

    3 2

    3 10

    *************************************************************************************

    题目大意:给出一个社交网络,每个人有几个别人可以传播谣言,传播谣言需要时间。问要使得谣言传播的最快,应该从那个人开始传播谣言以及使得所有人都知道这个谣言需要多少时间,时间的定义是使得最后一个人知道这个谣言的时间。

    多元最短路,写过这么多最短路,第一次写多元最短路,1A,挺好的。

    #include <stdio.h>
    #include <string.h>
    #define INF 0x3f3f3f3f
    #define max(a,b) ((a)>(b)?(a):(b))
    
    int gra[105][105];
    
    int main()
    {
        int n;
        while(scanf("%d",&n),n)
        {
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                    gra[i][j]=INF;
            for(int j=1;j<=n;j++)
            {
                int k;
                scanf("%d",&k);
                for(int i=1;i<=k;i++)
                {
                    int a,b;
                    scanf("%d%d",&a,&b);
                    gra[j][a]=b;
                }
            }
            for(int k=1;k<=n;k++)
                for(int i=1;i<=n;i++)
                    for(int j=1;j<=n;j++)
                        if(gra[i][k]<INF&&gra[k][j]<INF&&(gra[i][k]+gra[k][j])<gra[i][j])
                            gra[i][j]=gra[i][k]+gra[k][j];
            int minn=INF,pos=0;
            for(int i=1;i<=n;i++)
            {
                int now=-1;
                for(int j=1;j<=n;j++)
                {
                    if(i==j)continue;
                    now=max(now,gra[i][j]);
                }
                if(now<minn)
                {
                    minn=now;
                    pos=i;
                }
            }
            printf("%d %d\n",pos,minn);
        }
    }
    

      

  • 相关阅读:
    verifycode验证码模版
    输出一个整数的每一位,如:123的每一位是1 , 2 , 3
    编写代码模拟三次密码输入的场景。 最多能输入三次密码,密码正确,提示“登录成功”,密码错误, 可以重新输 入,最多输入三次。三次均错,则提示退出程序
    获取一个数二进制序列中所有的偶数位和奇数位, 分别输出二进制序列
    一台客户端有三百个客户与三百个客户端有三百个客户对服务器施压,有什么区别?
    软件生存周期及其模型是什么?
    试述软件的概念和特点?软件复用的含义?构件包括哪些?
    Spring Cloud Stream与Spring Cloud Bus区别
    Spring的设计模式
    JavaScript的事件循环机制总结 eventLoop
  • 原文地址:https://www.cnblogs.com/Fatedayt/p/2173066.html
Copyright © 2011-2022 走看看