Pagini recente » Cod sursa (job #2853719) | Monitorul de evaluare | Cod sursa (job #2062248) | Cod sursa (job #1844452) | Cod sursa (job #2034092)
#include <bits/stdc++.h>
#define INF 2147483647
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int i,j,a,b,c,d[50001],viz[50001],ok,mi,ind,n,m;
vector<pair<int,int>> v[50001];
int main()
{
ok=1;
fin>>n>>m;
for (i=2;i<=n;i++)
d[i]=INF;
for (i=1;i<=m;i++)
{
fin>>a>>b>>c;
v[a].push_back(make_pair(b,c));
}
while (ok==1)
{
ind=0;
mi=INF;
ok=0;
for (i=1;i<=n;i++)
{
if (d[i]<mi&&viz[i]==0)
{
ind=i;
mi=d[i];
}
}
if (ind!=0)
{
viz[ind]=1;
ok=1;
for (auto t:v[ind])
{
if (d[t.first]>d[ind]+t.second)
d[t.first]=d[ind]+t.second;
}
}
}
for (i=2;i<=n;i++)
{
if (d[i]==INF)
fout<<0<<" ";
else fout<<d[i]<<" ";
}
return 0;
}