HDU-2962 Trucking 最短路

A certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transport as much goods as possible each trip. Unfortunately, one cannot always use the roads in the shortest route: some roads may have obstacles (e.g. bridge overpass, tunnels) which limit heights of the goods transported. Therefore, the company would like to transport as much as possible each trip, and then choose the shortest route that can be used to transport that amount.

For the given cargo truck, maximizing the height of the goods transported is equivalent to maximizing the amount of goods transported. For safety reasons, there is a certain height limit for the cargo truck which cannot be exceeded.

Input

The input consists of a number of cases. Each case starts with two integers, separated by a space, on a line. These two integers are the number of cities (C) and the number of roads (R). There are at most 1000 cities, numbered from 1. This is followed by R lines each containing the city numbers of the cities connected by that road, the maximum height allowed on that road, and the length of that road. The maximum height for each road is a positive integer, except that a height of -1 indicates that there is no height limit on that road. The length of each road is a positive integer at most 1000. Every road can be travelled in both directions, and there is at most one road connecting each distinct pair of cities. Finally, the last line of each case consists of the start and end city numbers, as well as the height limit (a positive integer) of the cargo truck. The input terminates when C = R = 0.

Output

For each case, print the case number followed by the maximum height of the cargo truck allowed and the length of the shortest route. Use the format as shown in the sample output. If it is not possible to reach the end city from the start city, print "cannot reach destination" after the case number. Print a blank line between the output of the cases.

Sample Input

5 6
1 2 7 5
1 3 4 2
2 4 -1 10
2 5 2 4
3 4 10 1
4 5 8 5
1 5 10
5 6
1 2 7 5
1 3 4 2
2 4 -1 10
2 5 2 4
3 4 10 1
4 5 8 5
1 5 4
3 1
1 2 -1 100
1 3 10
0 0

 多加了高度要素的最短路。邻接表+spfa

#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
#define maxn 1010
#define INF 0x3f3f3f3f
struct node
{
	int from,to,next,w,h;
}e[maxn*maxn];
int head[maxn],cnt=0,n,m;
int dis[maxn];
void add(int a,int b,int w,int h)
{
	e[cnt].from=a;
	e[cnt].to=b;
	e[cnt].w=w;
	e[cnt].h=h;
	e[cnt].next=head[a];
	head[a]=cnt++;
}
void spfa(int s,int limit)
{
	int vis[maxn];
	queue<int>q;
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=n;i++)
	{
		dis[i]=INF;
	}
	dis[s]=0;
	vis[s]=1;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=head[u];i!=-1;i=e[i].next)
		{
			if(e[i].h<limit)continue;
			int v=e[i].to;
			if(dis[v]>dis[u]+e[i].w)
			{
				dis[v]=dis[u]+e[i].w;
				if(!vis[v])
				{
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
}
int main()
{
	int cas=1;
	cin.tie(0);
	ios::sync_with_stdio(false);
	while(cin>>n>>m)
	{
		if(n*m==0)break;
		cnt=0;
		if(cas>1)printf("\n");
		memset(head,-1,sizeof(head));
		for(int i=0;i<m;i++)
		{
			int a,b,h,w;
			cin>>a>>b>>h>>w;
			if(h==-1)h=INF;
			add(a,b,w,h);
			add(b,a,w,h);
		}
		int start,end,limit;
		cin>>start>>end>>limit;
		int l=0,r=limit,mid,ans=INF;
		while(l<=r)
		{
			mid=(l+r)/2;
			spfa(start,mid);
			if(dis[end]!=INF)
			{
				l=mid+1;
				ans=dis[end];
			}
			else r=mid-1;
		}
		printf("Case %d:\n",cas++);
        if(ans != INF)
        {
            printf("maximum height = %d\n",r);
            printf("length of shortest route = %d\n",ans);
        }
        else
            printf("cannot reach destination\n");
    }
	return 0;
}