POJ3259（SPFA算法）

最新推荐文章于 2022-04-12 08:19:31 发布

浮生之居士

最新推荐文章于 2022-04-12 08:19:31 发布

阅读量292

点赞数 1

分类专栏： ACM训练文章标签：算法

本文链接：https://blog.csdn.net/wcs_152/article/details/54949821

版权

ACM训练专栏收录该内容

59 篇文章 2 订阅

订阅专栏

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.

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;

const int MAX =1 << 20;
int F,N,M,W,s,e,t,flag,start=1;
int road[1005][1005],dis[1005],cnt[1005];
bool visited[1005];
bool spfa() {
    memset(cnt,0,sizeof(cnt));
    for(int i=1; i<=N; i++) {
        dis[i]=MAX;
        visited[i]=false;
    }
    queue<int>Q;
    dis[start]=0;
    cnt[start]=1;
    visited[start]=true;
    while(!Q.empty()) Q.pop();
    Q.push(start);
    while(!Q.empty()) {
        int temp=Q.front();
        Q.pop();
        visited[temp]=false;
        for(int i=1; i<=N; i++) {
            if(dis[i]>dis[temp]+road[temp][i])
            {
                dis[i]=dis[temp]+road[temp][i];
                if(!visited[i]) {
                    Q.push(i);
                    visited[i]=true;
                    if(++cnt[i]>=N) return false;
                }   
            }
        }   
    }
    return true;
}
int main() {
    scanf("%d",&F);
    while(F--) {
        flag=0;
        scanf("%d%d%d",&N,&M,&W);
        for(int i=1; i<=N; i++) {
            for(int j=1; j<=N; j++) {
                road[i][j]=(i==j?0:MAX);
            }
        }
        while(M--){
            scanf("%d%d%d",&s,&e,&t);
            road[e][s]=road[s][e]=min(road[s][e],t);
        }
        while(W--) {
            scanf("%d%d%d",&s,&e,&t);
            t=-t;
            road[s][e]=min(road[s][e],t);
        }
        if(spfa()) cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
    return 0;
}