【poj 3259】Wormholes（虫洞）

n个点，m条正权双向边，k条负权单项边
问能否通过走路时光倒流

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int MAXN = 100000 + 5;
struct edge
{
    int f,t,v;
}l[MAXN << 1];
int first[MAXN],next[MAXN << 1],tot;
void init()
{
    memset(first,0xfff,sizeof(first));
    tot = 0;
    return;
}
void build(int f,int t,int v)
{
    l[++tot] = (edge){f,t,v};
    next[tot] = first[f];
    first[f] = tot;
    return;
}
queue <int> q;
int dis[MAXN];
bool use[MAXN];
int cnt[MAXN];
int n,m,k;
void spfa(int s)
{
    memset(use,0,sizeof(use));
    memset(dis,0x3f,sizeof(dis));
    dis[s] = 0;
    q.push(s);
    use[s] = true;
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        use[u] = false;
        if(dis[s] < 0)
        {
            puts("YES");
            return;
        }
        for(int i = first[u];i != -1;i = next[i])
        {
            int v = l[i].t;
            if(dis[v] > dis[u] + l[i].v)
            {
                dis[v] = dis[u] + l[i].v;
                if(use[v])
                    continue;
                q.push(v);
                use[v] = true;
            }
        }
    }
    puts("NO");
    return;
}
int f,t,v;
int T;
int main()
{
    scanf("%d",&T);
    while(T --)
    {
        init();
        scanf("%d %d %d",&n,&m,&k);
        for(int i = 1;i <= m;i ++)
        {
            scanf("%d %d %d",&f,&t,&v);
            build(f,t,v);
            build(t,f,v);
        }
        for(int i = 1;i <= k;i ++)
        {
            scanf("%d %d %d",&f,&t,&v);
            build(f,t,-v);
        }
        spfa(1);
    }
    return 0;
}