【POJ3259】【Wormholes】【负环判断】【bell-ford】

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 36771		Accepted: 13465

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

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
    
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define mp push_back

int T;
int N,M,W;
struct Edge
{
	int s,e,c;
	Edge(int _s,int _e,int _c)
	{
		s = _s;
		e = _e;
		c = _c;
	}
	Edge()
	{
	}
}e[5200];
int len;
int d[1010];

bool bell()
{
	memset(d,0x3f3f3f3f,sizeof(d));
	for(int i=0;i<N-1;i++)
	{
		bool flag = false;
		rep(j,0,len) 
		{
			if(d[e[j].e] > d[e[j].s] + e[j].c)
			{
				d[e[j].e] = d[e[j].s] + e[j].c;
				flag = true;
			}
		}
		if(!flag) break;
	}
		rep(j,0,len) 
		{
			if(d[e[j].e] > d[e[j].s] + e[j].c)
			{
				return true;
			}
		}

	return false;

}
int main()
{
    scanf("%d",&T);
	while(T--) 
	{
		scanf("%d%d%d",&N,&M,&W);
		len = 0;
		rep(i,0,M)
		{
			int u,v,w;
			scanf("%d%d%d",&u,&v,&w);
			e[len++] = Edge(u,v,w);
			e[len++] = Edge(v,u,w);

		}
		rep(i,0,W)
		{
			int u,v,w;
			scanf("%d%d%d",&u,&v,&w);
			e[len++] = Edge(u,v,-w);
		}

		if(bell()) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
    return 0;
}