hdoj 2962 Trucking

类型：最短路 + 二分答案

题目：http://acm.hdu.edu.cn/showproblem.php?pid=2962

来源：2008 Rocky Mountain Regional

思路：二分枚举容量限制ans，在该限制下求最短路，如果无路径，说明ans偏大，否则偏小。当ans不足一时，原图无解

！！！最后重新计算以免除精度问题，如：ans = 7， 当ans = 7.000005时，无最短路

// hdoj 2962 Trucking
// ac 265MS	588K
#include <iostream>
#include <sstream>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <set>
#include <deque>
#include <bitset>
#include <functional>
#include <utility>
#include <iomanip>
#include <cctype>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(i = (a); i > (b); --i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
#define CLR(a,b) memset(a,b,sizeof(a))

const int MAXN = 1010;
const int MAXM = 1000000;
const int hash_size = 25000002;
const int INF = 0x7f7f7f7f;
const double EPS = 1e-8;

bool vis[MAXN];
int n, m, cnt, max_w1, st, en, ww, cas = 1;
int head[MAXN], dist[MAXN];
struct node {
    int v, nxt, w1, w2;
}p[MAXM];

void addedge(int u, int v, int w1, int w2) {
    p[cnt].v = v;
    p[cnt].w1 = w1;
    p[cnt].w2 = w2;
    p[cnt].nxt = head[u];
    head[u] = cnt++;
    p[cnt].v = u;
    p[cnt].w1 = w1;
    p[cnt].w2 = w2;
    p[cnt].nxt = head[v];
    head[v] = cnt++;
}

bool spfa(double mid) {
    int i;

    fill(dist, dist + 1 + n, INF);
    CLR(vis, false);
    dist[0] = 0;
    queue<int> q;
    q.push(0);
    vis[0] = true;
    while(!q.empty()) {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(i = head[u]; i != -1; i = p[i].nxt) {
            int v = p[i].v;
            if(p[i].w1 > mid && p[i].w2 + dist[u] < dist[v]) {
                dist[v] = p[i].w2 + dist[u];
                if(!vis[v]) {
                    q.push(v);
                    vis[v] = true;
                }
            }
        }
    }
    if(dist[en] == INF)
        return false;
    return true;
}

int main() {
    int u, v, w1, w2, i;

    while(scanf("%d %d", &n, &m) == 2, n || m) {
        CLR(head, -1);
        cnt = 0;
        max_w1 = -INF;
        FOR(i, 0, m) {
            scanf("%d %d %d %d", &u, &v, &w1, &w2);
            if(w1 != -1)
                max_w1 = max(max_w1, w1);
            else
                w1 = INF;
            addedge(u, v, w1, w2);
        }
        scanf("%d %d %d", &st, &en, &ww);
        if(ww != -1)
            max_w1 = max(max_w1, ww);
        else
            ww = INF;
        addedge(0, st, ww, 0);
        double mid;
        double l = 0, r = max_w1;
        if(cas > 1)
            printf("\n");
        printf("Case %d:\n", cas++);
        while(r - l > EPS) {
            mid = (r + l) / 2.0;
            if(spfa(mid))
                l = mid;
            else
                r = mid;
        }
        if(l < 0.5)
            printf("cannot reach destination\n");
        else {
            //!!!
            spfa(mid - 0.5);
            printf("maximum height = %d\n", (int)(mid + 0.5));
            printf("length of shortest route = %d\n", dist[en]);
        }
    }
    return 0;
}