HDU 2962 Trucking(Dijkstra+二分)

HDU 2962 Trucking(Dijkstra+二分)

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

题意:

        有一个n个节点m条边的无向图,现在一辆车要从指定的s点开到e点.但是车有一个货物的高度限制L,且每条路也有一个限制Li,(即车在该路上行驶的时候车货物的高度不能超过Li) 现在的问题是车的货物高度在<=L的前提下,最高是多少,还能使得车能从s点到e点.且要输出最短距离.

分析:

        直接二分高度,然后判断在当前高度的情况下(现在高度的路有一些可能就不能走了),是否存在s到e的路径.

AC代码:

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
#define INF 1e9
using namespace std;
const int maxn=1000;
struct Edge
{
    int from,to,dist,height;
    Edge(int f,int t,int d,int h):from(f),to(t),dist(d),height(h){}
};

struct HeapNode
{
    int d,u;
    HeapNode(int d,int u):d(d),u(u){}
    bool operator<(const HeapNode& rhs)const
    {
        return d>rhs.d;
    }
};

struct Dijkstra
{
    int n,m;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool done[maxn];
    int d[maxn];

    void init(int n)
    {
        this->n=n;
        for(int i=0;i<n;i++) G[i].clear();
        edges.clear();
    }

    void AddEdge(int from,int to,int dist,int height)
    {
        edges.push_back(Edge(from,to,dist,height));
        m = edges.size();
        G[from].push_back(m-1);
    }

    bool dijkstra(int s,int e,int limit)
    {
        priority_queue<HeapNode> Q;
        for(int i=0;i<n;i++) d[i]=INF;
        d[s]=0;
        Q.push(HeapNode(d[s],s));
        memset(done,0,sizeof(done));

        while(!Q.empty())
        {
            HeapNode x= Q.top(); Q.pop();
            int u=x.u;
            if(done[u]) continue;
            done[u]=true;

            for(int i=0;i<G[u].size();i++)
            {
                Edge &e=edges[G[u][i]];
                if(d[e.to] > d[u]+e.dist && e.height >=limit)
                {
                    d[e.to] = d[u]+e.dist;
                    Q.push(HeapNode(d[e.to],e.to));
                }
            }
        }
        return d[e]!=INF;
    }
}DJ;
int main()
{
    int n,m,kase=0;
    while(scanf("%d%d",&n,&m)==2)
    {
        if(n==0&&m==0) break;
        DJ.init(n);

        for(int i=0;i<m;i++)
        {
            int u,v,d,h;
            scanf("%d%d%d%d",&u,&v,&h,&d);
            u--,v--;
            if(h==-1) h=INF;
            DJ.AddEdge(u,v,d,h);
            DJ.AddEdge(v,u,d,h);
        }

        int s,e,limit;
        scanf("%d%d%d",&s,&e,&limit);
        s--,e--;

        if(kase>=1) printf("\n");
        printf("Case %d:\n",++kase);
        if(!DJ.dijkstra(s,e,0)) printf("cannot reach destination\n");
        else
        {
            int L=0,R=limit;
            while(R>L)
            {
                int mid = L+(R-L+1)/2;
                if(DJ.dijkstra(s,e,mid)) L=mid;
                else R=mid-1;
            }
            DJ.dijkstra(s,e,L); //不加这句话,就WA
            printf("maximum height = %d\nlength of shortest route = %d\n",L,DJ.d[e]);
        }
    }
    return 0;
}