Pagini recente » Rating Iftimi Ruxandra (ruxiii) | Cod sursa (job #2574129) | Cod sursa (job #1731818) | Cod sursa (job #2085145) | Cod sursa (job #1587044)
#include <vector>
#include <queue>
#include <cstdio>
using namespace std;
int pret[50010];
queue <int> q;
vector <pair<int,int> > a[50010];
void dijkstra()
{
int nod,b,c;
q.push(1);
while (!q.empty())
{
nod=q.front();
for (int i=0;i<a[nod].size();i++)
{
b=a[nod][i].first;
c=a[nod][i].second;
if ((pret[b]>pret[nod]+c) || (pret[b]==0))
{
pret[b]=pret[nod]+c;
q.push(b);
}
}
q.pop();
}
}
int n,m;
int x,y,z;
int main ()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
scanf("%d%d%d",&x,&y,&z);
a[x].push_back(make_pair(y,z));
}
dijkstra();
for (int i=2;i<=n;i++)
printf("%d ",pret[i]);
return 0;
}