Cod sursa(job #2853339)

Utilizator mirunacoroiCoroi Miruna Elena mirunacoroi Data 20 februarie 2022 10:45:24
Problema Algoritmul lui Dijkstra Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.41 kb
#include <fstream>
#include <vector>
#define NMAX 50002
#define INF 1000000000

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, x0, cmin[NMAX], prec[NMAX];
bool v[NMAX];
struct varf
{
    int x;
    int c;
};
vector <varf> LA[NMAX];
void citire();
void dijkstra();
void afisare();

int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}
void citire()
{
    int i, x, y, c;
    varf a;
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x;
        fin>>a.x>>a.c;
        LA[x].push_back(a);
    }
    x0=1;
}
void dijkstra()
{
    int i, j, vfmin, minn=0;
    for (i=1; i<=n; i++)
        cmin[i]=INF;
    cmin[x0]=0;
    for (i=1; i<=n; i++)
    {
        minn=INF, vfmin=0;
        for (j=1; j<=n; j++)
            if (minn>cmin[j] && v[j]==0)
            {
                minn=cmin[j];
                vfmin=j;
            }
        if (minn==INF) break;
        v[vfmin]=1;
        for (j=0; j<LA[vfmin].size(); j++)
        {
            if (cmin[vfmin]+LA[vfmin][j].c<cmin[LA[vfmin][j].x])
            {
                cmin[LA[vfmin][j].x]=cmin[vfmin]+LA[vfmin][j].c;
                prec[cmin[vfmin]+LA[vfmin][j].x]=vfmin;
            }
        }
    }
}
void afisare()
{
    int i;
    for (i=2; i<=n; i++)
    if(cmin[i]!=INF)
        fout<<cmin[i]<<" ";
        else fout<<0<<" ";
}