THE MATRIX PROBLEM_差分约束_2018_3_18

最新推荐文章于 2019-08-14 20:39:58 发布

ujn20161222

最新推荐文章于 2019-08-14 20:39:58 发布

阅读量192

点赞数

本文链接：https://blog.csdn.net/ujn20161222/article/details/79598117

版权

hdu 同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

差分约束

2 篇文章 0 订阅

订阅专栏

这种写法就是判断负环

L<=num[i][j]*b[j]/a[i]<=U
#define c num[i][j]
L/c<=b[j]/a[i]<=U/c
log(L/c)<=log(b[j])-log(a[i])<=log(U/c)

THE MATRIX PROBLEM

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8900 Accepted Submission(s): 2290

Problem Description

You have been given a matrix C _N*M, each element E of C _N*M is positive and no more than 1000, The problem is that if there exist N numbers a1, a2, … an and M numbers b1, b2, …, bm, which satisfies that each elements in row-i multiplied with ai and each elements in column-j divided by bj, after this operation every element in this matrix is between L and U, L indicates the lowerbound and U indicates the upperbound of these elements.

Input

There are several test cases. You should process to the end of file.
Each case includes two parts, in part 1, there are four integers in one line, N,M,L,U, indicating the matrix has N rows and M columns, L is the lowerbound and U is the upperbound (1<=N、M<=400,1<=L<=U<=10000). In part 2, there are N lines, each line includes M integers, and they are the elements of the matrix.

Output

If there is a solution print "YES", else print "NO".

Sample Input

       3 3 1 62 3 48 2 65 2 9 
     

Sample Output

YES

Source

2010 Asia Regional Harbin

Recommend

lcy | We have carefully selected several similar problems for you: 3665 3669 3667 3664 3663

Statistic | Submit | Discuss | Note

#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int n,m;
double l,u;
int num;
#define f(i,n) for(i=1;i<=n;i++)
const int N=1e4;

int vis[N],head[N];
double dis[N];
struct AA{
	int v,next;
	double w;
}edge[N*N];


void add(int u,int v,double w){
	edge[num].v=v;
	edge[num].next=head[u];
	edge[num].w=w;
	head[u]=num++;
}

int spfa(int u){
	vis[u]=1;
	for(int h=head[u];h;h=edge[h].next){
		int v=edge[h].v;
		if(dis[v]>dis[u]+edge[h].w){
			dis[v]=dis[u]+edge[h].w;
			if(vis[v])return v;
			int ret=spfa(v);
			if(ret!=-1)return ret;
		}
	}
	vis[u]=0;
	return -1;
}

int solve(){
	memset(vis,0,sizeof(vis));
	memset(dis,0,sizeof(dis));
	int i;
	f(i,n+m){
		int ret=spfa(i);
		if(ret!=-1)return ret;
	}
	return -1;
}

int main(){
	while(~scanf("%d%d%lf%lf",&n,&m,&l,&u)){
		num=0;
		memset(head,0,sizeof(head));
		int i,j;
		f(i,n)f(j,m){
			double a;
			scanf("%lf",&a);
			add(j+n,i,log(u/a));
			add(i,j+n,log(a/l));
		}
		if(solve()==-1)puts("YES");
		else puts("NO");
	}
}