HDU3569(90/600)

是个板子题
学一下差分约束怎么建边的

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
//#define int long long 
const int INF = 0x3f3f3f3f;  
const int maxn = 209001;  
int n, m,t;  
struct edge  
{  
    int v, w, next;  
}Edge[2000000];  
int head[maxn], dis[maxn], time[maxn], cnt;  
bool vis[maxn];  
void add_Edge(int u, int v, int w)  
{  
    Edge[cnt].v = v;  
    Edge[cnt].w = w;  
    Edge[cnt].next = head[u];  
    head[u] = cnt++;  
}  
int spfa(int s, int tol)  
{  
    memset(dis, 63, sizeof(dis));  
    memset(time, 0, sizeof(time));  
    memset(vis, false, sizeof(vis));  
    dis[s] = 0;  
    vis[s] = true;  
    time[s]++;  
    queue<int> q;  
    q.push(s);  
    while(!q.empty())  
    {  
        int tem = q.front();  
        q.pop();  
        vis[tem] = false;  
        for(int i = head[tem]; i != -1; i = Edge[i].next)  
        {  
            int to = Edge[i].v;  
            if(dis[to] > dis[tem] + Edge[i].w)  
            {  
                //cout << "yes\n";  
                dis[to] = dis[tem] + Edge[i].w;  
                if(!vis[to])  
                {  
                    vis[to] = true;  
                    q.push(to);  
                    time[to]++;  
                    if(time[to] >= tol)  
                        return 1;  
                }  
            }  
        }  
    }  
    return 0;  
}  
int main()  
{  
    int T;
    cin>>T;
    while(T--)
    {
        int u, v, w;  
        cin>>n>>m>>t;  
        cnt = 0;  
        memset(head, -1, sizeof(head));  
        memset(Edge,0,sizeof(Edge));
        for(int i = 0; i < m; i++)  
        {  
            scanf("%d%d%d", &u, &v, &w);  
            if(u>v)swap(u,v); 
            add_Edge(u, v, w);  
        } 
        for(int a=0;a<t;a++)
        {
            scanf("%d%d%d", &u, &v, &w);  
            if(u<v)swap(u,v); 
            add_Edge(u, v, -w);
        }
        int ans = spfa(1, n);
        if(ans)
        {
            cout<<-1<<endl;
            continue;
        }
        if(dis[n]==0x3f3f3f3f)cout<<-2<<endl;
        else cout<<dis[n]<<endl;
    }
} //x-y<=b可以建立y->x的边 x-y>=b可以建立x->y  -b的边