#588
Se dă un graf orientat ponderat – în care fiecare arc are asociat un cost, număr natural strict pozitiv, și un nod p. Să se determine, folosind algoritmul lui Dijkstra, costul minim al drumului de la p la fiecare nod al grafului.
| Problema | Dijkstra | Operații I/O |
dijkstra.in/dijkstra.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #57895609 | Utilizator | |
| Fișier | dijkstra.cpp | Dimensiune | 1.25 KB |
| Data încărcării | 29 Aprilie 2025, 17:36 | Scor/rezultat | Eroare de compilare |
dijkstra.cpp:4:1: error: 'define' does not name a type define INT_MAX 1001; ^ dijkstra.cpp:6:26: error: 'vector' has not been declared void dijkstra(int start, vector<vector<pair<int, int>>> adj, vector<int> &dist) { ^ dijkstra.cpp:6:32: error: expected ',' or '...' before '<' token void dijkstra(int start, vector<vector<pair<int, int>>> adj, vector<int> &dist) { ^ dijkstra.cpp: In function 'void dijkstra(int, int)': dijkstra.cpp:7:5: error: 'priority_queue' was not declared in this scope priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:34: error: expected primary-expression before ',' token priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:36: error: 'vector' was not declared in this scope priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:56: error: expected primary-expression before '>' token priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:58: error: expected primary-expression before ',' token priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:83: error: expected primary-expression before '>' token priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:7:85: error: 'pq' was not declared in this scope priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; ^ dijkstra.cpp:8:5: error: 'dist' was not declared in this scope dist[start] = 0; ^ dijkstra.cpp:12:14: error: expected unqualified-id before '[' token auto [d, u] = pq.top(); ^ dijkstra.cpp:15:13: error: 'd' was not declared in this scope if (d > dist[u]) continue; ^ dijkstra.cpp:15:22: error: 'u' was not declared in this scope if (d > dist[u]) continue; ^ dijkstra.cpp:17:19: error: expected unqualified-id before '[' token for (auto [v, cost] : adj[u]) { ^ dijkstra.cpp:17:19: error: expected ';' before '[' token dijkstra.cpp:17:20: error: 'v' was not declared in this scope for (auto [v, cost] : adj[u]) { ^ dijkstra.cpp:17:23: error: 'cost' was not declared in this scope for (auto [v, cost] : adj[u]) { ^ dijkstra.cpp: In lambda function: dijkstra.cpp:17:29: error: expected '{' before ':' token for (auto [v, cost] : adj[u]) { ^ dijkstra.cpp: In function 'void dijkstra(int, int)': dijkstra.cpp:17:29: error: expected ';' before ':' token dijkstra.cpp:17:29: error: expected primary-expression before ':' token dijkstra.cpp:17:29: error: expected ')' before ':' token dijkstra.cpp:17:29: error: expected primary-expression before ':' token dijkstra.cpp:17:29: error: expected ';' before ':' token dijkstra.cpp:50:1: error: expected '}' at end of input } ^ dijkstra.cpp:50:1: error: expected '}' at end of input
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Dijkstra face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.