SPFA算法用于判断是否有负环。
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 70708 | Accepted: 26258 |
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
题意解读:
有n个农场,m条双向路,w条单向路(有负值)。让判断是否有负环?
#include<iostream>
#include<queue>
#include<algorithm>
#include<string.h>
using namespace std;
#define range 510
int map[range][range];
int vis[range];
int dis[range];
queue<int> q;
int spfa(int s,int N)
{
while(!q.empty())
q.pop();
dis[s]=0;
int i,j,cnt=0;
q.push(s);
vis[s]=1;
q.push(cnt);
while(!q.empty())
{
int a=q.front();
q.pop();
cnt=q.front();
q.pop();
vis[a]=0;
if(cnt>N)
return 0;
for(j=0;j<N;j++)
{
if(dis[j]>dis[a]+map[a][j])
{
dis[j]=dis[a]+map[a][j];
if(!vis[j])
{
vis[j]=1;
q.push(j);
q.push(cnt+1);
}
}
}
}
return 1;
}
int main()
{
int n,m,d1,d2,i,j,z1,z2,z3;
cin>>n;
while(n--)
{
memset(map,0x3f,sizeof(map));
memset(vis,0,sizeof(vis));
memset(dis,0x3f,sizeof(dis));
cin>>m>>d1>>d2;
for(i=0;i<d1;i++)
{
cin>>z1>>z2>>z3;
if(z3<map[z1-1][z2-1])
map[z1-1][z2-1]=map[z2-1][z1-1]=z3;
}
for(i=0;i<d2;i++)
{
cin>>z1>>z2>>z3;
map[z1-1][z2-1]=-z3;
}
if(spfa(0,m))
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}