Pagini recente » Istoria paginii runda/antrenament_3/clasament | Istoria paginii runda/simojir | Cod sursa (job #769992) | Cod sursa (job #703808) | Cod sursa (job #2968605)
#include <fstream>
#define INF 2000000000
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct muchie{
int x, cost;
};
int d[50001], viz[50001];
vector <muchie> l[50001];
int main()
{
int n, i, m, x, y, c, j, p;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y>>c;
l[x].push_back({y, c});
}
for(i=1;i<=n;i++)
{
d[i]=INF;
}
d[1]=0;
int minn;
for(i=1;i<=n;i++)
{
minn=INF;
p=-1;
for(j=1;j<=n;j++)
{
if(d[j]<minn&&viz[j]==0)
{
minn=d[j];
p=j;
}
}
if(minn==INF)
{
break;
}
viz[p]=1;
for(j=0;j<l[p].size();j++)
{
if(d[l[p][j].x]>d[p]+l[p][j].cost)
{
d[l[p][j].x]=d[p]+l[p][j].cost;
}
}
}
for(i=2;i<=n;i++)
{
if(d[i]==INF)
{
fout<<0<<"\n";
continue;
}
fout<<d[i]<<" ";
}
}