Layout (线性差分)
来源:互联网 发布:淘宝上可靠的眼镜店 编辑:程序博客网 时间:2024/06/05 19:20
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.
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.
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.
4 2 11 3 102 4 202 3 3
27
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.
ac代码:
#include<cstdio>#include<algorithm>#include<cstring>#include<iostream>#include<sstream>#include<map>#include<vector>#include<queue>#define LL long long#define INF 0x3f3f3f3fusing namespace std;const int maxn = 1000+50;int head[maxn];int tot;struct node{ int u,v; int net; int cost;}E[10000*2+10];int d[maxn];int n,n1,n2;void init(){ memset(head,-1,sizeof(head)); tot = 0;}void build(int u,int v,int w){ E[tot].u = u; E[tot].v = v; E[tot].net = head[u]; E[tot].cost = w; head[u] = tot++;}int cnt[maxn];int vis[maxn];int spfa(){ for(int i = 0;i<=n;i++) vis[i]= 0,cnt[i] = 0; for(int i = 0;i<=n;i++) d[i] = INF; queue<int>Q; Q.push(1); d[1] = 0; cnt[1]= 1; vis[1] = 1; while(!Q.empty()) { int now = Q.front(); Q.pop(); vis[now] = 0; for(int i = head[now];~i;i = E[i].net){ int to = E[i].v; int w = E[i].cost; if(d[to]>d[now]+w){ d[to] = d[now]+w; if(vis[to]==0){ vis[to] = 1; cnt[to]++; if(cnt[to]>n) return 0; Q.push(to); } } } } return 1;}int main(){ while(~scanf("%d%d%d",&n,&n1,&n2)) { init(); for(int i = 0;i<n1;i++){ int a,b,w; scanf("%d%d%d",&a,&b,&w); build(a,b,w); } for(int i = 0;i<n2;i++) { int a,b,w; scanf("%d%d%d",&a,&b,&w); build(b,a,-w); } for(int i = 2;i<=n;i++){ build(i,i-1,0); } int falg = spfa(); if(!falg){ puts("-1"); } else{ if(d[n]>=INF) puts("-2"); else{ printf("%d\n",d[n]); } } } return 0;}
阅读全文
0 0
- Layout (线性差分)
- poj 3169 Layout(差分约束)
- poj 3169 Layout(差分约束)
- POJ 3169 Layout (差分约束)
- POJ 3169 Layout(差分约束)
- [POJ3169]Layout(差分约束)
- POJ3169 Layout (差分约束)
- poj 3169 Layout(差分约束)
- poj Layout(差分约束)
- poj 3169 Layout (差分约束)
- POJ3169 Layout(差分约束)
- POJ 3167 Layout(差分约束)
- POJ-3169 Layout(差分约束)
- poj 3169 Layout (差分约束)
- POJ3169 Layout 差分约束
- Layout poj3169 差分约束
- POJ3169 Layout(差分约束)
- Layout POJ3169 差分约束
- 在spring-boot中使用swagger2来构建RESTful API文档
- python中的条件判断
- C++ Windows进程和线程
- 使用c#调用c++代码方法及原理(一)
- 网页复制,使用clipboard.js复制任意内容到粘贴板.不需要通过flash
- Layout (线性差分)
- 工厂方法模式
- 计算机基础知识
- MogonDB语法
- 学习KNN(三)KNN+HOG实现手写数字识别
- Android 高德地图,显示最基本的地图
- HBase 伪分布式搭建
- spark 应用输出debug日志
- css3常用语言-动画