POJ 3259 Wormholes（最短路）

Language: Default Wormholes Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 41408   Accepted: 15221 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 题意：John的农场里field块地，path条路连接两块地，hole个虫洞，虫洞是一条单向路，不但会把你传送到目的地，而且时间会倒退Ts。我们的任务是知道会不会在从某块地出发后又回来，看到了离开之前的自己。 解：直接spfa判断是否存在负环就OK了 #include<stdio.h> #include<string.h> #include<iostream> #include<string> #include<map> #include<queue> #include<algorithm> using namespace std; const int maxm=1e5+10; const int inf=1<<29; int pnt[maxm],nxt[maxm],pre[maxm],cnt[maxm]; int cost[maxm],head[maxm],dist[maxm]; int vis[maxm]; queue<int>q; int e; int n,M,W; void add(int u,int v,int c) { pnt[e]=v; nxt[e]=head[u]; cost[e]=c; head[u]=e++; } int spfa(int st) { for(int i=0; i<=n; i++) { dist[i]=inf; } dist[st]=0; q.push(st); while(!q.empty()) { int u=q.front(); q.pop(); vis[u]=0; for(int i=head[u]; i!=-1; i=nxt[i]) { if(dist[pnt[i]]>dist[u]+cost[i]) { pre[pnt[i]]=u; dist[pnt[i]]=dist[u]+cost[i]; if(++cnt[pnt[i]]>=n) return 1; if(!vis[pnt[i]]) { vis[pnt[i]]=1; q.push(pnt[i]); } } } } return 0; } int main() { int t; scanf("%d",&t); while(t--) { e=0; memset(pre,-1,sizeof(pre)); memset(vis,0,sizeof(vis)); memset(cnt,0,sizeof(cnt)); memset(head,-1,sizeof(head)); scanf("%d%d%d",&n,&M,&W); int a,b,c; for(int i=0; i<M; i++) { scanf("%d%d%d",&a,&b,&c); add(a,b,c); add(b,a,c); } for(int i=0; i<W; i++) { scanf("%d%d%d",&a,&b,&c); add(a,b,-c); } if(spfa(1)) printf("YES\n"); else printf("NO\n"); } return 0; }