Pagini recente » Cod sursa (job #2660140) | Cod sursa (job #2672387) | Cod sursa (job #442084) | Cod sursa (job #2289945) | Cod sursa (job #2574014)
#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];
vector < A > :: iterator it;
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 ( it = v[x].begin() ; it != v[x].end() ; it++ ) if ( r[x] + (*it).cost < r[(*it).dest] ) r[(*it).dest] = r[x] + (*it).cost, M.insert ( { r[(*it).dest], (*it).dest } );
}
}
for ( i = 2 ; i <= n ; i++ )
if ( r[i] != MAX ) fout << r[i] << ' ';
else fout << 0 << ' ';
return 0;
}