[dij堆优化/spfa板子] 洛谷P3371

题目

题目链接：https://www.luogu.com.cn/problem/P3371

代码

dij:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
	int to,val,next;
}edge[500010]; 
int head[500010],tot=0;
void add_edge(int u,int v,int w){
	edge[++tot].to=v;
	edge[tot].val=w;
	edge[tot].next=head[u];
	head[u]=tot;
}
bool vis[500010];
int dir[500010];int n,m,s;
void dij(int n1){
	for(int i=1;i<=m;i++) {
		dir[i]=(1<<31)-1;
		vis[i]=0;}
	priority_queue<pair<int,int>> q;
	dir[n1]=0;
	q.push(make_pair(-dir[n1],n1));
	while(!q.empty()){
		int u=q.top().second;
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(int i=head[u];i;i=edge[i].next){
			int v=edge[i].to;
			if(!vis[v]&&dir[v]>dir[u]+edge[i].val){
				dir[v]=dir[u]+edge[i].val;
				q.push(make_pair(-dir[v],v));
			}
		}
	}
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		add_edge(u,v,w);
	//	add_edge(v,u,w);
	}
	dij(s);
	for(int i=1;i<=n;i++){
		cout<<dir[i]<<" \n"[i==n];
	}
    return 0;
}

spfa:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
	int to,val,next;
}edge[500010]; 
int head[500010],tot=0;
void add_edge(int u,int v,int w){
	edge[++tot].to=v;
	edge[tot].val=w;
	edge[tot].next=head[u];
	head[u]=tot;
}
int dir[500010];int n,m,s;
bool vis[500010];
void spfa(int n1){
	for(int i=1;i<=n;i++){
		vis[i]=0;
		dir[i]=(1<<31)-1;
	}
	queue<int> q;
	q.push(n1);
	vis[n1]=1;
	dir[n1]=0;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=head[u];i;i=edge[i].next){
			int v=edge[i].to;
			int d=edge[i].val;
			if(dir[v]>dir[u]+d){
				dir[v]=dir[u]+d;
				if(!vis[v]){
					vis[v]=1;
					q.push(v);
				}
			}
		}
	}
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		add_edge(u,v,w);
	//	add_edge(v,u,w);
	}
	spfa(s);
	for(int i=1;i<=n;i++){
		cout<<dir[i]<<" \n"[i==n];
	}
    return 0;
}

dij spfa 思路区别就不说了，代码上主要的区别是队列里存的东西，还有vis