Pagini recente » Cod sursa (job #2519672) | Cod sursa (job #3036550) | Cod sursa (job #677291) | Cod sursa (job #1113492) | Cod sursa (job #2326490)
#include<fstream>
using namespace std;const int x=(1<<21);int a[4][250001],d[50001];register int n,k,o=1,i,j,c,m,nr=1;ifstream f("dijkstra.in");ofstream g("dijkstra.out");int main(){f>>n>>m;for(i=1;i<=n;i++)d[i]=x;d[1]=0;for(i=1;i<=m;i++){f>>a[1][i]>>a[2][i]>>a[3][i];if(a[1][i]==1)d[a[2][i]]=a[3][i];}while(o && nr<n){o=0;for(k=1;k<=m;k++){i=a[1][k];j=a[2][k];c=a[3][k];if(d[j]>d[i]+c){d[j]=d[i]+c;o=1;}}nr++;}for(i=2;i<=n;i++)if(d[i]<x)g<<d[i]<<" ";else g<<0<<" ";return 0;}