Rezumat problemă

Dijkstra2

#1887

Dijkstra are nevoie de ajutorul vostru pentru a-și duce la bun sfârșit datoria. Acesta vrea să afle drumurile de lungime minimă de la casa prietenului său Vlad la celelalte case ale vecinilor. Nu are foarte mult timp la dispoziție așa ca trebuie să vă mișcați repede. Îl veți ajuta?

Fișiere Munteanu Vlad (vladm98) Vlad Munteanu dificilă

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Dijkstra

Rezolvă

Detalii

Problema	Dijkstra2	Operații I/O	dijkstra2.in/dijkstra2.out
Limita timp	0.2 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#63289575	Utilizator	Cîrstov Teodor (TeodorG8)
Fișier	dijkstra2.cpp	Dimensiune	1.13 KB
Data încărcării	25 Februarie 2026, 09:01	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra2.cpp: In function 'int main()':
dijkstra2.cpp:39:14: error: expected unqualified-id before '[' token
         auto [dist,node]=pq.top();

              ^
dijkstra2.cpp:42:12: error: 'dist' was not declared in this scope
         if(dist>d[node])

            ^
dijkstra2.cpp:42:19: error: 'node' was not declared in this scope
         if(dist>d[node])

                   ^
dijkstra2.cpp:45:22: error: 'node' was not declared in this scope
         for(auto i:L[node])

                      ^
dijkstra2.cpp:50:45: error: no matching function for call to 'std::priority_queue<std::pair<long long int, int>, std::vector<std::pair<long long int, int> >, std::greater<std::pair<long long int, int> > >::push(<brace-enclosed initializer list>)'
                 pq.push({d[i.first],i.first});

                                             ^
dijkstra2.cpp:50:45: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from dijkstra2.cpp:3:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int> >; _Compare = std::greater<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<long long int, int>&}'
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int> >; _Compare = std::greater<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::pair<long long int, int>, std::vector<std::pair<long long int, int> >, std::greater<std::pair<long long int, int> > >::value_type&& {aka std::pair<long long int, int>&&}'

Cum funcționează evaluarea?