P4779 【模板】单源最短路径（标准版）（ dijkstra ）

题目链接：点击进入

题目

思路

dijkstra

代码

// Problem: P4779 【模板】单源最短路径（标准版）
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P4779
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define base 233 
#define pb push_back
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
    int k = 0, f = 1 ;
    char c = getchar() ;
    while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
    while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
    return k * f ;
}
/*--------------------------------------------*/

int n,m,s;
int head[maxn],tot,dis[maxn];
bool vis[maxn];
struct node
{
	int to;
	int w;
	int next;
}edge[maxn];

void init()
{
	memset(head,-1,sizeof(head));
	for(int i=0;i<=1e5;i++)
		dis[i]=inf;
	tot=0;
}

void add(int u,int v,int w)
{
	edge[tot].to=v;
	edge[tot].w=w;
	edge[tot].next=head[u];
	head[u]=tot++;
}

void dijkstra()
{
	priority_queue<pii,vector<pii>,greater<pii>>q;
	dis[s]=0;
	q.push({dis[s],s});
	while(q.size())
	{
		int now=q.top().second;
		q.pop();
		if(vis[now]) continue;
		vis[now]=1;
		for(int i=head[now];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			if(dis[v]>dis[now]+edge[i].w)
			{
				dis[v]=dis[now]+edge[i].w;
				q.push({dis[v],v});
			}
		}
	}
}

int main() 
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);cout.tie(0);
	init();
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++)
	{
		int x,y,w;
		cin>>x>>y>>w;
		add(x,y,w);
	}
	dijkstra();
	for(int i=1;i<=n;i++)
		cout<<dis[i]<<' ';
    return 0;
}