Cod sursa(job #3353625)

Utilizator rapidu36Victor Manz rapidu36 Data 8 mai 2026 18:02:14
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.01 kb
#include <fstream>
#include <climits>
#include <vector>

using namespace std;

const int N = 5e4;
const int INF = 1e9;

struct muchie {
    int x, y, c;
};

int main() {
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    int n, m;
    in >> n >> m;
    vector <muchie> e(m);
    for (int i = 0; i < m; i++) {
        in >> e[i].x >> e[i].y >> e[i].c;
    }
    in.close();
    vector <int> d(n + 1, INF);
    d[1] = 0;
    for (int i = 0; i < n - 1; i++) {
        for (auto e_i: e) {
            if (d[e_i.x] + e_i.c < d[e_i.y]) {
                d[e_i.y] = d[e_i.x] + e_i.c;
            }
        }
    }
    bool exista_ciclu_neg = false;
    for (auto e_i: e) {
        if (d[e_i.x] + e_i.c < d[e_i.y]) {
            d[e_i.y] = d[e_i.x] + e_i.c;
            exista_ciclu_neg = true;
        }
    }
    if (exista_ciclu_neg) {
        out << "Ciclu negativ!";
    } else {
        for (int i = 2; i <= n; i++) {
            out << d[i] << " ";
        }
    }
    out << "\n";
    out.close();
    return 0;
}