【差分约束系统】【仍未AC】【Asia - Harbin - 2010/2011】【THE MATRIX PROBLEM】

【题目描述】You have been given a matrix C_{N x M}, each element E of C_{N x M} is positive  and no more than 1000, The problem is that if there exist N numbers a₁, a₂,..., a_N and M numbers b₁, b₂,..., b_M, which satisfies that each  elements in row-i multiplied with a_i and each elements in  column-j divided by b_j, 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 (1N, M400, 1LU10000). 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 6 
2 3 4 
8 2 6 
5 2 9

 

Sample Output

YES


【中文大意】给定一个矩阵，要求经过如下操作，使得每个元素在[L,U]这个范围内：第i行所有元素乘以ai，第j列所有元素除以bj。
如果存在满足这样条件的a1,a2,...,an；b1,b2,...,bn。则输出YES，否则输出NO

【个人体会】至今仍未AC，但是后来看了题解，算法是正确的，所以懒得调了。。。。TOT 经历了几个
小时的TLE+WA+RE，我无力了。。。

【题目解析】乘法除法可以用ln进行转换成加减法，对于第Aij个元素，需要满足限制条件ln(L)<=ln
（Aij）+ln(ai)-ln(bj)<=ln(U)，将ai和bj看成点，建立边。判断是否存在负权回路，若存在输出
NO，不存在输出YES。

【代码】虽然没有AC，但还是贴出来。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <deque>

#define FILE_IO

using namespace std;

const int Maxn = 1000;
const double INF = 1e9;

struct edge
{
    int v; double c;
    edge* next;
    edge(int _v, double _c, edge* _next) : v(_v), c(_c), next(_next) {}
}* E[Maxn];

bool hash[Maxn];
int N, M, Lim, Count[Maxn];
double L, U;
vector <double> Dist;
deque <int> Q;

void Clear()
{
    Q.clear();
    for (int i = 0; i <= Lim; i ++) { E[i] = NULL; Count[i] = 0; }
    memset(hash, 0, sizeof(hash));
}

bool SPFA()
{
    Dist.assign(Lim + 1, 0);
    for (int i = 1; i <= Lim; i ++) { Q.push_back(i); hash[i] = true; }
    while (Q.size())
    {
        int i = Q.front(); Q.pop_front(); hash[i] = false;
        for (edge* j = E[i]; j; j = j -> next)
        {
            int v = j -> v;
            if (Dist[i] + j -> c < Dist[v])
            {
                Dist[v] = Dist[i] + j -> c;
                if (!hash[v])
                {
                    hash[v] = true;
                    Count[v] ++;
                    if (Count[v] > Lim) return false;
                    Q.push_back(v);
                }
            }
        }
    }
    return true;
}

inline void edgeAdd(int x, int y, double c)
{
    E[x] = new edge(y, c, E[x]);
}

void Init()
{
    Lim = N + M;
    scanf("%lf%lf", &L, &U); L = log(L); U = log(U);
    for (int i = 1; i <= N; i ++)
        for (int j = 1; j <= M; j ++)
        {
            double c; scanf("%lf", &c);
            c = log(c);
            edgeAdd(N + j, i, U - c);
            edgeAdd(i, N + j, c - L);
        }
}

int main()
{
    #ifdef FILE_IO
    //freopen("test.in", "r", stdin);
    #endif // FILE_IO
    while (scanf("%d%d", &N, &M) != EOF)
    {
        Init();
        if (SPFA()) printf("YES\n");
        else printf("NO\n");
        Clear();
    }
    return 0;