CodeForces - 545E Paths and Trees （最短路径树模板）

题目链接：点击这里

题目大意：
给定一张带正权的无向图和一个源点，求边权和最小的最短路径树。
最短路径树是一颗满足所有点到源点的距离等于原图的最短路且总边权最小的生成树

题目分析：
考虑使用 $dijkstra$ 算法，要想构造一颗最短路径树只需要在当前最短路有多条扩展边可以选择时选择边权最小的那个，在最短路扩展边只有一条时就选择那条边

具体细节见代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define int ll
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 3e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
struct Edge {
	int nxt,to,val;
}edge[maxn<<1];
int n,m,head[maxn],cnt,dis[maxn],pre[maxn]; //id[i]表示扩展到i的边的编号 
bool vis[maxn];
void addedge(int from,int to,int val)
{
	edge[++cnt].nxt = head[from];
	edge[cnt].to = to;
	edge[cnt].val = val;
	head[from] = cnt;
}
void dijkstra(int u)
{
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>qu;
	memset(dis,inf,sizeof(dis));
	dis[u] = 0;
	qu.push(make_pair(0,u));
	while(!qu.empty())
	{
		int h = qu.top().second;
		qu.pop();
		if(vis[h]) continue;
		vis[h] = true;
		for(int i = head[h];i;i = edge[i].nxt)
		{
			int to = edge[i].to,val = edge[i].val;
			if(dis[to] == dis[h]+val && edge[pre[to]].val > val)
				pre[to] = i;
			if(dis[to] > dis[h]+val)
			{
				pre[to] = i;
				dis[to] = dis[h]+val;
				qu.push(make_pair(dis[to],to));
			}
		}
	}
}
vector<int>v;
signed main()
{
	n = read(),m = read();
	for(int i = 1;i <= m;i++)
	{
		int from = read(),to = read(),val = read();
		addedge(from,to,val);
		addedge(to,from,val);
	}
	int s = read();
	dijkstra(s);
	int sum = 0;
	for(int i = 1;i <= n;i++)
		sum += edge[pre[i]].val;
	printf("%lld\n",sum);
	for(int i = 1;i <= n;i++)
	{
		if(i == s) continue;
		v.push_back((pre[i]+1)>>1);
	}
	sort(v.begin(),v.end());
	for(auto num : v)
		printf("%lld ",num); 
	return 0;
}