POJ 3169 Layout

Layout

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13466		Accepted: 6456

Description

Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are standing in the same order as they are numbered, and since they can be rather pushy, it is possible that two or more cows can line up at exactly the same location (that is, if we think of each cow as being located at some coordinate on a number line, then it is possible for two or more cows to share the same coordinate). 

Some cows 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 ML (1 <= ML <= 10,000) constraints describes which cows like each other and the maximum distance by which they may be separated; a subsequent list of MD constraints (1 <= MD <= 10,000) tells which cows 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 cow 1 and cow N that satisfies the distance constraints.

Input

Line 1: Three space-separated integers: N, ML, and MD. 

Lines 2..ML+1: Each line contains three space-separated positive integers: A, B, and D, with 1 <= A < B <= N. Cows A and B must be at most D (1 <= D <= 1,000,000) apart. 

Lines ML+2..ML+MD+1: Each line contains three space-separated positive integers: A, B, and D, with 1 <= A < B <= N. Cows A and B must be at least D (1 <= D <= 1,000,000) apart.

Output

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

Sample Input

4 2 1
1 3 10
2 4 20
2 3 3

Sample Output

27

Hint

Explanation of the sample: 

There are 4 cows. Cows #1 and #3 must be no more than 10 units apart, cows #2 and #4 must be no more than 20 units apart, and cows #2 and #3 dislike each other and must be no fewer than 3 units apart. 

The best layout, in terms of coordinates on a number line, is to put cow #1 at 0, cow #2 at 7, cow #3 at 10, and cow #4 at 27.

题目大意：有n头奶牛，给出a种关系，表示x奶牛和y奶牛之间的最大距离为z，再给出b种关系，表示x奶牛和y奶牛的最小距离为z，求第一头奶牛和最后一头奶牛的距离的最大值

差分约束的模板题。

当b-a<=z时，建一条a->b的有向边，当a-b>=z时，建一条b->a的有向边。跑一遍最短路，判负环

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=2e4+7;
struct Node
{
	int to;
	int w;
	int next;
}edge[maxn];
int head[maxn];
bool vis[maxn];
int dis[maxn];
int in[maxn];
int cnt,n;
void init()
{
	memset(head,-1,sizeof(head));
	memset(vis,false,sizeof(vis));
	memset(dis,0x3f,sizeof(dis));
	memset(in,0,sizeof(in));
}
void add(int u,int v,int w)
{
	edge[cnt].to=v;
	edge[cnt].w=w;
	edge[cnt].next=head[u];
	head[u]=cnt++;
	return;
}
void spfa()
{
	queue<int> que;
	que.push(1);
	dis[1]=0;
	bool flag=false;
	while(!que.empty())
	{
		int node=que.front();
		que.pop();
		in[node]++;
		if(in[node]>n)
		{
			flag=true;
			break;
		}
		vis[node]=false;
		for(int i=head[node];~i;i=edge[i].next)
		{
			int v=edge[i].to;
			int w=edge[i].w;
			if(dis[v]>dis[node]+w)
			{
				dis[v]=dis[node]+w;
				if(!vis[v])
				{
					vis[v]=true;
					que.push(v);
				}
			}
		}
	}
	if(flag) cout<<-1<<endl;
	else if(dis[n]==0x3f3f3f3f) cout<<-2<<endl;
	else cout<<dis[n]<<endl;
}
int main()
{
	int ml,md;
	while(cin>>n>>ml>>md)
	{
		init();
		for(int i=0;i<ml;i++)
		{
			int u,v,w;
			cin>>u>>v>>w;
			add(u,v,w);
		}
		for(int i=ml;i<ml+md;i++)
		{
			int u,v,w;
			cin>>u>>v>>w;
			add(v,u,-w);
		}
		spfa();
		//cout<<dis[n]<<endl;
	}
}