POJ3259 Wormholes

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 59439		Accepted: 22218

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

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.

Source

USACO 2006 December Gold

bellman-ford判负环。

题意：农场里有一些虫洞，可以让你逆转时光，把它看做负权边。

否则的话就是双向的一条路。

然后bellman-ford跑一遍就好了、

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <string>
#include <iostream>
#include <stack>
#include <math.h>
#include <queue>
#include <vector>
#include <climits>
using namespace std;
const int  Max_M= 6e3 + 10;
const int inf = 0x01010101;
int dis[Max_M];
struct edge
{
    int from,to,cost;
    edge(int a,int b, int c)
    {
        from = a;
        to = b;
        cost = c;
    }
    edge() {}
};
edge es[Max_M];
int N,M,W;
int e_cnt;
bool find_negative_loop(int start)
{
    memset(dis,0,sizeof(dis));
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < e_cnt; j++)
        {
            edge eg = es[j];
            if(dis[eg.to] > dis[eg.from] + eg.cost)
            {
                dis[eg.to] = dis[eg.from] + eg.cost;
                if(i == N - 1)
                    return true;
            }
        }
    }
    return false;
}
int main()
{
    // freopen("out.txt","w",stdout);
    // ios::sync_with_stdio(false);
//    cin.tie(0);
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d%d",&N,&M,&W);
        int s,e,t;
        e_cnt = 0;
        while(M--)
        {
            scanf("%d%d%d",&s,&e,&t);
            es[e_cnt] = edge(s,e,t);
            e_cnt++;
            es[e_cnt] = edge(e,s,t);
            e_cnt++;
        }
        while(W--)
        {
            scanf("%d%d%d",&s,&e,&t);
            es[e_cnt++] = edge(s,e,-t);
        }
        int flag = 0;

        if(find_negative_loop(1))
            puts("YES");
        else puts("NO");
    }

    return 0;
}