Cod sursa(job #1207326)

Utilizator RathebaSerbanescu Andrei Victor Ratheba Data 12 iulie 2014 19:26:25
Problema Algoritmul Bellman-Ford Scor 15
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <cstdio>
#include <vector>
#include <utility>

using namespace std;
#define MAX 50005
#define INF 50000001

vector<int> v[MAX];
vector<int> w[MAX];
int d[MAX];
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    int n, m, i, j, x, y, ww;
    scanf("%d%d",&n,&m);
    for(i=2; i<=n; i++)
        d[i] = INF;
    d[1]=0;
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y,&ww);
        v[x].push_back(y);
        w[x].push_back(ww);
    }
    int z;
    for(z=1; z<=n; z++)
        for(i=1; i<=n; i++)
            for(j=0; j<v[i].size(); j++)
                if(d[i]+w[i][j] < d[v[i][j]])
                    d[v[i][j]]=d[i]+w[i][j];

    for(i=1; i<=n; i++)
        for(j=0; j<v[i].size(); j++)
            if(d[i]+w[i][j] < d[v[i][j]])
            {
                printf("-1\n");
                return 0;
            }
    for(i=2; i<=n; i++)
        printf("%d ",d[i]);
    return 0;
}