toj 2741 Hotel booking (spfa+bfs+巧妙构图)

最新推荐文章于 2020-02-09 11:05:18 发布

UCLoveLikeTheWind

最新推荐文章于 2020-02-09 11:05:18 发布

阅读量268

点赞数

分类专栏：算法题文章标签： spfa floyd

本文链接：https://blog.csdn.net/UCLoveLikeTheWind/article/details/89162643

版权

算法题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Description

A transport company often needs to deliver goods from one city to another city. The transport company has made a special deal with a hotel chain which allows its drivers to stay in the hotels of this chain for free. Drivers are only allowed to drive up to 10 hours a day. The transport company wants to find a route from the starting city to the destination city such that a driver can always spend the night in one of the hotels of the hotel chain, and that he needs to drive at most 10 hours from one hotel to the next hotel (or the destination). Of course, the number of days needed to deliver the goods should also be minimized.

Input

The input file contains several test cases. Each test case starts with a line containing an integer n, (2 ≤ n ≤ 10000), the number of cities to be considered when planning the route. For simplicity, cities are numbered from 1 to n, where 1 is the starting city, and n is the destination city. The next line contains an integer h followed by the numbers c1, c2, ..., ch indicating the numbers of the cities where hotels of the hotel chain are located. You may assume that 0 ≤ h ≤ min(n, 100). The third line of each test case contains an integer m (1 ≤ m ≤ 105), the number of roads to be considered for planning the route. The following m lines describe the roads. Each road is described by a line containing 3 integers a, b, t (1 ≤ a, b ≤ n and 1 ≤ t ≤ 600), where a, b are the two cities connected by the road, and t is the time in minutes needed by the driver to drive from one end of the road to the other. Input is terminated by n = 0.

Output

For each test case, print one line containing the minimum number of hotels the transport company has to book for a delivery from city 1 to city n. If it is impossible to find a route such that the driver has to drive at most 10 hours per day, print -1 instead.

Sample Input

6
3 2 5 3
8
1 2 400
3 2 80
3 4 301
4 5 290
5 6 139
1 3 375
2 5 462
4 6 300
3
0
2
1 2 371
2 3 230
0

Sample Output

2
-1

思路

这道题的意思是给你n个点，1为起点，n为终点（n<=10000），两者之间有n-2个点，并且其中有m个旅馆，你是个司机，并且每次行驶只能持续600分钟，你可以选择在行驶600分钟之内时到一个旅馆休息。问你是否可以到达终点，如何可以，最少需要再几间旅馆住下。

很明显的可以转化过来，这是一个m+2个点之间的问题，一个起点，一个终点，以及m个旅馆。然后再重新构建一遍，判断两点之间的最短时间，因为时间复杂度的关系，所以这里要用spfa来求两点之间的最短距离是否满足要求，能否再600分钟以内，再重现建立一个都可以连通的图。最后bfs一遍，判断最少可以通过几个点到达终点。

#include <iostream>
#include <vector>
#include <queue>
#include <map> 
#include <cstring>
using namespace std;
typedef struct Node{
	int p,s;
};
const int N = 1e4+5; 
const int INF = 0x3f3f3f3f;
vector<Node> vec[N];//存边 
map<int,int> ma;//映射旅馆 
int hotel[105];
int t,n,k;
vector<int> G[105];
void spfa(int kk){
	int dis[N],i,j;
	bool vis[N];
	memset(vis,false,sizeof(vis));
    memset(dis,INF,sizeof(dis));
    dis[kk]=0;
    queue<int> que;
    que.push(kk);
    while(!que.empty())
    {
        int u=que.front();
        que.pop();
        vis[u]=0;
        for(i=0;i<vec[u].size();i++)
        {
             Node node=vec[u][i];
             int v=node.p;
             if(dis[v]>dis[u]+node.s)
             {
                dis[v]=dis[u]+node.s;
                if(!vis[v])
                {
                    vis[v]=true;
                    que.push(v);
                }
            }
		}
    }
    if(dis[1]<=600&&kk!=1){
		G[ma[kk]].push_back(ma[1]);
	}
	for(int i=2;i<=t;i++){
		if(dis[i]<=600&&i!=kk&&ma[i]!=0){
			G[ma[kk]].push_back(ma[i]);
		}
	}
}
void bfs(){
	int dis[105];
	for(int i=0;i<105;i++)
		dis[i]=-1;
	queue<int> que;
	que.push(ma[1]);
	while(!que.empty()){
		int u=que.front();
		que.pop();
		for(int i=0;i<G[u].size();i++){
			if(dis[G[u][i]]==-1){
				dis[G[u][i]]=dis[u]+1;
				que.push(G[u][i]);
			}
		}
	}
	cout<<dis[ma[t]]<<endl;	
}
int main() {
	ios::sync_with_stdio(false);
	int i,j,x,y,z;
	while(cin>>t){
		if(t==0)
			break;
		for(i=0;i<N;i++){
			vec[i].clear();
			ma[i]=0;
		} 
		memset(G,0,sizeof(G));
		cin>>k;//旅馆数 
		for(i=1;i<=k;i++){ 
			cin>>hotel[i];
			ma[hotel[i]]=i;
		}
			
		cin>>n;//边数 
		for(i=0;i<n;i++){
			cin>>x>>y>>z;
			Node node1,node2;
			node1.p=y,node1.s=z;
			node2.p=x,node2.s=z;
			vec[x].push_back(node1);
			vec[y].push_back(node2); 
		} 
		ma[1]=0;
		ma[t]=k+1;
		hotel[0]=1;
		hotel[k+1]=t; 
		memset(G,INF,sizeof(G));
		for(i=0;i<=k+1;i++){//以旅馆为节点重新建图。 
			spfa(hotel[i]);
		}
		bfs();
	}
	return 0;
}