Cod sursa(job #2453787)

Utilizator vlad082002Ciocoiu Vlad vlad082002 Data 6 septembrie 2019 00:58:40
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>
#include <iostream>
#define inf 1000000000
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

struct muchie{
    int b, c;
    muchie *next;
};
muchie *G[50010];

void add(int i, int j, int c) {
    muchie *p = new muchie;
    p->b = j;
    p->c = c;
    p->next = G[i];
    G[i] = p;
}

int n, m, viz[50010], drum[50010];


int main() {
    f >> n >> m;

    for(int i = 1; i <= m; i++) {
        int a, b, c;
        f >> a >> b >> c;
        add(a, b, c);
    }

    for(int i = 2; i <= n; i++)
        drum[i] = inf;

    for(int i = 1; i <= n; i++) {
        int curr = 0, minim = inf;


        for(int j = 1; j <= n; j++)
            if(drum[j] < minim && !viz[j]) {
                minim = drum[j];
                curr = j;
            }
        viz[curr] = 1;

        for(muchie *p = G[curr]; p ; p = p->next) {
            if(drum[p->b] > drum[curr] + p->c)
                drum[p->b] = drum[curr] + p->c;
        }
    }

    for(int i = 1; i <= n; i++)
        g << drum[i] << ' ';
}