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.
题目不难,就是利用bellman-ford算法判断是否存在负权环的问题。
但是不知道为什么我一直WA。。。。。。
实在不知道代码哪里出了问题,自己写了几个测试用例也没发现问题。。。。。
#include <iostream>
#define INF 999999999
using namespace std;
class Edge
{
public:
int s,e;
int weight;
};
int main()
{
int n;
int N,M,W;
int k;
cin>>n;
cin>>N>>M>>W;
int *dis = new int [N+1]; //距离数组
Edge *edge = new Edge [2*M+N]; //M条无向边,W条有向表
bool flag = true;
while(n--)
{
for(int i=1;i<=N;i++)
dis[i] = INF;
dis[1] = 0; //初始化距离数组
flag = true;
k=0;
for(int i=0;i<M;i++)//将无向边转为两条有向边
{
int s,e,weight;
cin>>s>>e>>weight;
edge[k].s = s,edge[k].e = e,edge[k++].weight=weight; //储存两条边
edge[k].s = e,edge[k].e = s,edge[k++].weight=weight;
}
for(int i=0;i<W;i++)//储存有向边
{
int s,e,weight;
cin>>s>>e>>weight;
edge[k].s = s,edge[k].e = e,edge[k++].weight = -weight;
}
for(int i=0;i<N-1;i++)
{
flag = true;
for(int j=0;j<2*M+W;j++)
{
if(dis[edge[j].e] > dis[edge[j].s] + edge[j].weight)
{
dis[edge[j].e] = dis[edge[j].s] + edge[j].weight;
flag = false;
}
}
if(flag)
break;
}
flag = false;
for(int j=0;j<2*M+W;j++)
{
if(dis[edge[j].e] > dis[edge[j].s] + edge[j].weight)
{
dis[edge[j].e] = dis[edge[j].s] + edge[j].weight;
flag = true;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}