HDU 3666 差分约束

题目链接

题意：给一个数字矩阵以及一对数字L，U。求是否存在一对数组a1...,an和b1,...,bm，使得矩阵内如何一个数字xij*(ai/bj)在L，U范围之内。是则输出YES，反之输出NO。

思路：对于式子L<=xij*(ai/bj)<=R，两边同时取对数后式子变为log(L)<=log(xij)+log(ai)-log(bj)<=log(R)，然后发现式子就产生了两个可以进行差分约束不等式log(ai)-log(bj)<=log(R)-log(xij),log(ai)-log(bj)>=log(L)-log(xij)，最后建图判环求解即可。至于为什么要进行对数操作，是因为进行对数操作后乘除变为了加减，之后就产生了差分约束不等式。另外此题比较坑爹需要将判环条件从>(n+m)缩小到>sqrt(n+m)不然的话就会超时。

C++代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const int maxm = 500010;
const int inf  = 0x3f3f3f3f;

int n,m; double l,u;
int tol,head[maxn];
struct edge
{
    int to,next;
    double cost;
}es[maxm];

void init()
{
    tol = 0; memset ( head , -1 , sizeof(head) );
}

void addedge( int u , int v , double w )
{
    es[tol].to = v;
    es[tol].cost = w;
    es[tol].next = head[u];
    head[u] = tol++;
}

double dis[maxn];
int vis[maxn];
int cnt[maxn];

bool spfa()
{
    memset ( vis , 0 , sizeof(vis) );
    memset ( cnt , 0 , sizeof(cnt) );
    for ( int i=1 ; i<=n+m ; i++ ) dis[i] = inf;
    queue<int>Q;
    Q.push(1);
    dis[1] = 0;
    vis[1] = 1;
    cnt[1] = 1;
    int nm = sqrt( 1.0*(n+m) );
    while ( !Q.empty() )
    {
        int u = Q.front();
        Q.pop();
        vis[u] = 0;
        for ( int i=head[u] ; i!=-1 ; i=es[i].next )
        {
            int v = es[i].to; double w = es[i].cost;
            if ( dis[v]>dis[u]+w )
            {
                dis[v] = dis[u]+w;
                if ( !vis[v] )
                {
                    vis[v] = 1;
                    Q.push(v);
                    cnt[v] ++;
                    if ( cnt[v]>nm ) return false;
                }
            }
        }
    }
    return true;
}

int main()
{
	while ( scanf ( "%d%d%lf%lf" , &n , &m , &l , &u )==4 )
    {
        init();
        l = log(l);
        u = log(u);
        for ( int i=1 ; i<=n ; i++ )
            for ( int j=1 ; j<=m ; j++ )
            {
                double x; scanf( "%lf" , &x );
                x = log(x);
                addedge( n+j , i , u-x );
                addedge( i , n+j , x-l );
            }
        if ( spfa() )
            printf ( "YES\n" );
        else
            printf ( "NO\n" );
    }
	return 0;
}