HDU5521最短路径

Meeting

2
5 4
1 3 1 2 3
2 2 3 4
10 2 1 5
3 3 3 4 5
3 1
1 2 1 2

Case #1: 3
3 4
Case #2: Evil John
Hint
In the first case, it will take Bessie 1 minute travelling to the 3rd block, and it will take Elsie 3 minutes travelling to the 3rd block. It will take Bessie 3 minutes travelling to the 4th block, and it will take Elsie 3 minutes travelling to the 4th block. In the second case, it is impossible for them to meet.

分析：读完题后，发现这是个图论，更具体一点是最短路径。但这是个最短路径的变形，需要从两个点都进行一遍求最短路径，将时间保存在两个数组中，然后处理数组。

最短路径使用Dijkstra来求，要结合优先级队列来求，因为点的数目太多。

代码：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define N 100005
#define INF 1e15
typedef long long ll;
vector<int> E[N];//区域包含的结点 
vector<int> V[N];//结点所属区域 
ll S[N];//结点内时间 
ll dis1[N], dis2[N];
bool viss[N];//区域是否松弛过 
bool vis[N];
int n, m;
struct node{
	int x;
	ll dis;
	bool operator <(const node &a)const{
		return a.dis < dis;
	}
};
priority_queue<node> Q;
void init(ll dis[]){
	if(!Q.empty())Q.pop();
	for(int i = 1; i <= n; i++)
		dis[i] = INF, vis[i] = false;
	for(int i = 0; i < n; i ++)
		vis[i] = false;
	for(int i = 0; i < m; i++)
		viss[i] = false;
}
void Dijkstra(int st, ll dis[]){
	init(dis);
	node p, q;
	p.x = st, p.dis = 0;
	Q.push(p);
	dis[st] = 0;
	while(!Q.empty()){
		p = Q.top();
		Q.pop();
		if(vis[p.x])continue;
		vis[p.x] = true;
		for(int i = 0; i < V[p.x].size(); i++){
			int e = V[p.x].at(i);
			if(viss[e])continue;
			viss[e] = true;
			for(int j = 0; j < E[e].size(); j++){
				int x = E[e].at(j);
				if(dis[x] > dis[p.x] + S[e]){
					dis[x] = dis[p.x] + S[e];
					q.x = x;
					q.dis = dis[x];
					Q.push(q);
				}
			}
		}
		
	}
}
void solve(){
	Dijkstra(1, dis1);
	Dijkstra(n, dis2);
	ll Min = INF;
	for(int i = 1; i <= n; i ++)
		Min = min(Min, max(dis1[i], dis2[i]));
	if(Min == INF)
		printf("Evil John\n");
	else{
		printf("%d\n", Min);
		int flag = 0;
		for(int i = 1; i <= n; i++){
			if(max(dis1[i], dis2[i]) == Min){
				if(flag)printf(" ");
				else flag = 1;
				printf("%d", i);
			}
		}
		printf("\n");
	}
}
int main(){
	int t, cas = 0;
	int cnt;
	cin>>t;
	while(t--){
		cin>>n>>m;
		for(int i = 1; i <= n; i++)V[i].clear();
		for(int i = 0; i < m; i ++){
			scanf("%d%d", &S[i], &cnt);
			E[i].clear();
			int x;
			for(int j = 0; j < cnt; j ++){
				scanf("%d", &x);
				E[i].push_back(x);
				V[x].push_back(i);
			}
		}
		printf("Case #%d: ", ++cas);
		solve();
	}
	return 0;
}