Cod sursa(job #1610088)

Utilizator alex.craciunCraciun Alexandru alex.craciun Data 23 februarie 2016 11:38:15
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <cstdio>
#include <climits>
#include <vector>

#define inf INT_MAX
#define po 50001


using namespace std;

int n,m,coada[po],dist[po];
vector<pair<int,int> > nods[po];

FILE *f1;

int main()
{
    f1=fopen("bellmanford.in","r");
    fscanf(f1,"%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fscanf(f1,"%d%d%d",&a,&b,&c);
        nods[a].push_back(make_pair(b,c));
    }
    for(int i=1;i<=n;i++)
    {
        dist[i]=inf;
    }
    dist[1]=0;
    int p=1,u=1;
    coada[p]=1;
    while(p<=u)
    {
        vector<pair<int,int> > ::iterator it;
        for(it=nods[p].begin();it!=nods[p].end();it++)
        {
            if(dist[it->first]>dist[p]+it->second)
            {
                dist[it->first]=dist[p]+it->second;
                coada[++u]=it->first;
            }
        }
        p++;
    }
    FILE *f=fopen("bellmanford.out","w");
    for(int i=2;i<=n;i++)
    {
        fprintf(f,"%d ",dist[i]);
    }
    return 0;
}