zoukankan      html  css  js  c++  java
  • POJ

    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.

    题解:

    差分约束基础,注意用SPFA就行(因为有负值)。

    #include <cstdio>
    #include <cstring>
    #include <queue>
    
    using namespace std;
    
    const int MAXN =1e3+10;
    const int INF = 0x3f3f3f3f;
    
    int mapp[MAXN][MAXN];
    int dis[MAXN];
    bool mark[MAXN];
    int num[MAXN];
    
    int N,ML,MD;
    
    int Spfa(int from){
    	memset(mark,0,sizeof mark);
    	memset(dis,INF,sizeof dis);
    	dis[from] = 0;
    	mark[from] = true;
    	queue<int> Q;
    	Q.push(from);
    	while(!Q.empty()){
    		int t = Q.front();
    		++num[t];
    		if(num[t]>N)return -1;//存在负权环代表无解 
    		Q.pop();
    		mark[t] = false;
    		for(int i=1 ; i<=N ; ++i){
    			if(dis[i] > dis[t]+mapp[t][i]){
    				dis[i] = dis[t] + mapp[t][i];
    				if(!mark[i]){
    					Q.push(i);
    					mark[i] = true;
    				}
    			}
    		}
    	}
    	if(dis[N] == INF)return -2;//不连通代表可以随便排。 
    	else return dis[N];
    }
    
    int main(){
    	
    	while(scanf("%d %d %d",&N,&ML,&MD) == 3){
    		memset(mapp,INF,sizeof mapp);
    		int a,b,c;
    		for(int i=1 ; i<=ML ; ++i){
    			scanf("%d %d %d",&a,&b,&c);
    			mapp[a][b] = c;
    		}
    		for(int i=1 ; i<=MD ; ++i){
    			scanf("%d %d %d",&a,&b,&c);
    			mapp[b][a] = -c;
    		}
    		printf("%d
    ",Spfa(1));
    	}
    	
    	return 0;
    }
  • 相关阅读:
    Java实现 蓝桥杯VIP 算法提高 进制转换
    数据备份服务商Rubrik获4000万美元B轮融资
    为QNetworkAccessManager添加超时提醒(自己记录一段时间里的下载字节数,用定时器去定期检测,从而判断是否超时)
    DIOCP3 DEMO的编译(去掉VCL前缀)
    Golang环境搭建,Notepad++配置Golang开发环境,Golang发送邮件
    川普当选对中国的好处在哪?(会注重实利,而不是虚的意识形态)
    带你走近AngularJS
    ASP.NET MVC学习之控制器篇扩展性
    微信语音识别及网页获取用户信息
    敏捷和自动化测试
  • 原文地址:https://www.cnblogs.com/vocaloid01/p/9514030.html
Copyright © 2011-2022 走看看