我审题果然不仔细,一直不出sample原来是看错了 求成了最小值,题目中要我们求最大值。。。。。。
这道题是一道差分约束,这题的约束关系非常的明显
ML S[b]-S[a]<=c
MD S[b]-S[a]>=c 转化后 S[a]-S[b]<=-c
还有相邻的两只牛之间的距离 S[i]-s[i-1]>=0 转化后 S[i-1]-S[i]<=0
我们要求最长的排队距离就是要解出这个关系 S[N]-S[1]<=x,这里可以发现约束已经符合标准,从1指向n 就是以1为源点求1到n的最短路。
Layout
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4585 | Accepted: 2208 |
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.
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.
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.
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.
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<vector>
using namespace std;
#define MAXN 1010
#define INF 0xFFFFFF
struct node
{
int to;
int dis;
};
int n,ml,md;
vector<node> g[MAXN];
bool in[MAXN];
int dis[MAXN];
int counts[MAXN];
bool spfa(int s)
{
queue<int> q;
for(int i=0;i<=n;i++)
{
dis[i]=INF;
in[i]=false;
counts[i]++;
}
in[s]=true;
dis[s]=0;
q.push(s);
counts[s]++;
while(!q.empty())
{
int tag=q.front();
q.pop();
in[tag]=false;
for(int i=0;i<g[tag].size();i++)
{
int j=g[tag][i].to;
if(dis[j]>dis[tag]+g[tag][i].dis)
{
dis[j]=dis[tag]+g[tag][i].dis;
if(!in[j])
{
in[j]=true;
q.push(j);
counts[j]++;
if(counts[j]>=n)
return false;
}
}
}
}
return true;
}
void init()
{
int a,b,c;
node temp;
for(int i=0;i<=n;i++)
g[i].clear();
for(int i=1;i<=ml;i++)
{
scanf("%d%d%d",&a,&b,&c);
temp.to=b;
temp.dis=c;
g[a].push_back(temp);
temp.to=a;
temp.dis=0;
g[b].push_back(temp);
}
for(int i=1;i<=md;i++)
{
scanf("%d%d%d",&a,&b,&c);
temp.to=a;
temp.dis=-c;
g[b].push_back(temp);
}
for(int i=2;i<=n;i++)
{
temp.to=i-1;
temp.dis=0;
g[i].push_back(temp);
}
}
int main()
{
while(cin>>n>>ml>>md)
{
init();
if(spfa(1))
{
if(dis[n]==INF)
cout<<"-2"<<endl;
else
cout<<dis[n]<<endl;
}
else
cout<<"-1"<<endl;
}
return 0;
}