Cod sursa(job #1995600)

Utilizator MaligMamaliga cu smantana Malig Data 28 iunie 2017 16:32:36
Problema Algoritmul Bellman-Ford Scor 65
Compilator cpp Status done
Runda Arhiva educationala Marime 1.27 kb
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");

#define ll long long
#define pb push_back
#define ui unsigned int
const int inf = 1e9 + 5;
const int NMax = 5e4 + 5;

int N,M;
int dist[NMax];

struct elem {
    int x,y,c;
    elem (int _x = 0,int _y = 0,int _c = 0) {
        x = _x;
        y = _y;
        c = _c;
    }
};
vector<elem> v;

int main() {
    in>>N>>M;

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

        v.pb(elem(x,y,c));
    }

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

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

        for (auto e : v) {
            int x = e.x,
                y = e.y,
                c = e.c;

            if (dist[y] > dist[x] + c) {
                dist[y] = dist[x] + c;
                update = true;
            }
        }

        if (!update) {
            break;
        }
    }

    if (update) {
        out<<"Ciclu negativ!\n";
    }
    else {

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

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