Cod sursa(job #2288217)
| Utilizator | Data | 22 noiembrie 2018 22:40:37 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
const int N=50001;
struct G {
int a,b,c;
}g[5*N];
int m,i,o,n,d[N];
int main() {
freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
scanf("%d%d%d",&g[i].a,&g[i].b,&g[i].c);
for(i=2;i<=n;i++)
d[i]=N;
while(!o) {
for(o=i=1;i<=m;i++)
if(d[g[i].b]>d[g[i].a]+g[i].c)
o=0,d[g[i].b]=d[g[i].a]+g[i].c;
}
for(i=2;i<=n;i++)
printf("%d ",d[i]==N?0:d[i]);
}
