Pagini recente » Cod sursa (job #315648) | Cod sursa (job #1317407) | Cod sursa (job #2433441) | Cod sursa (job #2277999) | Cod sursa (job #3033591)
#include <bits/stdc++.h>
//Soltan Cristian
#define fri(a, b) for (int i = (a); i < (b); ++i)
#define frj(a, b) for(int j = a; j < b; j++)
#define frk(a, b) for(int k = a; k < b; k++)
#define frm(a, b, i) for(int i = b; i >= a; i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define pb push_back
#define st first
#define nd second
#define sz(x) (ll)x.size()
#define rall(x) x.rbegin(), x.rend()
#define ct(x) cout << x
#define cts(x) cout << x << ' '
#define ctn(x) cout << x << '\n'
#define Y cout << "YES" << '\n'
#define N cout << "NO" << '\n'
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using ml = map<ll, ll>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <typename T>void read(T n, vector<T> &a){fri(0, n){cin >> a[i];}}
template<typename T>void print(T n, T m, vector<vector<T>> &dp){fri(0, n){ct('\n');frj(0, m){ct(setw(5));cts(dp[i][j]);}}}
const int mxa = 1e9 + 1;
string __fname = "bellmanford";
ifstream in(__fname + ".in");
ofstream out (__fname + ".out");
#define cin in
#define cout out
struct Edge{
int a, b, c;
};
void solve(){
int n, m;
cin >> n >> m;
vector<Edge> e;
fri(0, m){
int x, y,z;
cin >> x >> y >> z;
Edge k = {x, y, z};
e.pb(k);
}
vector<int> dist(n + 1, mxa);
dist[1] = 0;
bool neg = false;
for(int i = 0; i < n; i++){
neg = false;
for(int j = 0; j < m; j++){
if(dist[e[j].a] < mxa){
if(dist[e[j].b] > dist[e[j].a] + e[j].c){
dist[e[j].b] = dist[e[j].a] + e[j].c;
if(i == n){
neg = true;
}
}
}
}
}
if(neg == true){
cout << "Ciclu negativ!\n";
}
else{
fri(2, n + 1){
cout << dist[i] << ' ';
}
cout << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); ct(fixed); ct(setprecision(10));
// int t;
// cin >> t;
// while(t--)
solve();
return 0;
}