poj 1135 Domino Effect (dijkratra算法)

时间：2014-08-18 14:33:32 阅读：241 评论：0 收藏：0 [点我收藏+]

标签：des style http color os io strong for

Domino Effect

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8848		Accepted: 2210

Description

Did you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes and build a row by standing them on end with only a small distance in between. If you do it right, you can tip the first domino and cause all others to fall down in succession (this is where the phrase ``domino effect‘‘ comes from).

While this is somewhat pointless with only a few dominoes, some people went to the opposite extreme in the early Eighties. Using millions of dominoes of different colors and materials to fill whole halls with elaborate patterns of falling dominoes, they created (short-lived) pieces of art. In these constructions, usually not only one but several rows of dominoes were falling at the same time. As you can imagine, timing is an essential factor here.

It is now your task to write a program that, given such a system of rows formed by dominoes, computes when and where the last domino falls. The system consists of several ``key dominoes‘‘ connected by rows of simple dominoes. When a key domino falls, all rows connected to the domino will also start falling (except for the ones that have already fallen). When the falling rows reach other key dominoes that have not fallen yet, these other key dominoes will fall as well and set off the rows connected to them. Domino rows may start collapsing at either end. It is even possible that a row is collapsing on both ends, in which case the last domino falling in that row is somewhere between its key dominoes. You can assume that rows fall at a uniform rate.

Input

The input file contains descriptions of several domino systems. The first line of each description contains two integers: the number n of key dominoes (1 <= n < 500) and the number m of rows between them. The key dominoes are numbered from 1 to n. There is at most one row between any pair of key dominoes and the domino graph is connected, i.e. there is at least one way to get from a domino to any other domino by following a series of domino rows.

The following m lines each contain three integers a, b, and l, stating that there is a row between key dominoes a and b that takes l seconds to fall down from end to end.

Each system is started by tipping over key domino number 1.

The file ends with an empty system (with n = m = 0), which should not be processed.

Output

For each case output a line stating the number of the case (‘System #1‘, ‘System #2‘, etc.). Then output a line containing the time when the last domino falls, exact to one digit to the right of the decimal point, and the location of the last domino falling, which is either at a key domino or between two key dominoes(in this case, output the two numbers in ascending order). Adhere to the format shown in the output sample. The test data will ensure there is only one solution. Output a blank line after each system.

Sample Input

Sample Output

System #1
The last domino falls after 27.0 seconds, at key domino 2.

System #2
The last domino falls after 7.5 seconds, between key dominoes 2 and 3.

Source

Southwestern European Regional Contest 1996

题意：有很多骨牌，有一些关键牌，它们一旦倒下，和它们相连的各个普通行都倒下，求最后一个倒下的牌所用时间和位置。

注意：有的行特别长，所以有可能行中间的最后倒下。

#include"stdio.h"
#include"string.h"
#include"queue"
#include"algorithm"
using namespace std;
#define N 505
#define inf 0x7fffffff
int mark[N],g[N][N];
int dis[N];
void dijkstra(int s,int n)
{
    int i,u,min;
    for(i=1;i<=n;i++)
    {
        dis[i]=g[s][i];
        mark[i]=0;
    }
    mark[s]=1;
    while(1)
    {
        u=0;
        min=inf;
        for(i=1;i<=n;i++)
        {
            if(!mark[i]&&min>dis[i])
            {
                min=dis[i];
                u=i;
            }
        }
        if(u==0)
            break;
        mark[u]=1;
         for(i=1;i<=n;i++)
         {
             if(!mark[i]&&g[u][i]<inf&&dis[i]>dis[u]+g[u][i])
                dis[i]=dis[u]+g[u][i];
         }
    }
}
void work(int n)
{
    int i,j,k0,k1,k2;
    double t1,t2;
    t1=t2=-inf;          //有坑，时间可以为零
    for(i=1;i<=n;i++)
    {
        if(t1<dis[i])
        {
            t1=dis[i];k0=i;
        }
    }
    for(i=1;i<=n;i++)    //某一普通行可能很长很长
    {
        for(j=1;j<=n;j++)
        {
            if(g[i][j]<inf&&t2<(dis[i]+dis[j]+g[i][j])/2.0)
            {
                if(i<j) {k1=i;k2=j;}
                else {k1=j;k2=i;}
                t2=(dis[i]+dis[j]+g[i][j])/2.0;
            }
        }
    }
    if(t1<t2)
        printf("The last domino falls after %.1f seconds, between key dominoes %d and %d.\n",t2,k1,k2);
    else
        printf("The last domino falls after %.1f seconds, at key domino %d.\n",t1,k0);
}
int main()
{
    int i,j,n,m,u,v,w,cnt=1;
    while(scanf("%d%d",&n,&m),n||m)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                g[i][j]=(i==j?0:inf);
            }
        }
        for(i=0;i<m;i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            g[u][v]=g[v][u]=w;
        }
        printf("System #%d\n",cnt++);
        dijkstra(1,n);
        work(n);            
        puts("");
    }
    return 0;
}

poj 1135 Domino Effect (dijkratra算法),布布扣,bubuko.com

poj 1135 Domino Effect (dijkratra算法)

标签：des style http color os io strong for

原文地址：http://blog.csdn.net/u011721440/article/details/38659309

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行