Pagini recente » Cod sursa (job #713411) | Cod sursa (job #2527164) | Cod sursa (job #2408605) | Cod sursa (job #3212408) | Cod sursa (job #2723453)
#include <bits/stdc++.h>
#define mod 666013
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
void usain_bolt()
{
ios::sync_with_stdio(false);
fin.tie(0);
}
const int N = 5e4 + 5;
vector < pair < int, int > > a[N];
int f[N], n, m;
bool in[N];
void bfs(int k)
{
queue < int > q;
vector < int > d(N - 1, 2e9);
d[1] = 0;
q.push(k);
in[1] = true;
while(!q.empty()) {
int v = q.front();
q.pop();
++f[v];
if(f[v] == n) {
fout << "Ciclu negativ!";
exit(0);
}
in[v] = false;
for(auto x : a[v]) {
int to = x.first;
int len = x.second;
if(d[to] > d[v] + len) {
d[to] = d[v] + len;
if(in[to] == false) {
q.push(to);
in[to] = true;
}
}
}
}
for(int i = 2; i <= n; ++i) {
fout << d[i] << " ";
}
}
int main()
{
usain_bolt();
fin >> n >> m;
for(int i = 1; i <= m; ++i) {
int x, y, w;
fin >> x >> y >> w;
a[x].push_back({y, w});
}
bfs(1);
return 0;
}