UVa 10986 - Sending email

題目：發送郵件，求最短路徑。

分析：圖論，最短路。直接利用dijkstra算法+優先隊列優化。

說明：spfa+stack超時了╮(╯▽╰)╭。

#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cstdio>

using namespace std;

//banery_heap
int heap_keys[20002];
int heap_base[20002];
int heap_in_h[20002];
int heap_size;

void heap_ini()
{
	heap_size = 0;
	memset(heap_keys, 0, sizeof(heap_keys));
	memset(heap_base, 0, sizeof(heap_base));
	memset(heap_in_h, 0, sizeof(heap_in_h));
}

void heap_insert(int ID, int Key)
{
	if (!heap_in_h[ID]) {
		heap_in_h[ID] = ++ heap_size;
		heap_base[heap_size] = ID;
	}
	heap_keys[heap_in_h[ID]] = Key;
	int now = heap_in_h[ID];
	while (now > 1 && heap_keys[now] < heap_keys[now>>1]) {
		swap(heap_base[now], heap_base[now>>1]);
		swap(heap_keys[now], heap_keys[now>>1]);
		swap(heap_in_h[heap_base[now]], heap_in_h[heap_base[now>>1]]);
		now = now>>1;
	}
}

int heap_delete()
{
	swap(heap_base[heap_size], heap_base[1]);
	swap(heap_keys[heap_size], heap_keys[1]);
	swap(heap_in_h[heap_base[heap_size]], heap_in_h[heap_base[1]]);
	int now = 1;
	while (1) {
		int New = now, L = (now<<1), R = (now<<1)+1;
		if (L < heap_size && heap_keys[L] < heap_keys[New]) New = L;
		if (R < heap_size && heap_keys[R] < heap_keys[New]) New = R;
		if (now == New ) break;
		swap(heap_base[now], heap_base[New]);
		swap(heap_keys[now], heap_keys[New]);
		swap(heap_in_h[heap_base[now]], heap_in_h[heap_base[New]]);
		now = New;
	}
	return heap_base[heap_size --];
}
//banery_heap end

//link_list
typedef struct _link_list
{
	int point;
	int path;
	_link_list *next;
}link_list;

link_list *link_head[20002];
link_list  link_node[100001];
int link_size;

void link_ini()
{
	link_size = 0;
	memset(link_head, 0, sizeof(link_head));
}

void link_add(int s, int t, int p)
{
	link_node[link_size].point = t;
	link_node[link_size].path = p;
	link_node[link_size].next = link_head[s];
	link_head[s] = &link_node[link_size ++];
}
//link_list end

int  dist[20002];
int  stack[20002];
int  visit[20002];
void dijkstra(int n, int s, int t)
{
	int oo = 1000000000;
	for (int i = 0; i < n; ++ i) {
		dist[i] = oo;
		visit[i] = 0;
	}
	
	dist[s] = 0;
	heap_insert(s, 0);
	visit[s] = 1;
	
	while (heap_size > 0) {
		int now = heap_delete();
		for (link_list *p = link_head[now]; p; p = p->next) {
			if (dist[p->point] > dist[now] + p->path) {
				visit[p->point] = 1;
				dist[p->point] = dist[now] + p->path;
				heap_insert(p->point, dist[p->point]);
			}
		}
	}
	
	if (dist[t] == oo)
		printf("unreachable\n");
	else printf("%d\n",dist[t]);
}

int main()
{
	int c,s,t,n,m,u,v,p;
	while (~scanf("%d",&c)) 
	for (int k = 1; k <= c; ++ k) {
		scanf("%d%d%d%d",&n,&m,&s,&t);
		link_ini();
		heap_ini();
		for (int i = 0; i < m; ++ i) {
			scanf("%d%d%d",&v,&u,&p);
			link_add(u, v, p);
			link_add(v, u, p);
		}
		
		printf("Case #%d: ",k);
		dijkstra(n, s, t);
	}
    return 0;
}