poj3259 Wormholes

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 48182		Accepted: 17786

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).

题意：f组数据，n个点，m条无向边，w条有向负权边，判断是否有负权回路。

分析：Bellman-Ford算法，做n次松弛操作，做完后如果还存在任何一条边使得两个点之间的最短路径更短说明有负权环。

代码

const
  maxn=5000;
var
  x,y,z,d:array[0..maxn] of longint;
  n,m,w,i,j,t,p:longint;


function bellman:boolean;
var
  i,j:longint;
  f:boolean;
begin
  fillchar(d,sizeof(d),$7f);
  d[1]:=0;
  for i:=1 to n do
    begin
      f:=false;
      for j:=1 to p do
        if d[x[j]]+z[j]<d[y[j]] then
          begin
            d[y[j]]:=d[x[j]]+z[j];
            f:=true;
          end;
      if not f then break;
    end;
  for i:=1 to p do
    if d[x[i]]+z[i]<d[y[i]] then exit(true);
  exit(false);
end;


begin
  readln(t);
  while t>0 do
    begin
      p:=0;
      dec(t);
      readln(n,m,w);
      for i:=1 to m do
        begin
          inc(p);
          readln(x[p],y[p],z[p]);
          inc(p);
          y[p]:=x[p-1];
          x[p]:=y[p-1];
          z[p]:=z[p-1];
        end;
      for i:=1 to w do
        begin
          inc(p);
          readln(x[p],y[p],z[p]);
          z[p]:=0-z[p];
        end;
      if bellman then writeln('YES') else writeln('NO');
    end;
end.