HDU 2586 Dijkstra 算法 + 堆优化

How far away ？

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23772    Accepted Submission(s): 9465

 

Problem Description

There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house B"? Usually it hard to answer. But luckily int this village the answer is always unique, since the roads are built in the way that there is a unique simple path("simple" means you can't visit a place twice) between every two houses. Yout task is to answer all these curious people.

 

 

Input

First line is a single integer T(T<=10), indicating the number of test cases.
  For each test case,in the first line there are two numbers n(2<=n<=40000) and m (1<=m<=200),the number of houses and the number of queries. The following n-1 lines each consisting three numbers i,j,k, separated bu a single space, meaning that there is a road connecting house i and house j,with length k(0<k<=40000).The houses are labeled from 1 to n.
  Next m lines each has distinct integers i and j, you areato answer the distance between house i and house j.

 

 

Output

For each test case,output m lines. Each line represents the answer of the query. Output a bland line after each test case.

 

 

Sample Input

2

3 2

1 2 10

3 1 15

1 2

2 3

2 2

1 2 100

1 2

2 1

 

 

Sample Output

10

25

100

100

 

使用优先队列优化，复杂度 O (E log E)

 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
using namespace std;
/*
* 使用优先队列优化 Dijkstra 算法
* 复杂度 O(ElogE)
* 注意对 vector<Edge>E[MAXN] 进行初始化后加边
*/
const int INF=0x3f3f3f3f;
const int MAXN=50010;
struct qnode {
	int v;
	int c;
	qnode(int _v=0,int _c=0):v(_v),c(_c) {}
	bool operator <(const qnode &r)const {
		return c>r.c;
	}
};
struct Edge {
	int v,cost;
	Edge(int _v=0,int _cost=0):v(_v),cost(_cost) {}
};
vector<Edge>E[MAXN];
bool vis[MAXN];
int dist[MAXN],n;
//点的编号从 1 开始
void Dijkstra(int n,int start) {
	memset(vis,false,sizeof(vis));
	for(int i=1; i<=n; i++)dist[i]=INF;
	priority_queue<qnode>que;
	while(!que.empty())que.pop();
	dist[start]=0;
	que.push(qnode(start,0));
	qnode tmp;
	while(!que.empty()) {
		tmp=que.top();
		que.pop();
		int u=tmp.v;
		if(vis[u])continue;
		vis[u]=true;
		for(int i=0; i<E[u].size(); i++) {
			int v=E[tmp.v][i].v;
			int cost=E[u][i].cost;
			if(!vis[v]&&dist[v]>dist[u]+cost) {
				dist[v]=dist[u]+cost;
				que.push(qnode(v,dist[v]));
			}
		}
	}
}
void addedge(int u,int v,int w) {
	E[u].push_back(Edge(v,w));
}
void init(){
    for(int i=0;i<=MAXN;i++){
       E[i].clear();
    }
}
int main(){
    int t,m;
    scanf("%d",&t);
    while(t--){
        init();
        scanf("%d %d",&n,&m);
        int u,v,w;
        for(int i=0;i<n-1;i++){
            scanf("%d %d %d",&u,&v,&w);
            addedge(u,v,w);
            addedge(v,u,w);
        }
        for(int i=0;i<m;i++){
            scanf("%d %d",&u,&v);
            Dijkstra(n,u);
            printf("%d\n",dist[v]);
        }
    }



    return 0;
}