Cod sursa(job #2556835)

Utilizator ionita786Ionita Daniel ionita786 Data 25 februarie 2020 10:56:14
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
struct edgeweight
{
    int x,y,weight;
} edge[250001];
int n,m,a,b,c,wnode[50001],steps;
bool ok[250001];
int main()
{
    in >> n >> m;
    for(int i = 1; i <= m ; ++i)
        in >> edge[i].x >> edge[i].y >> edge[i].weight;
    memset(wnode, '1001', sizeof(wnode));
    wnode[1] = 0;
    steps = n;
    while(steps != 1)
    {
        for(int i = 1; i <= m; ++i)
            if(wnode[edge[i].x] != 1001 && wnode[edge[i].y] > wnode[edge[i].x] + edge[i].weight)
            {
                wnode[edge[i].y] = wnode[edge[i].x] + edge[i].weight;
            }
        steps--;
    }
    for(int i = 1; i <= m; ++i)
        if(wnode[edge[i].y] > wnode[edge[i].x] + edge[i].weight)
        {
            out << "Ciclu negativ!";
            return 0;
        }
    for(int i = 2; i <= n; ++i)
        out << wnode[i] << " ";
    return 0;
}