Pagini recente » Cod sursa (job #2831276) | Cod sursa (job #583090) | Cod sursa (job #110169) | Cod sursa (job #1794476) | Cod sursa (job #2522419)
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
const int mod=1e9+7;
const int modx=998244353;
const int per=666013;
const int inf=1e9;
int n,m,dist[50005];
vector<pair<int,int>>nod[50005];
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
cin >> n >> m;
for(int i=2;i<=n;i++) dist[i]=inf;
for(int i=1;i<=m;i++){
int x,y,z;
cin >> x >> y >> z;
nod[x].push_back({y,z});
}
vector<int>prev;
prev.push_back(1);
vector<int>tz;
bitset<50005>viz;
for(int i=1;i<=n;i++){
viz.reset();
tz.clear();
for(auto j:prev){
for(auto it:nod[j]){
if(dist[it.fr]>dist[j]+it.sc){
if(i==n) rc("Ciclu negativ!");
dist[it.fr]=dist[j]+it.sc;
if(viz[it.fr]==0){
viz[it.fr]=1;
tz.push_back(it.fr);
}
}
}
}
prev.clear();
prev=tz;
}
for(int i=2;i<=n;i++) cout << dist[i] << ' ';
}