洛谷P3371 SPFA P477 Dijkstra

P3371 SPFA:

#include<bits/stdc++.h>
#define inf 2e31-1
#define maxn 100000
using namespace std;
int n, m, s;
int dis[maxn], vis[maxn];
vector<pair<int, int> > e[maxn];
queue<int> q;

int main(){
	int v1, v2, w;
	cin>>n>>m>>s;
	
	for(int i=1; i<=m; i++){
		cin>>v1>>v2>>w;
		e[v1].push_back(make_pair(v2, w));
	}
	
	for(int i=0; i<=n; i++){
		dis[i] = inf;
	}
	
	q.push(s);
	vis[s] = 1;
	dis[s] = 0;
	
	while(q.size()){
		int t = q.front();
		q.pop();
		vis[t] = 0;
		for(int i=0; i<e[t].size(); i++){
			int v = e[t][i].first;
			if(dis[v]>dis[t] + e[t][i].second){
				dis[v] = dis[t] + e[t][i].second;
				if(vis[v])
					continue;
				vis[v]=1;
				q.push(v);
			}
		}
	}
	
	for(int i=1; i<=n; i++)
		cout<<dis[i]<<" ";
	
	return 0;
} 

P477 Dijkstra:

#include<bits/stdc++.h>
#define inf 2e31
#define ll long long 
#define maxn 101000
using namespace std;
ll n, m, s;
ll dis[maxn];

vector<pair<ll, ll> > e[maxn];
priority_queue<pair<ll, ll> > q;

int main(){
	ll v1, v2, w;
	scanf("%lld %lld %lld", &n, &m, &s);
	
	for(int i=1; i<=m; i++){
		scanf("%lld %lld %lld", &v1, &v2, &w);
		e[v1].push_back(make_pair(v2, w));
	}
	
	for(int i=0; i<=n; i++){
		dis[i] = inf;
	}
	
	dis[s] = 0;
	q.push(make_pair(-dis[s], s));
	
	while(q.size()){
		int t = q.top().second, td = -q.top().first;
		
		q.pop();
		
		if(dis[t] != td)
			continue;

		for(int i=0; i<e[t].size(); i++){
			int v = e[t][i].first, d = e[t][i].second;
			
			if(dis[v]>dis[t] + d){
				dis[v] = dis[t] + d;
				q.push(make_pair(-dis[v], v));
			}
		}
	}
	
	for(int i=1; i<=n; i++)
		printf("%lld ", dis[i]);

		
	return 0;
}