Pagini recente » Cod sursa (job #440779) | Cod sursa (job #1251480) | Cod sursa (job #1135850) | Cod sursa (job #910369) | Cod sursa (job #2203078)
#include <fstream>
#include <vector>
#define nmax 50005
#define mmax 250005
#define inf 20000000000
using namespace std;
fstream f1("dijkstra.in", ios::in);
fstream f2("dijkstra.out", ios::out);
int n, m, viz[nmax];
long long dist[nmax];
vector<pair<int, int> > v[nmax];
void citire()
{
int i, x, y,c;
f1>>n>>m;
for(i=1; i<=m; i++)
{
f1>>x>>y>>c;
v[x].push_back({y,c});
}
}
void solutie()
{
int i, j, vfmin;
long long mini;
viz[1]=1;
for(i=2; i<=n; i++)
dist[i]=inf;
for(auto it=v[1].begin(); it!=v[1].end(); ++it)
dist[(*it).first]=(*it).second;
for(i=1; i<n; i++)
{
mini=inf;
for(j=1; j<=n; j++)
if((!viz[j])&&(mini> dist[j])) {mini=dist[j]; vfmin=j;}
viz[vfmin]=1;
for(auto it=v[vfmin].begin(); it!=v[vfmin].end(); ++it)
if((!viz[(*it).first])&&(dist[(*it).first]> dist[vfmin]+(*it).second))
dist[(*it).first]= dist[vfmin]+(*it).second;
}
}
void afis()
{
int i;
for(i=2; i<=n; i++)
if(dist[i]!=inf) f2<<dist[i]<<' ';
else f2<<0<<' ';
}
int main()
{
citire();
solutie();
afis();
return 0;
}