P3385 【模板】负环（bfs找负环）

可以设置一个lop数组，记录节点深度，最深时为n，当且仅当图为一条链时，所以lop[i]>n时，图有负环。

#include <bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define MP make_pair
#define PI pair<int,int>
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
int t, h[N], cnt, dis[N], vis[N], lop[N], n, m;
struct node {
    int v, w, net;
} no[N];
void add(int u, int v, int w) {
    no[cnt].v = v;
    no[cnt].w = w;
    no[cnt].net = h[u];
    h[u] = cnt++;
}
int spfa() {
    queue<int>q;
    q.push(1);
    vis[1] = 1, dis[1] = 0, lop[1] = 1;
    while(!q.empty()) {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for(int i = h[u]; i != -1; i = no[i].net) {
            int v = no[i].v, w = no[i].w;
            if(dis[v] > dis[u] + w) {
                dis[v] = dis[u] + w;
                lop[v] = lop[u] + 1;
                if(lop[v] > n)
                    return 1;
                if(!vis[v]) {
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }
    return 0;
}
int main() {
    cin >> t;
    while(t--) {
        mem(h, -1), mem(dis, 0x3f), me(lop), me(vis), cnt = 0;
        cin >> n >> m;
        for(int u, v, w, i = 0; i < m; i++) {
            cin >> u >> v >> w;
            add(u, v, w);
            if(w >= 0)
                add(v, u, w);
        }
        if(spfa())
            cout << "YE5" << endl;
        else
            cout << "N0" << endl;
    }
    return 0;
}