Cod sursa(job #1809954)
| Utilizator | Data | 19 noiembrie 2016 14:19:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <vector>
#define INF 20010
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector<pair<int,int> > v[50010];
int n,m,i,j,x,y,w,l,dist[50010];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>w;
v[x].push_back(make_pair(y,w));
}
for(i=2;i<=n;i++)
dist[i]=INF;
for(i=1;i<=n;i++)
for(auto it:v[i])
if(dist[it.first]>dist[i]+it.second)
dist[it.first]=dist[i]+it.second;
for(i=2;i<=n;i++)
g<<dist[i]<<' ';
return 0;
}
