Pagini recente » Cod sursa (job #2130478) | Monitorul de evaluare | Cod sursa (job #648629) | Monitorul de evaluare | Cod sursa (job #3319151)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
#define cin fin
#define cout fout
struct el {
long long nod, cost;
};
int sursa;
vector<vector<el>> adj;
vector<long long> dist;
void bellmanford() {
dist[sursa] = 0;
int n = adj.size() - 1;
for(int i = 1; i < n; i++) {
for(int u = 1; u <= n; u++) {
if(dist[u] == 1e18) continue;
for(auto e : adj[u]) {
long long v = e.nod;
long long v_cost = e.cost;
if(dist[u] + v_cost < dist[v]) {
dist[v] = dist[u] + v_cost;
}
}
}
}
}
int main()
{
int n, m;
cin >> n >> m;
adj.resize(n + 1);
dist.resize(n + 1);
fill(dist.begin(), dist.end(), 1e18);
for(int i = 1; i <= m; i++) {
long long x, y, c;
cin >> x >> y >> c;
adj[x].push_back({y, c});
}
sursa = 1;
bellmanford();
for(int i = 2; i <= n; i++) {
if(dist[i] == 1e18) cout << 0 << " ";
else cout << dist[i] << " ";
}
}