Pagini recente » Cod sursa (job #1868534) | Cod sursa (job #135703) | Cod sursa (job #2885211) | Cod sursa (job #2740780) | Cod sursa (job #382911)
Cod sursa(job #382911)
#include <cstdio>
#include <vector>
#define NMAX 50001
using namespace std;
void citire();
void rezolvare();
void scrie();
int minim(int a,int b);
int N,M;
vector<int> G[NMAX],H[NMAX];
int COADA[NMAX],NR=0;
int VAL[NMAX];
int main()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
citire();
rezolvare();
scrie();
return 0;
}
void citire()
{
int x,y,v;
scanf("%d %d",&N,&M);
for(int i=1;i<=M;i++)
{
scanf("%d %d %d",&x,&y,&v);
G[x].push_back(y);
H[x].push_back(v);
}
}
void rezolvare()
{
vector<int>::iterator it,ih;
for( it=G[1].begin(), ih=H[1].begin(); it!=G[1].end() || ih!=H[1].end() ;it++,ih++)
{
COADA[++NR]=*it;
VAL[COADA[NR]]=*ih;
}
for(int i=1;i<N;i++)
for( it=G[COADA[i]].begin(), ih=H[COADA[i]].begin(); it!=G[COADA[i]].end() || ih!=H[COADA[i]].end() ;it++,ih++)
{
COADA[++NR]=*it;
VAL[COADA[NR]]=minim(VAL[COADA[NR]],*ih+VAL[COADA[i]]);
}
}
void scrie()
{
for(int i=2;i<=N;i++)
printf("%d ",VAL[i]);
}
int minim(int a,int b)
{
if(a==0)
return b;
if(a>b)
return b;
return a;
}