POJ3259 虫洞穿越（最短路）

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 55649		Accepted: 20784

Description

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1..N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.

As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself :) .

To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.

Input

Line 1: A single integer,  F.  F farm descriptions follow. 
Line 1 of each farm: Three space-separated integers respectively:  N,  M, and  W 
Lines 2.. M+1 of each farm: Three space-separated numbers ( S,  E,  T) that describe, respectively: a bidirectional path between  S and  E that requires  T seconds to traverse. Two fields might be connected by more than one path. 
Lines  M+2.. M+ W+1 of each farm: Three space-separated numbers ( S,  E,  T) that describe, respectively: A one way path from  S to  E that also moves the traveler back  T seconds.

Output

Lines 1.. F: For each farm, output "YES" if FJ can achieve his goal, otherwise output "NO" (do not include the quotes).

Sample Input

2
3 3 1
1 2 2
1 3 4
2 3 1
3 1 3
3 2 1
1 2 3
2 3 4
3 1 8

Sample Output

NO
YES

题目大意是任选一个出发点，要求是否存在副权回路，由于上题写过了Bellman Ford，这次试一试Floyd算法。

首先看一看Floyd的写法，

bool floyd()
{
    for(int k=1;k<=n;k++)
     for(int i=1;i<=n;i++)
     {
      for(int j=1;j<=n;j++)
       {
      if(map[i][j]>map[i][k]+map[k][j])
        map[i][j] = map[i][k]+map[k][j];
     }
   if(map[i][i]<0) return 1;
     }
return 0;  
}

但时间复杂度目测O（n³），有点大，在输入输出的时候需要优化，以及不能用stl库中的min函数。

需要注意的是Floyd的初始化，

memset(map,0x3f3f3f3f,sizeof(map));
for(int i=1;i<=n;i++)
   map[i][i] = 0;

除了起点外全部初始化为0x3f3f3f3f（无穷大），此数值的巧妙之处可以自行百度。