判负环：POJ3259 虫洞

最新推荐文章于 2024-10-03 17:25:08 发布

可惜浅灰

最新推荐文章于 2024-10-03 17:25:08 发布

阅读量113

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_48988844/article/details/120468792

版权

算法专栏收录该内容

49 篇文章 0 订阅

订阅专栏

这篇博客探讨了一种有趣的时间旅行问题，即农民约翰想要在他的多个农场中利用特殊的虫洞进行时间旅行，返回到出发之前。题目描述了一个包含路径和虫洞的网络，并提出了使用SPFA算法来判断是否存在这样的回路，使得约翰能回到过去。代码示例展示了如何实现SPFA算法以解决这个问题。

摘要由CSDN通过智能技术生成

题目描述：

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.

输入：

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.

输出：

Lines 1..F: For each farm, output "YES" if FJ can achieve his goal, otherwise output "NO" (do not include the quotes).

输入样例：

输出样例：

NO
YES

解题思路：

能否回到过去即为判断负环问题，可以采用SPFA算法快速求解。

SPFA算法：判断负环_可惜浅灰的博客-CSDN博客

代码实现：

#include <iostream>
using namespace std;
#include <queue>
#define maxn 501

int n, m1, m2;
int dis[maxn], sum[maxn];
int head[maxn], cnt;
bool vis[maxn];

class Edge
{
public:
    int to;
    int weight;
    int next;
};
Edge edge[maxn << 1];

void InsertEdge(const int& u, const int& v, const int& w)
{
    edge[++cnt].to = v;
    edge[cnt].weight = w;
    edge[cnt].next = head[u];
    head[u] = cnt;
}

void CreateGraph()
{
    int u, v, w;
    cin >> n >> m1 >> m2;
    for (int i = 1; i <= m1; i++)
    {
        cin >> u >> v >> w;
        InsertEdge(u, v, w);
        InsertEdge(v, u, w);
    }
    for (int i = 1; i <= m2; i++)
    {
        cin >> u >> v >> w;
        InsertEdge(u, v, -w);
    }
}

bool SPFA()
{
    queue<int> q;
    dis[1] = 0;
    q.push(1);
    vis[1] = true;
    sum[1]++;
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        vis[x] = false;
        for (int i = head[x]; i; i = edge[i].next)
        {
            int v = edge[i].to;
            if (dis[v] > dis[x] + edge[i].weight)
            {
                dis[v] = dis[x] + edge[i].weight;
                if (!vis[v])
                {
                    if (++sum[v] >= n)
                    {
                        return true;
                    }
                    q.push(v);
                    vis[v] = true;
                }
            }
        }
    }
    return false;
}

void Init()
{
    memset(dis, 0x3f3f3f3f, sizeof(dis));
    memset(head, 0, sizeof(head));
    memset(vis, false, sizeof(vis));
    memset(sum, 0, sizeof(sum));
    cnt = 0;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        Init();
        CreateGraph();
        if (SPFA())
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }

    return 0;
}