POJ 题目3169 Layout(差分约束)
2015-07-18 22:59
411 查看
Layout
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
Sample Output
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.
Source
USACO 2005 December Gold
ac代码
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 8354 | Accepted: 4017 |
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.
Source
USACO 2005 December Gold
ac代码
#include<stdio.h> #include<string.h> #include<string> #include<queue> #include<iostream> #define INF 0xfffffff using namespace std; int cnt,head[1010],vis[1010],dis[1010],cut[1010]; int n,x,y; struct s { int u,v,w,next; }edge[20020]; void add(int u,int v,int w) { edge[cnt].u=u; edge[cnt].v=v; edge[cnt].w=w; edge[cnt].next=head[u]; head[u]=cnt++; } int spfa(int s) { int i; for(i=0;i<=n;i++) { dis[i]=INF; } memset(vis,0,sizeof(vis)); memset(cut,0,sizeof(cut)); dis[s]=0; vis[s]=1; queue<int>q; q.push(s); while(!q.empty()) { int u=q.front(); q.pop(); vis[u]=0; cut[u]++; if(cut[u]>n) return -1; for(i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].v; int w=edge[i].w; if(dis[v]>dis[u]+w) { dis[v]=dis[u]+w; if(!vis[v]) { vis[v]=1; q.push(v); } } } } if(dis ==INF) return -2; return dis ; } int main() { while(scanf("%d%d%d",&n,&x,&y)!=EOF) { int i; memset(head,-1,sizeof(head)); cnt=0; for(i=0;i<x;i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); add(a,b,c); } for(i=0;i<y;i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); add(b,a,-c); } printf("%d\n",spfa(1)); } }
相关文章推荐
- cinder的手工搭建
- 树的非递归遍历(中序遍历)
- android 文件存储 Internal storage External storage
- Java高质量代码之 — 泛型与反射
- 树的非递归遍历(中序遍历)
- android http post
- iOS常用正则表达式
- ubuntu下编译neovim
- [LeetCode]Power of Two
- 19 Remove Nth Node From End of List
- 车载软件未来趋势
- wpf Application类的解释
- [POJ3264]Balanced Lineup
- 关于classpath
- Fork/Join框架介绍(转)
- 次优查找树的建立
- dashboard的手工搭建
- 启动安卓模拟器时出现 The connection to adb is down, and a severe error has occured
- 随机字符串
- eclipse安装svn插件报eclipse subversion native library not available