使用优先队列+邻接表的Dijkstra算法

Problem 17

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  LightOJ 1019

Description

Tanvir returned home from the contest and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming contest? After checking a bit he found that there is no brush in him room. So, he called Atiq to get a brush. But as usual Atiq refused to come. So, Tanvir decided to go to Atiq's house.

The city they live in is divided by some junctions. The junctions are connected by two way roads. They live in different junctions. And they can go to one junction to other by using the roads only.

Now you are given the map of the city and the distances of the roads. You have to find the minimum distance Tanvir has to travel to reach Atiq's house.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a blank line. The next line contains two integers N (2 ≤ N ≤ 100) and M (0 ≤ M ≤ 1000), means that there are N junctions and M two way roads. Each of the next M lines will contain three integers u v w (1 ≤ u, v ≤ N, w ≤ 1000), it means that there is a road between junction u and v and the distance is w. You can assume that Tanvir lives in the 1^st junction and Atiq lives in the N^th junction. There can be multiple roads between same pair of junctions.

Output

For each case print the case number and the minimum distance Tanvir has to travel to reach Atiq's house. If it's impossible, then print 'Impossible'.

Sample Input

2

 

3 2

1 2 50

2 3 10

 

3 1

1 2 40

Sample Output

Case 1: 60

Case 2: Impossible

#include
#include
#include
#include
#include
#include
#include
#define INF 1000005
#define MAXN 2010
using namespace std;
typedef pairpii;//捆绑编号跟dis[i]的值
int v[MAXN];
int w[MAXN];
int next[MAXN];
int head[MAXN];
int dis[110];
int n,m;

void Dijkstra()
{
	priority_queue,greater >q;//最小值优先出队
	for(int i=1; i<=n; i++) dis[i]=INF;
	dis[1]=0;
	q.push(make_pair(dis[1], 1));
	while(!q.empty())
	{
		pii u=q.top();
		q.pop();
		int x=u.second;
		if(u.first!=dis[x]) continue;
		for(int i=head[x]; i!=-1; i=next[i]){
			if(dis[x] + w[i] < dis[v[i]]){
				dis[v[i]] = dis[x] + w[i];
				q.push(make_pair(dis[v[i]], v[i]));
			}
		}
	}
}

int main()
{
#if 0
	freopen("in.txt","r",stdin);
#endif
	int T,t=0;
	scanf("%d", &T);
	while(T--)
	{
		int size=0;
		printf("Case %d: ", ++t);
		memset(head,-1,sizeof(head));
		scanf("%d%d", &n,&m);
		while(m--)
		{
			int a,b,c;
			scanf("%d%d%d", &a,&b,&c);
			v[size]=b;
			w[size]=c;
			next[size]=head[a];
			head[a]=size++;
			v[size]=a;//因为是无向图，故两边都要弄
			w[size]=c;
			next[size]=head[b];
			head[b]=size++;
		}
		Dijkstra();
		if(dis[n]!=INF) printf("%d\n", dis[n]);
		else printf("Impossible\n");
	}
	return 0;
}