Borderou de evaluare (job #2067592)
Utilizator | Data | 16 noiembrie 2017 17:20:24 | |
---|---|---|---|
Problema | Retea | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘double dijkstra()’:
user.cpp:38:20: error: no matching function for call to ‘std::priority_queue<std::pair<double, std::pair<int, int> >, std::vector<std::pair<double, std::pair<int, int> > >, std::greater<std::pair<double, std::pair<int, int> > > >::push(<brace-enclosed initializer list>)’
pq.push({1,0,0});
^
user.cpp:38:20: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
from user.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<double, std::pair<int, int> >; _Sequence = std::vector<std::pair<double, std::pair<int, int> > >; _Compare = std::greater<std::pair<double, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<double, std::pair<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<double, std::pair<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<double, std::pair<int, int> >; _Sequence = std::vector<std::pair<double, std::pair<int, int> > >; _Compare = std::greater<std::pair<double, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<double, std::pair<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<double, std::pair<int, int> >, std::vector<std::pair<double, std::pair<int, int> > >, std::greater<std::pair<double, std::pair<int, int> > > >::value_type&& {aka std::pair<double, std::pair<int, int> >&&}’
user.cpp:42:13: error: no match for ‘operator=’ (operand types are ‘priot_queue’ and ‘const value_type {aka const std::pair<double, std::pair<int, int> >}’)
node=pq.top();
^
user.cpp:42:13: note: candidates are:
user.cpp:16:8: note: priot_queue& priot_queue::operator=(const priot_queue&)
struct priot_queue{
^
user.cpp:16:8: note: no known conversion for argument 1 from ‘const value_type {aka const std::pair<double, std::pair<int, int> >}’ to ‘const priot_queue&’
user.cpp:16:8: note: priot_queue& priot_queue::operator=(priot_queue&&)
user.cpp:16:8: note: no known conversion for argument 1 from ‘const value_type {aka const std::pair<double, std::pair<int, int> >}’ to ‘priot_queue&&’
user.cpp:54:111: error: no matching function for call to ‘std::priority_queue<std::pair<double, std::pair<int, int> >, std::vector<std::pair<double, std::pair<int, int> > >, std::greater<std::pair<double, std::pair<int, int> > > >::push(<brace-enclosed initializer list>)’
pq.push({(*it).next_node,node.current_k+i,dist[(*it).next_node][node.current_k+i]});
^
user.cpp:54:111: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
from user.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<double, std::pair<int, int> >; _Sequence = std::vector<std::pair<double, std::pair<int, int> > >; _Compare = std::greater<std::pair<double, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<double, std::pair<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<double, std::pair<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<double, std::pair<int, int> >; _Sequence = std::vector<std::pair<double, std::pair<int, int> > >; _Compare = std::greater<std::pair<double, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<double, std::pair<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<double, std::pair<int, int> >, std::vector<std::pair<double, std::pair<int, int> > >, std::greater<std::pair<double, std::pair<int, int> > > >::value_type&& {aka std::pair<double, std::pair<int, int> >&&}’
user.cpp:59:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !