F - Wormholes POJ - 3259 （经典Bellman-Ford算法）

F - Wormholes POJ - 3259

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

Hint

For farm 1, FJ cannot travel back in time.
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.

题意：农夫john发现了一些虫洞，虫洞可以把你送到过去的某个点，可以理解为负权路，FJ的每个农场，由n块土地(编号为1-n),M条路，和W个 虫洞组成，FJ想从一块土地开始，经过若干路和虫洞，能否看到过去的自己。

思路：意思就是能不能找到一条负权回路，让时间可以倒流。典型的Bellman-Ford算法。

代码：

#include <iostream>
#include <cstring>
#define inf 0x3f3f3f

using namespace std;

int a[505][505];
int dis[505];
int n,m,mm;

int bellman( int v0 )
{
    dis[v0] = 0;
    int isp,i,j,k;
    for ( i=0; i<n; i++ ) { // 进行n次松弛
        isp = 0;
        for ( j=1; j<=n; j++ ) {
            for ( k=1; k<=n; k++ ) {
                if ( dis[k]>dis[j]+a[j][k] ) {
                    dis[k] = dis[j]+a[j][k];// 松弛
                    isp = 1;
                }
            }
        }
        if ( isp==0 ) { // 如果不能松弛，不存在负回路
            return 0;
        }
    }

    isp = 0;
    for ( j=1; j<=n; j++ ) {
        for ( k=1; k<=n; k++ ) {
            if ( dis[k]>dis[j]+a[j][k] ) {
                dis[k] = dis[j] + a[j][k];
                isp = 1; // 如果能进行n+1次松弛，那么存在负权回路
            }
        }
    }
    return isp;
}

int main()
{
    int listt;
    int i,j;
    cin >> listt;
    while ( listt-- ) {
        cin >> n >> m >> mm;
        memset(a,inf,sizeof(a));
        memset(dis,inf,sizeof(dis));
        for ( i=1; i<=n; i++ ) {
            a[i][i] = 0;
        }

        for ( i=0; i<m; i++ ) {
            int x,y,z;
            cin >> x >> y >> z;
            if ( a[x][y]>z ) {
                a[x][y] = a[y][x] = z; // 存路
            }
        }
        for ( i=0; i<mm; i++ ) {
            int x,y,z;
            cin >> x >> y >> z;
            if ( a[x][y]>-z ) { // 存虫洞
                a[x][y] = -z;
            }
        }

        int ans = bellman(1);
        if ( ans==1 ) {
            cout << "YES" << endl;
        }
        else {
            cout << "NO" << endl;
        }
    }


    return 0;
}