Domino Effect
|
Time Limit: 1000MS |
|
Memory Limit: 65536K |
|
Total Submissions: 6322 |
|
Accepted: 1609 |
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
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
思路：求出1到每个点的最短路，然后在看看骨牌是否会倒在两个点的中间。
#include
#include
#include
#include
using namespace std;
const int mm=510;
const int oo=1e9;
float grap[mm][mm],dis[mm];
bool vis[mm];
int m,n;
void dij()
{ memset(vis,0,sizeof(vis));
for(int i=0;idis[u]+grap[u][j])
dis[j]=dis[u]+grap[u][j];
}
}
int main()
{ int cas=0;
while(cin>>m>>n)
{ memset(grap,0,sizeof(grap));
if(m==0&&n==0)break;
int a,b,c;
for(int i=0;i>a>>b>>c;
grap[a][b]=grap[b][a]=c;
}
dij();
float ans1=-oo,ans2=-oo;
for(int i=1;ians2)
{
a=i;b=j;ans2=z;
}
}++cas;
coutans1)
printf("The last domino falls after %.1f seconds, between key dominoes %d and %d.nn",ans2,a,b);
else
printf("The last domino falls after %.1f seconds, at key domino %d.nn",ans1,c);
}
}服务器托管，北京服务器托管，服务器租用 http://www.fwqtg.net
机房租用，北京机房租用，IDC机房托管， http://www.fwqtg.net
Oracle平台应用数据库系统的设计与开发 第1页：Oracle平台应用数据库系统的设计与开发第2页：Oracle平台应用数据库系统的设计与开发 Oracle是目前应用最广泛的数据库系统。一个完整的数据库系统包括系统硬件、操作系统、网络层、DBMS（数据库管理…
