World Exhibition 【HDU - 3592】【差分约束】

题目链接

---

  这里就是需要带进差分约束了，我们可以把所有认定成A - B <= C的都看成"A -> B 距离是C"，可以把A - B >= C转换一下，变成了B - A <= -C那么，也就化成了上面的这个"<="的形式，此时，建边就是" B -> A  距离是-C "。那么我们就可以去跑这样的一个最短路了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define efs 1e-6
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MAX_3(a, b, c) max(max(a, b), c)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e3 + 7, maxE = 2e4 + 7;
int N, X, Y, cnt, head[maxN], dist[maxN], used[maxN];
struct Eddge
{
    int nex, to, val;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int w)
{
    edge[cnt] = Eddge(head[u], v, w);
    head[u] = cnt++;
}
queue<int> Q;
bool inque[maxN];
inline int spfa()
{
    memset(inque, false, sizeof(inque));
    memset(dist, INF, sizeof(dist)); memset(used, 0, sizeof(used));
    dist[1] = 0;
    while(!Q.empty()) Q.pop();
    Q.push(1); inque[1] = true; used[1]++;
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop(); inque[u] = false;
        for(int i=head[u], v, w; ~i; i=edge[i].nex)
        {
            v = edge[i].to; w = edge[i].val;
            if(dist[v] > dist[u] + w || used[u] >= N)
            {
                dist[v] = dist[u] + w;
                if(!inque[v] && used[v] < N)
                {
                    ++used[v];
                    inque[v] = true;
                    Q.push(v);
                }
            }
        }
    }
    return used[N] >= N ? -1 : ( dist[N] == INF ? -2 : dist[N] );
}
inline void init()
{
    cnt = 0;
    memset(head, -1, sizeof(head));
}
int main()
{
    int T; scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d%d", &N, &X, &Y);
        init();
        for(int i=1, u, v, w; i<=X; i++)
        {
            scanf("%d%d%d", &u, &v, &w);
            addEddge(u, v, w);
        }
        for(int i=1, u, v, w; i<=Y; i++)
        {
            scanf("%d%d%d", &u, &v, &w);
            addEddge(v, u, -w);
        }
        printf("%d\n", spfa());
    }
    return 0;
}