zoj 1298 Domino Effect (poj 1135)

Domino Effect

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6086		Accepted: 1546

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

2 1
1 2 27
3 3
1 2 5
1 3 5
2 3 5
0 0

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

//先求出出发点到每个点的距离 记录最远距离 Max1
求出每个条边的结束时间 Max2
比较Max1和Max2大小再进行输出

#include <iostream>
#include <stdio.h>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define N 555
struct node
{
    int va;
    int to;
    int next;
}st[N*N];
struct Qu
{
    int dis;
    int nd;
    Qu(){}
    Qu(int a,int b){dis=a,nd=b;}
    bool operator <(Qu const &b) const
    {
        return dis>b.dis;
    }
};
int v[N];
int dis[N];
int n,m,nu;
bool b[N];
void dijskla()
{
    memset(b,0,sizeof(b));
    b[1]=1;
    Qu a;
    int cnt=0;
    priority_queue<Qu> Q;
    int i;
    for(i=v[1];i!=-1;i=st[i].next)
    {
        Q.push(Qu(st[i].va,st[i].to));
    }
    while(!Q.empty())
    {
        a=Q.top();Q.pop();
        if(b[a.nd]) continue;
        b[a.nd]=1;cnt++;
        dis[a.nd]=a.dis;
        for(i=v[a.nd];i!=-1;i=st[i].next)
        {
            if(!b[st[i].to])
             Q.push(Qu(a.dis+st[i].va,st[i].to));
        }
    }
}
int main()
{
    int i,j,k;
    double Max;
    int a,b,c,t=1;
    while(scanf("%d %d",&n,&m),n||m)
    {
        memset(v,-1,sizeof(v));
            nu=0;
         for(i=0;i<m;i++)
          {
              scanf("%d %d %d",&a,&b,&c);
              st[nu].va=c;
              st[nu].to=b;
              st[nu].next=v[a];
              v[a]=nu++;
              st[nu].va=c;
              st[nu].to=a;
              st[nu].next=v[b];
              v[b]=nu++;
          }

       dijskla();
       k=1;Max=0;
       for(i=2;i<=n;i++)
         if(dis[i]>Max)
         Max=dis[i],k=i;
        int pos1=0,pos2=0;
    for(j=1;j<=n;j++)
      for(i=v[j];i!=-1;i=st[i].next)
         if((dis[j]+dis[st[i].to]+st[i].va)/2.0>Max)
         {
             pos1=j;
             pos2=st[i].to;
            Max=(dis[j]+dis[st[i].to]+st[i].va)/2.0;
         }
     printf("System #%d\n",t++);
     if(pos1)
      printf("The last domino falls after %.1lf seconds, between key dominoes %d and %d.\n\n",Max,pos1,pos2);
     else
      printf("The last domino falls after %.1lf seconds, at key domino %d.\n\n",Max,k);

    }
    return 0;
}