Cod sursa(job #3337855)

Utilizator Laurentiu445Ieremia Laurentiu Laurentiu445 Data 30 ianuarie 2026 13:51:50
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.53 kb
/******************************************************************************

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;
}