Wormholes POJ - 3259

https://cn.vjudge.net/problem/POJ-3259 

总结：spfa判断负环（节点入队最多n-1次，超过n就存在） 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
gp_hash_table<string,int>mp2;
#include<ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------
*/

/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=3e4+9;
const int mod=1e9+7;

int d[maxn];
int num[maxn];
bool vis[maxn];
int head[maxn];
int tot;
int n,m,mm;
struct E
{
    int to,cost,nex;
}edge[maxn*3];
struct node
{
    int to,cost;
    node(){}
    node(int _to,int _cost)
    {
        to=_to;
        cost=_cost;
    }
    bool operator < (const node &b) const
    {
        return cost>b.cost;
    }
};

void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].cost=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void init()
{
    mem(head,-1);
    tot=0;
}
bool spfa()
{
    queue<int>q;
    mem(d,INF);
    mem(vis,0);
    mem(num,0);

    d[1]=0;
    vis[1]=1;
    num[1]++;

    q.push(1);

    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        vis[u]=0;

        for(int i=head[u];i!=-1;i=edge[i].nex)
        {
            int v=edge[i].to;
            int w=edge[i].cost;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                if(!vis[v])
                {
                    vis[v]=1;
                    q.push(v);
                    num[v]++;
                    if(num[v]>n) return 1;//存在负环
                }

            }
        }
    }
    return 0;
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {
        init();
        scanf("%d%d%d",&n,&m,&mm);
        for(int i=1;i<=m;i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
            addedge(v,u,w);
        }
        for(int i=1;i<=mm;i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,-w);
        }
        if(spfa())
        {
            puts("YES");
        }
        else puts("NO");
    }

    return 0;
}