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 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
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 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.
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
#define T 5050
#define inf 0x3f3f3f3f
#define CRL(a) memset(a,inf,sizeof(a))
typedef long long ll;
int dist[T];
struct node
{
int l,r;
int t;
}a[T<<4];
int main()
{
/*freopen("input.txt","r",stdin);*/
int n,m,i,j,k,t;
scanf("%d",&n);
while(n--)
{
scanf("%d%d%d",&m,&k,&t);
CRL(dist);
int s=2*k+t;
for(i=0;i<s;++i){
scanf("%d%d%d",&a[i].l,&a[i].r,&a[i].t);
if(i>=2*k){
a[i].t=-a[i].t;
}
else
{
a[i+1].l=a[i].r;
a[i+1].r=a[i].l;
a[i+1].t=a[i].t;
i++;
}
}
dist[1]=0;
for(i=0;i<m-1;++i){
for(j=0;j<s;++j){
if(dist[a[j].l]!=inf&&dist[a[j].r]>dist[a[j].l]+a[j].t){
dist[a[j].r]=dist[a[j].l]+a[j].t;
}
}
}
int flag=0;
for(j=0;j<s;++j){
if(dist[a[j].l]!=inf&&dist[a[j].r]>dist[a[j].l]+a[j].t){
flag=1;break;
}
}
if(flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}