POJ3259-Wormholes 虫洞

最新推荐文章于 2024-09-27 22:32:35 发布

soledada

最新推荐文章于 2024-09-27 22:32:35 发布

阅读量582

点赞数

分类专栏： POJ解题报告图论 bellman_ford 文章标签： poj 3259 图论 bellman_ford

本文链接：https://blog.csdn.net/soledada/article/details/8647458

版权

POJ解题报告同时被 3 个专栏收录

6 篇文章 0 订阅

订阅专栏

图论

3 篇文章 0 订阅

订阅专栏

bellman_ford

2 篇文章 0 订阅

订阅专栏

说白了就是找负回路，利用虫洞尝试看到从前的自己

filed是双向的路径但是wormhole是单向的负路径

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 22684		Accepted: 8085

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

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.

//time 250ms memory 300k

#include<iostream>
using namespace std;

int dis[1001];//即D[k][u]=dis[u] k逐步relax提高
const int MAX=100000;
class weight{
public:
int s;
int e;
int t;
}edge[6000];

int N,M,W;
int all_e;

bool bellman()
{
bool flag;

for(int k=1;k<=N-1;k++)
{
flag=0;
for(int i=0;i<all_e;i++)
{
if(dis[ edge[i].e] > dis[edge[i].s ] + edge[i].t )
{
dis[edge[i].e] = dis[edge[i].s ] + edge[i].t;
flag=1;//关键！原先的距离大于 j边上加edge的举例
}
}
if(!flag)
break;
}
//查找负环对每条边进行检测如果发现可继续更新的边即存在负环
for(int i=0;i<all_e;i++)
if(dis[ edge[i].e ] > dis[ edge[i].s ] + edge[i].t )
return 1;//有负环

return 0;//找不到负环
}
int main()
{
int u,v,w,F;
cin>>F;
while(F--)
{
memset(dis,MAX,sizeof(dis) );//默认设置dis最大
cin>>N>>M>>W;
all_e=0;//所有边数记0
//输入开始
for(int i=1;i<=M;i++)
{
cin>>u>>v>>w;
edge[all_e].s=edge[all_e+1].e=u;
edge[all_e].e=edge[all_e+1].s=v;
edge[all_e].t=edge[all_e+1].t=w;//双向性
all_e+=2;//指针滚动
}
for(int i=1;i<=W;i++)
{
cin>>u>>v>>w;
edge[all_e].s=u;
edge[all_e].e=v;
edge[all_e].t=-w;//双向性
all_e++;//指针滚动
}
//bellman-ford开始
if(bellman())
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;

}//while F
return 0;
}