POJ 3169 Layout(差分约束系统+BellmanFord)

没看题目，一直以为这题没负环，TLE了好久。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn=1000+5;
const int inf=100000000;
struct edge{
    int from,to,dist;
};
struct BellmanFord{
    int n,m;
    edge edges[20000+5];
    int head[20000+5];
    int next[20000+5];
    bool inq[maxn];
    int d[maxn];
    int cnt[maxn];
    
    void init(int n){
        this->n=n;
        memset(head,-1,sizeof(head));
        m=0;
    }
    
    void addedge(int from,int to,int dist){
        next[m]=head[from];
        head[from]=m;
        edges[m++]=edge{from,to,dist};
    }
    
    bool spfa(int s){
        queue<int> q;
        memset(inq,0,sizeof(inq));
        memset(cnt,0,sizeof(cnt));
        for(int i=0;i<n;i++) {d[i]=inf;inq[0]=true;q.push(i);}
        d[s]=0;
        while(!q.empty()){
            int u=q.front();q.pop();
            inq[u]=false;
            for(int i=head[u];i!=-1;i=next[i]){
                edge &e=edges[i];
                if(d[e.to]>d[u]+e.dist){
                    d[e.to]=d[u]+e.dist;
                    if(!inq[e.to]) {inq[e.to]=true;q.push(e.to);if(++cnt[e.to]>n) return true;}
                }
            }
        }
        return false;
    }
};
int n,m1,m2;
BellmanFord solver;
int main()
{
    while(~scanf("%d%d%d",&n,&m1,&m2))
    {
        solver.init(n);
        for(int i=0;i<m1;i++){
            int u,v,dist;
            scanf("%d%d%d",&u,&v,&dist);
            u--;v--;
            solver.addedge(u,v,dist);
        }
        for(int i=0;i<m2;i++){
            int u,v,dist;
            scanf("%d%d%d",&u,&v,&dist);
            u--;v--;
            solver.addedge(v,u,-dist);
        }
        if(solver.spfa(0)) printf("-1\n");
        else if(solver.d[n-1]==inf) printf("-2\n");
        else printf("%d\n",solver.d[n-1]);
    }
    return 0;
}