Cod sursa(job #2573986)

Utilizator vmnechitaNechita Vlad-Mihai vmnechita Data 5 martie 2020 19:50:15
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.01 kb
#include <bits/stdc++.h>
#define NMAX 50005
#define MAX 2100000000

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

struct A
{
    int dest, cost;
};

multimap < int, int > M;
vector < A > v[NMAX];
bitset < NMAX > viz;
int r[NMAX];

int main()
{
    int n, m, x, y, z, i;

    fin >> n >> m;
    while ( m-- )
    {
        fin >> x >> y >> z;
        v[x].push_back ( { y, z } );
    }

    for ( i = 2 ; i <= n ; i++ ) r[i] = MAX;

    M.insert ( { 0, 1 } );
    while ( M.empty() == 0 )
    {
        x = M.begin() -> second;
        M.erase ( M.begin() );

        if ( viz[x] == 0 )
        {
            viz[x] = 1;
            for ( i = 0 ; i < v[x].size() ; i++ ) if ( r[x] + v[x][i].cost < r[v[x][i].dest] ) r[v[x][i].dest] = r[x] + v[x][i].cost, M.insert ( { r[v[x][i].dest], v[x][i].dest } );
        }
    }

    for ( i = 2 ; i <= n ; i++ )
        if ( r[i] != MAX ) fout << r[i] << ' ';
        else fout << 0 << ' ';

    return 0;
}