mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 17:51:58 +00:00
parent
68329e8113
commit
004deb5af9
@ -1,43 +1,71 @@
|
||||
#include <bits/stdc++.h>
|
||||
#include <iostream>
|
||||
#include <algorithm>
|
||||
#include <functional>
|
||||
#include <queue>
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
|
||||
using namespace std;
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
int n, m, s, u, v, w, dist[200005];
|
||||
vector<pair<int, int>> g[200005];
|
||||
bool st[200005];
|
||||
const int N = 1e5 + 5;
|
||||
const int INF = 0x3f3f3f3f;
|
||||
|
||||
int n, m, s, dist[N];
|
||||
std::vector<std::pair<int, int>> g[N];
|
||||
bool vis[N];
|
||||
|
||||
void dijkstra() {
|
||||
memset(dist, 0x3f, sizeof(dist));
|
||||
std::fill_n(dist, N, INF);
|
||||
|
||||
std::priority_queue<
|
||||
std::pair<int, int>,
|
||||
std::vector<std::pair<int, int>>,
|
||||
std::greater<std::pair<int, int>>>
|
||||
q;
|
||||
|
||||
q.emplace(0, s);
|
||||
dist[s] = 0;
|
||||
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
|
||||
q.push(make_pair(0, s));
|
||||
|
||||
while (!q.empty()) {
|
||||
auto t = q.top();
|
||||
auto u = q.top().second;
|
||||
q.pop();
|
||||
int tw = t.second;
|
||||
int td = t.first;
|
||||
if (st[tw]) continue;
|
||||
for (auto i : g[tw]) {
|
||||
int j = i.first;
|
||||
if (dist[j] > td + i.second) {
|
||||
dist[j] = td + i.second;
|
||||
q.push(make_pair(dist[j], j));
|
||||
|
||||
if (vis[u]) continue;
|
||||
vis[u] = true;
|
||||
|
||||
for (auto e : g[u]) {
|
||||
int v = e.first,
|
||||
w = e.second;
|
||||
|
||||
if (dist[v] > dist[u] + w) {
|
||||
dist[v] = dist[u] + w;
|
||||
q.emplace(dist[v], v);
|
||||
}
|
||||
}
|
||||
st[tw] = true;
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
cin.tie(nullptr);
|
||||
|
||||
cin >> n >> m >> s;
|
||||
for (int i = 1; i <= m; i++) {
|
||||
|
||||
for (int i = 1, u, v, w; i <= m; i++) {
|
||||
cin >> u >> v >> w;
|
||||
g[u].push_back(make_pair(v, w));
|
||||
|
||||
g[u].emplace_back(v, w);
|
||||
}
|
||||
|
||||
dijkstra();
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
cout << dist[i] << ' ';
|
||||
}
|
||||
|
||||
cout << endl;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user