hdu 3592 World Exhibition（差分约束，最短路）

World Exhibition

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1538    Accepted Submission(s): 771

Problem Description

Nowadays, many people want to go to Shanghai to visit the World Exhibition. So there are always a lot of people who are standing along a straight line waiting for entering. Assume that there are N (2 <= N <= 1,000) people numbered 1..N who are standing in the same order as they are numbered. It is possible that two or more person line up at exactly the same location in the condition that those visit it in a group.

There is something interesting. Some like each other and want to be within a certain distance of each other in line. Some really dislike each other and want to be separated by at least a certain distance. A list of X (1 <= X <= 10,000) constraints describes which person like each other and the maximum distance by which they may be separated; a subsequent list of Y constraints (1 <= Y <= 10,000) tells which person dislike each other and the minimum distance by which they must be separated.

Your job is to compute, if possible, the maximum possible distance between person 1 and person N that satisfies the distance constraints.

 

Input

First line: An integer T represents the case of test.

The next line: Three space-separated integers: N, X, and Y. 

The next X lines: Each line contains three space-separated positive integers: A, B, and C, with 1 <= A < B <= N. Person A and B must be at most C (1 <= C <= 1,000,000) apart.

The next Y lines: Each line contains three space-separated positive integers: A, B, and C, with 1 <= A < B <= C. Person A and B must be at least C (1 <= C <= 1,000,000) apart.

 

Output

For each line: A single integer. If no line-up is possible, output -1. If person 1 and N can be arbitrarily far apart, output -2. Otherwise output the greatest possible distance between person 1 and N.

 

Sample Input

  
  

   
   1
4 2 1
1 3 8
2 4 15
2 3 4
  
  

 

Sample Output

  
  

   
   19
  
  

 

Author

alpc20

题意：有n个人在排队，有p组关系表示某两个人之间的距离不想超过x

q组关系表示某两个人之间的距离不想小于x

问第一个人到第n个人最长距离

无解输出-1，解有无限长输出-2，否则输出答案

思路：差分约束模板题，直接保存关系然后用spfa跑最短路即可

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
#define N 1050
#define INF 999999999
struct Edge
{
    int v,next,w;
}edge[N*20];
int cnt,head[N],n;
int d[N],vis[N],num[N];
void init()
{
    cnt=0;
    memset(head,-1,sizeof(head));
}
void addedge(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)
{
    memset(vis,0,sizeof(vis));
    memset(num,0,sizeof(num));
    for(int i=1;i<=n;i++)
        d[i]=i==s?0:INF;
    vis[s]=1;
    queue<int>que;
    que.push(s);
    while(!que.empty())
    {
        int u=que.front();
        que.pop();
        vis[u]=0;
        num[u]++;
        if(num[u]>n) return -1;
        for(int i=head[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].v,w=edge[i].w;
            if(d[v]>d[u]+w)
            {
                d[v]=d[u]+w;
                if(!vis[v])
                {
                    vis[v]=1;
                    que.push(v);
                }
            }
        }
    }
    if(d[n]==INF) return -2;
    return d[n];
}
int main()
{
    int T;
    int p,q;
    int s,t,w;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d %d %d",&n,&p,&q);
        for(int i=0;i<p;i++)
        {
            scanf("%d %d %d",&s,&t,&w);
            addedge(s,t,w);
        }
        for(int i=0;i<q;i++)
        {
            scanf("%d %d %d",&s,&t,&w);
            addedge(t,s,-w);
        }
        for(int i=2;i<=n;i++)
            addedge(i,i-1,0);
        printf("%d\n",spfa(1));
    }
    return 0;
}