P3385 【模板】负环,90分求调，悬关

#include<bits/stdc++.h>
using namespace std;
int a[2001],u[6001],v[6001],w[6001],t,n,m,ans;
int main()
{
    cin>>t;
    for(int register i=1;i<=t;++i)
    {
        cin>>n>>m;
        int t=m;
        for(int register i=1;i<=n;++i)
            a[i]=1000000000;
        for(int register i=1;i<=m;++i)
        {
            cin>>u[i]>>v[i]>>w[i];
            if(w[i]>=0)
            {
                u[++t]=v[i];
                v[t]=u[i];
                w[t]=w[i];
            }
        }
        a[1]=0;
        for(int register k=1;k<=n-1;k++)
        {
            int check=0;
            for(int register i=1;i<=t;i++)
                if(a[v[i]]>a[u[i]]+w[i])
                {
                    a[v[i]]=a[u[i]]+w[i];
                    check=1;
                }
            if(check==0) 
                break;
        }
        ans=0;
        for(int register i=1;i<=t;++i)
            if(a[v[i]]>a[u[i]]+w[i])
                ans=1;
        if(ans==1)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}