POJ 3259 Wormholes（SPFA判负环）

POJ 3259 Wormholes（SPFA判负环）

vj链接

Solution

spfa 模板题
将虫洞的边权 作为负权边加进图中即可

代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<queue>
#include<set>
//#define int long long
using namespace std;
typedef pair<int, int> pii;
typedef double dd;
typedef long long ll;
const int MAXN = 510;
const int MAXM = 100010;
const dd eps = 1e-6;
const int inf = 0x3f3f3f3f;

int n, m, W, mp[MAXN][MAXN];
int dis[MAXN], cnt[MAXN];
bool vis[MAXN];

bool spfa()
{
    memset(cnt, 0, sizeof(cnt));
    memset(dis, 0x3f, sizeof(dis));
    memset(vis, 0, sizeof(vis));
    dis[1] = 0;
    cnt[1] = 1;
    queue<int> q;
    q.push(1);
    while(q.size())
    {
        int u = q.front();
        q.pop();
        vis[u] = 0;
        for (int i = 1; i <= n;i++)
        {
            if(dis[i] > dis[u] + mp[u][i])
            {
                dis[i] = dis[u] + mp[u][i];
                if(!vis[i])
                {
                    vis[i] = 1;
                    if(++cnt[i] > n)
                        return 0;
                    q.push(i);
                }
            }
        }
    }
    return 1;
}

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        memset(mp, 0x3f, sizeof(mp));
        cin >> n >> m >> W;
        // for (int i = 1; i <= n;i++)
        //     mp[i][i] = 0;
        for (int i = 1; i <= m; i++)
        {
            int u, v, w;
            cin >> u >> v >> w;
            if (w < mp[u][v])
                mp[u][v] = mp[v][u] = w;
        }
        for (int i = 1; i <= W;i++)
        {
            int u, v, w;
            cin >> u >> v >> w;
            mp[u][v] = -w;
        }
        if(!spfa())
            printf("YES\n");
        else
            printf("NO\n");
    }
}