Pagini recente » Borderou de evaluare (job #2710989) | Cod sursa (job #2916331) | Borderou de evaluare (job #1580251) | Borderou de evaluare (job #1100363) | Cod sursa (job #3337855)
/******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.
*******************************************************************************/
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m;
int main()
{
cin>>n>>m;
vector<vector<pair<int,int>>>adj(n+1);
priority_queue<
pair<int,int>,
vector<pair<int,int>>,
greater<pair<int,int>>>Q;
int a,b,c;
for(int i=1;i<=m;i++)
{
cin>>a>>b>>c;
adj[a].push_back({b,c});
adj[b].push_back({a,c});
}
vector<int>dist(n+1,1e9);
dist[1] = 0;
Q.push({1,0});
while(!Q.empty())
{
int nod = Q.top().first;
int d = Q.top().second;
Q.pop();
if(dist[nod]!=d)
{
continue;
}
for(auto p:adj[nod])
{
int v = p.first;
int c = p.second;
if(dist[nod]+c<dist[v])
{
dist[v] = dist[nod]+c;
Q.push({v,dist[v]});
}
}
}
for(int i=2;i<=n;i++)
{
if(dist[i]!=1e9)
{
cout<<dist[i]<<" ";
}else
{
cout<<0;
}
}
return 0;
}