Borderou de evaluare (job #2806638)

Utilizator atudoreimirunaAtudorei Miruna Gabriela atudoreimiruna Data 22 noiembrie 2021 21:09:10
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: main.cpp: In member function 'void Graf::Dijkstra(int)': main.cpp:64:20: error: no matching function for call to 'std::priority_queue<std::pair<int, int> >::push(int&)' 64 | q.push(nodStart); | ^ In file included from /usr/include/c++/10/queue:64, from main.cpp:4: /usr/include/c++/10/bits/stl_queue.h:640:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]' 640 | push(const value_type& __x) | ^~~~ /usr/include/c++/10/bits/stl_queue.h:640:30: note: no known conversion for argument 1 from 'int' to 'const value_type&' {aka 'const std::pair<int, int>&'} 640 | push(const value_type& __x) | ~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/10/bits/stl_queue.h:648:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]' 648 | push(value_type&& __x) | ^~~~ /usr/include/c++/10/bits/stl_queue.h:648:25: note: no known conversion for argument 1 from 'int' to 'std::priority_queue<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'} 648 | push(value_type&& __x) | ~~~~~~~~~~~~~^~~ main.cpp:70:24: error: cannot convert 'const value_type' {aka 'const std::pair<int, int>'} to 'int' in initialization 70 | int nod = q.top(); | ~~~~~^~ | | | const value_type {aka const std::pair<int, int>} main.cpp:73:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 73 | for ( int i = 0; i < graf_ponderat[nod].size(); i++ ) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:84:33: error: no matching function for call to 'std::priority_queue<std::pair<int, int> >::push(int&)' 84 | q.push(vecin); | ^ In file included from /usr/include/c++/10/queue:64, from main.cpp:4: /usr/include/c++/10/bits/stl_queue.h:640:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]' 640 | push(const value_type& __x) | ^~~~ /usr/include/c++/10/bits/stl_queue.h:640:30: note: no known conversion for argument 1 from 'int' to 'const value_type&' {aka 'const std::pair<int, int>&'} 640 | push(const value_type& __x) | ~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/10/bits/stl_queue.h:648:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]' 648 | push(value_type&& __x) | ^~~~ /usr/include/c++/10/bits/stl_queue.h:648:25: note: no known conversion for argument 1 from 'int' to 'std::priority_queue<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'} 648 | push(value_type&& __x) | ~~~~~~~~~~~~~^~~ Non zero exit status: 1

Ceva nu functioneaza?