【POJ 3259】Wormholes

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
算法讨论
主要就是找出是否存在负权回路，若有则输出YES，没有则输出NO，bellman_ford算法可以找出负权回路的存在。

const
  maxn=5205;
var
  edge:array[0..maxn,1..3] of longint;
  d:array[1..maxn] of longint;
  i,j,k,e,nl,n,m,w,s,e1,t: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 e do
        if d[edge[j,1]]+edge[j,3]<d[edge[j,2]]
          then begin
                 d[edge[j,2]]:=d[edge[j,1]]+edge[j,3];
                 f:=true
               end;
      if f=fals //优化，若一次松弛都没做过，后面的点也没必要再做
        then break
    end;
  for i:=1 to e do
    if d[edge[i,1]]+edge[i,3]<d[edge[i,2]]
      then exit(true);
  exit(false)
end;

begin
  read(nl);
  for i:=1 to nl do
    begin
      e:=0;
      read(n,m,w);
      for j:=1 to m do
        begin
          read(s,e1,t);
          inc(e);
          edge[e,1]:=s; edge[e,2]:=e1; edge[e,3]:=t;
          inc(e);
          edge[e,1]:=e1; edge[e,2]:=s; edge[e,3]:=t
        end;
      for j:=1 to w do
        begin
          read(s,e1,t);
          inc(e);
          edge[e,1]:=s; edge[e,2]:=e1; edge[e,3]:=t-(2*t);
        end;
      if bellman
        then writeln('YES')
        else writeln('NO')
    end;
end.

Pixiv ID：61771640