Mai intai trebuie sa te autentifici.
Cod sursa(job #3375523)
| Utilizator | Data | 12 noiembrie 2026 10:54:18 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.35 kb |
#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out"); // Corectat din fin in fout
const int INF = 2000000000;
vector<vector<pair<int, int>>> v;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
vector<int> dist;
void dijkstra(int s, int n) {
dist.assign(n + 1, INF);
dist[s] = 0;
q.push({0, s});
while (!q.empty()) {
int d = q.top().first;
int nod = q.top().second;
q.pop();
if (d > dist[nod]) {
continue;
}
for (auto muchie : v[nod]) {
int vecin = muchie.first;
int cost = muchie.second;
if (dist[nod] + cost < dist[vecin]) {
dist[vecin] = dist[nod] + cost;
q.push({dist[vecin], vecin});
}
}
}
}
int main() {
int x, y, p, n, m;
fin >> n >> m;
v.resize(n + 1);
for (int i = 0; i < m; i++) {
fin >> x >> y >> p;
v[x].push_back({y, p});
}
dijkstra(1, n);
for (int i = 2; i <= n; i++) {
if (dist[i] == INF) {
fout << 0 << " ";
} else {
fout << dist[i] << " ";
}
}
fout << "\n";
fin.close();
fout.close();
return 0;
}