Cod sursa(job #2564822)

Utilizator vlad082002Ciocoiu Vlad vlad082002 Data 2 martie 2020 10:37:10
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <fstream>
#include <vector>
using namespace std;

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

const int inf = 1000000000;
int n, m, dist[50005];
vector<pair<int, int> > g[50005];

void citire() {
    fin >> n >> m;
    int a, b, c;
    while(m--) {
        fin >> a >> b >> c;
        g[a].push_back({b, c});
    }
}

void bellmanford() {
    for(int i = 1; i <= n; i++)
        dist[i] = inf;
    dist[1] = 0;
    for(int k = 1; k < n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 0; j < g[i].size(); j++)
                if(dist[i] + g[i][j].second < dist[g[i][j].first])
                    dist[g[i][j].first] = dist[i]+g[i][j].second;

    for(int i = 1; i <= n; i++)
        for(int j = 0; j < g[i].size(); j++)
            if(dist[i] + g[i][j].second < dist[g[i][j].first]) {
                fout << "Ciclu negativ!";
                return;
            }
    for(int i = 2; i <= n; i++)
        fout << dist[i] << ' ';
}

int main() {
    citire();
    bellmanford();
}