#spfa# [luogu P3385] 【模板】负环

Title

https://www.luogu.com.cn/problem/P3385

---

Solution

---

Code

#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int inn=100001;  
struct node{ int y,w,next; }a[inn];
int n,m,T,len,t[inn],f[inn],last[inn]; bool b[inn]; 
queue<int>que; 
inline void add(int x,int y,int z){
	a[++len]=(node){y,z,last[x]}; last[x]=len;
}
inline bool nagetive_ring(){
    que.push(1); t[1]=1; f[1]=0; 
    while (!que.empty()){
    	int q=que.front(); que.pop(); b[q]=true;
    	for (int i=last[q];~i;i=a[i].next){
    	   int s=a[i].y,d=a[i].w; 
    	   if (f[q]+d<f[s]){
    	   	 f[s]=f[q]+d; t[s]=t[q]+1; 
    	   	 if (t[s]>n) return 1;
    	   	 if (!b[s]) b[s]=true,que.push(s); 
		   }
		}
		b[q]=false; 
	}
	return 0; 
}	
void spfa(){
	memset(a,0,sizeof(a)); 
	memset(last,-1,sizeof(last)); 
	memset(f,0x3f3f3f,sizeof(f)); 
	memset(t,0,sizeof(t)); 
	memset(b,0,sizeof(b)); 
	while(!que.empty()) que.pop(); 
	scanf("%d%d",&n,&m); 
	int x,y,z; len=0; 
    for (int i=1;i<=m;i++){
    	scanf("%d%d%d",&x,&y,&z); 
		add(x,y,z); 
    	if (z>=0) add(y,x,z);
	}
	if (nagetive_ring()) printf("YES\n"); else printf("NO\n"); 
}
int main(){
	scanf("%d",&T); 
	while (T--) spfa(); 
	return 0; 
}