poj3259 Wormholes

最新推荐文章于 2020-08-02 23:36:18 发布

UMR小豪

最新推荐文章于 2020-08-02 23:36:18 发布

阅读量222

点赞数

分类专栏：最短路

本文链接：https://blog.csdn.net/qq_33362864/article/details/52083079

版权

最短路专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 43774		Accepted: 16073

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.

虫洞，这个题就是说一个人在农场突然发现了一些虫洞，于是便想着能不能从某点出发回到原点并且还是回到了以前，告诉你N点数，M路径数，W冲动数。

不难理解，把话费的时间看做权值，而虫洞的显然是负值。就是判断一下会不会产生负环。因为点数不是很大，并且给了两秒，所以直接用floyd写了，过了。

其实有个略小的优化╮(╯▽╰)╭

不然是水不过去的，想要看优先队列做法的，直接参照poj1860那个题是判断正环的。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <string>
#include <cstring>
#include <cmath>
#include <queue>

using namespace std;
const int inf=0x3f3f3f;
int n,m,p;
int dis[520][520];
int floyd()
{
    int i,j,k;
    for(k=1; k<=n; ++k)
        for(i=1; i<=n; ++i)
        {
            for(j=1; j<=n; ++j)
            {
                if(dis[i][j]>dis[i][k]+dis[k][j])
                {
                    dis[i][j]=dis[i][k]+dis[k][j];
                }
            }
            if(dis[i][i]<0)return 1;//只要找到负环接着返回
        }
            return 0;
}
int main()
{
    int t;
    int i,j;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&p);
        for(i=1; i<=n; ++i)
            for(j=1; j<=n; ++j)
            {
                if(i==j)dis[i][j]=0;
                else dis[i][j]=inf;
            }
        int u,v,w;
        while(m--)
        {
            scanf("%d%d%d",&u,&v,&w);
            if(w<dis[u][v])
            {
                dis[u][v]=dis[v][u]=w;
            }
        }
        while(p--)
        {
            scanf("%d%d%d",&u,&v,&w);
            dis[u][v]=-w;
        }
        if(floyd())printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}