Mai intai trebuie sa te autentifici.
Cod sursa(job #2208489)
Utilizator | Data | 30 mai 2018 00:48:01 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.1 kb |
#include <fstream>
#include <vector>
#include <set>
using namespace std;
set <pair <int , int> >heap;
vector <int> arc[50002] , cost[50002];
int n,m,i,a,b,c,dis[50002],nod,Min;
int main()
{
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a>>b>>c;
arc[a].push_back(b);
cost[a].push_back(c);
}
for(i=2;i<=n;i++)
dis[i]=2000000000;
heap.insert(make_pair(0, 1));
while(!heap.empty())
{
nod=heap.begin()->second;
Min=heap.begin()->first;
heap.erase(heap.begin());
for(i=0;i<arc[nod].size();i++)
if(dis[arc[nod][i]] > Min+cost[nod][i])
{
if(dis[arc[nod][i]]==2000000000)
heap.erase(make_pair(dis[arc[nod][i]],arc[nod][i]));
dis[arc[nod][i]] = Min+cost[nod][i];
heap.insert(make_pair(dis[arc[nod][i]],arc[nod][i]));
}
}
for(i=2;i<=n;i++)
if(dis[i]==2000000000)
g<<0<<' ';
else
g<<dis[i]<<' ';
return 0;
}