HDU 3666 (差分约束)

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

morejarphone

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

阅读量433

点赞数

分类专栏：最短路&&差分约束

本文链接：https://blog.csdn.net/morejarphone/article/details/51840049

版权

最短路&&差分约束专栏收录该内容

12 篇文章 0 订阅

订阅专栏

题目链接:点击这里

题意: 给出一个矩阵, 问是否存在两个序列 $a_1, a_2...a_n$ 和 $b_1,b_2...b_m$ 使得 $a_i\times c_{i,j}/b_j\in[L,U]$ .

整理一下条件就是要判断是否存在两个数列使得 $f (x) = {a i \times c i, j \leq U \times b j L \times b j \leq a i \times c i, j$ $f(x)=\left\{ \begin{aligned} a_i\times c_{i,j}\leq U\times b_j \\ L\times b_j \leq a_i\times c_{i, j} \end{aligned} \right.$

然后用log去乘号: $f (x) = {l o g (a i) - l o g (b j) \leq l o g (U / c i, j) l o g (b j) - l o g (a i) \leq l o g (c i, j / L)$ $f(x)=\left\{ \begin{aligned} log(a_i)-log(b_j)\leq log(U/c_{i,j})\\ log(b_j)-log(a_i)\leq log(c_{i,j}/L)\\ \end{aligned} \right.$

然后判断负环就好了. 如果判定条件是入队次数大于n会超时, 用另一种判断: $入队次数\geq \sqrt{n+m}$ .

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define INF 1e14
#define eps 1e-8
#define maxn 10005
#define maxm 1500000

int n, m;
double l, u;
double c[411][411];
struct node {
    int v, next;
    double w;
}edge[maxm];
int head[maxn], cnt;

double dcmp (double x) {
    if (fabs (x) <= eps) return 0;
    else return x < 0 ? -1 : 1;
}

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

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

bool vis[maxn];
int top, num[maxn];
double d[maxn];
bool spfa (int start, int n, int m) {
    memset (vis, 0, sizeof vis);
    for (int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    vis[start] = 1;
    d[start] = 0;
    queue <int> q;
    while (!q.empty ()) q.pop ();
    q.push (start);
    memset (num, 0, sizeof num);
    num[start] = 1;
    while (!q.empty ()) {
        int u = q.front (); q.pop ();
        vis[u] = 0;
        for (int i = head[u]; i != -1; i = edge[i].next) {
            int v = edge[i].v;
            if (d[v]>d[u]+edge[i].w) {
                d[v] = d[u]+edge[i].w;
                if (!vis[v]) {
                    vis[v] = 1;
                    q.push (v);
                    if (++num[v] > (int)sqrt ((1.0*n+m))/*n*/)
                        return 0;
                }
            }
        }
    }
    return 1;
}

int main () {
    while (scanf ("%d%d", &n, &m) == 2) {
        scanf ("%lf%lf", &l, &u);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                scanf ("%lf", &c[i][j]);
            }
        }
        init ();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                add_edge (i, n+j, log10 (u/c[i][j]));
                add_edge (n+j, i, log10 (c[i][j]/l));
            }
        }
        if (spfa (0, n+m, 2*(n+m)))
            printf ("YES\n");
        else
            printf ("NO\n");
    }
    return 0;
}