Cod sursa(job #2131036)

Utilizator MaligMamaliga cu smantana Malig Data 14 februarie 2018 11:17:20
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 1.33 kb
#include <bits/stdc++.h>

using namespace std;

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

ifstream in("bellmanford.in");
ofstream out("bellmanford.out");

using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 5e4 + 5;
const int inf = 1e9 + 5;
const int mod = 100003;
using zint = int;

int N,M;
int dist[NMax];
vector< pair<int,int> > v[NMax];

int main() {
    in>>N>>M;
    for (int i = 1;i <= M;++i) {
        int x,y,c;
        in>>x>>y>>c;

        v[x].pb( {y,c} );
    }

    for (int i = 2;i <= N;++i) {
        dist[i] = inf;
    }

    bool update = false;
    for (int c = 1;c <= N;++c) {
        update = false;

        for (int i = 1;i <= N;++i) {
            for (auto p : v[i]) {
                int nxt = p.first, cost = p.second;

                if (dist[nxt] > dist[i] + cost) {
                    dist[nxt] = dist[i] + cost;
                    update = true;
                }
            }
        }
    }

    if (update) {
        out<<"Ciclu negativ!";
    }
    else {
        for (int i = 2;i <= N;++i) {
            out<<dist[i]<<' ';
        }
    }

    in.close();out.close();
    return 0;
}