HDU 1874 邻接表+堆优化

观察题目点和边的关系可知 这道题最好用邻接表来储存图
这道题也就是一道dijkstra 只不过起点和终点是自定义的

好了 直接贴代码

/*
观察本题点与边的关系得知 因该用邻接表储存
*/
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
typedef pair<int, int>PII;
const int N = 2000;
const int M = 1010;
int d[N], e[N], ne[N], h[N], idx, w[N];
bool st[N];
int n, m;
int s, t;
void add(int a, int b, int c)
{
	w[idx] = c;
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx;
	idx++;
}
int dijkstra()//a为起点 b为终点
{
	d[s] = 0;
	priority_queue<PII, vector<PII>, greater<PII> >heap;
	while (heap.size())
		heap.pop();

	heap.push({ 0,s });
	while (heap.size())
	{
		auto t = heap.top();
		heap.pop();
		int ver = t.second, distance = t.first;
		if (st[ver])continue;
		st[ver] = true;
		for (int i = h[ver]; i != -1; i = ne[i])
		{
			int j = e[i];
			if (d[j] > distance + w[i])
			{
				d[j] = distance + w[i];
				heap.push({ d[j],j });
			}
		}
	}
	if (d[t] == 0x3f3f3f3f)return -1;
	else return d[t];
}
int main()
{
	ios::sync_with_stdio(false);
	while (cin >> n >> m)
	{
		idx = 0;
		for (int i = 0; i < N; i++)st[i] = false;
		memset(d, 0x3f, sizeof d);
		memset(e, 0, sizeof e);
		memset(ne, 0, sizeof ne);
		memset(h, -1, sizeof h);
		for (int i = 0; i < m; i++)
		{
			int a, b, c;
			cin >> a >> b >> c;
			add(a, b, c);//无向图
			add(b, a, c);
		}

		cin >> s >> t;
		//返回起点s到终点t的距离
		cout << dijkstra() << endl;
	}


}