Wormholes POJ - 3259 spfa判断负环

题意: 前m行输入a1到b1权值为s1的边，后w行输入a2到b2权值为-s2的边，问你能不能在图中找到一个负环
思路：spfa判断负环 ，若一个点进队次数大于n-1就含有负环 

#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
using namespace std;
const int N=3000; 
struct node
{
	int to;
	int s;
	int next;
}edge[N*2];
int head[N];
int cnt=0;
int dist[N];//到第i点的权值 
bool vis[N];//是否在队内 
int a1[N];//点入队次数 
int n,m,w;
void add(int u,int v,int s)
{
	edge[++cnt].to=v;
	edge[cnt].s=s;
	edge[cnt].next=head[u];
	head[u]=cnt; 
} 
void init()
{
	memset(dist,0x3f3f3f3f,sizeof(dist));//距离初始化到无穷 
	memset(vis,0,sizeof(vis));
	memset(a1,0,sizeof(a1));
	dist[1]=0; 
}
bool spfa(int x)
{
	queue<int>q;
	init();
	q.push(x);
	vis[x]=1;
	a1[x]++;
	while(!q.empty())
	{
		int tmp=q.front();
		q.pop();
		vis[tmp]=0;
		for(int i=head[tmp];i;i=edge[i].next)
		{
			int to=edge[i].to;
			if(dist[to]>dist[tmp]+edge[i].s)
			{
				dist[to]=dist[tmp]+edge[i].s;
				if(!vis[to])
				{
					a1[to]++;
					if(a1[to]>n-1)
					{
						return 0;
					}
					vis[to]=1;
					q.push(to);
				}
			}
		}
	}
	return 1;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cnt=0;
		memset(head,0,sizeof(head));
		cin>>n>>m>>w;
		int a,b,s;
		for(int i=1;i<=m;i++)
		{
			//无向图正反都要存 
			cin>>a>>b>>s;
			add(a,b,s);
			add(b,a,s);
			 
		}
		for(int i=1;i<=w;i++)
		{
			cin>>a>>b>>s;
			add(a,b,-s); 
		}
		bool bo=spfa(1);
		if(bo)cout<<"NO\n";
		else cout<<"YES\n";
	} 
	return 0;
}