|hdu 3592|差分约束|World Exhibition

poj传送门

/*
     Hdu 3592
     差分约束系统 
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define ms(i,j) memset(i, j, sizeof i);

const int INF = 100000000;
const int MAXN = 1000 + 5; 

struct edge
{
    int u, v, c;
}e[MAXN*MAXN];
int en;
struct sysdc
{
    int n;
    vector<int> G[MAXN];
    int dis[MAXN];
    int vi[MAXN];
    int cir[MAXN];
    void init(int n)
    {
        en = 0;
        this->n = n;
        for (int i=1;i<=n;i++) G[i].clear();
    }
    int ins(int a, int b, int c)//add a-b<=c
    {
        en++;
        e[en].u = b;
        e[en].v = a;
        e[en].c = c;
        G[b].push_back(en);
    }
    int solve()
    {
        queue<int> q;
        for (int i=2;i<=n;i++)
        {
            dis[i] = INF;
            vi[i] = false;
            cir[i] = 0;
        }
        dis[1] = 0; vi[1] = true; cir[1] = 1; q.push(1);
        while (!q.empty())
        {
            int r = q.front(); q.pop();vi[r] = false;
            for (int i=0;i<G[r].size();i++)
            {
                edge p = e[G[r][i]];
                if (dis[p.v]>dis[p.u]+p.c)
                {
                    dis[p.v] = dis[p.u]+p.c;
                    if (!vi[p.v])
                    {
                        cir[p.v]++;
                        if (cir[p.v]>n) return false; 
                        vi[p.v] = true;
                        q.push(p.v);
                    }
                }
            }
        }
        return true;
    }
}sdc;

int n, X, Y;

void init()
{
    scanf("%d%d%d", &n ,&X, &Y);
    sdc.init(n);
}
void solve()
{
    for (int i=1;i<=X;i++)//friend
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        if (a>b) swap(a,b);
        sdc.ins(b,a,c);
    }
    for (int i=1;i<=Y;i++)//hate
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        if (a>b) swap(a,b);
        sdc.ins(a,b,-c);
    }
    if (sdc.solve())
    {
        if (sdc.dis[n]==INF) printf("-2\n"); else printf("%d\n", sdc.dis[n]);
    } else
    {
        printf("-1\n");
    }
}
int main()
{
    int t;
    scanf("%d", &t); 
    while (t--)
    {
        init();
        solve();
    }
    return 0;
}