Borderou de evaluare (job #1164802)

Utilizator smaraldaSmaranda Dinu smaralda Data 2 aprilie 2014 12:20:19
Problema Mine Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: In file included from /usr/local/include/c++/4.8.0/queue:64:0, from user.cpp:4: /usr/local/include/c++/4.8.0/bits/stl_queue.h: In instantiation of ‘class std::priority_queue<EDGE, std::vector<EDGE>, cmp()>’: user.cpp:39:45: required from here /usr/local/include/c++/4.8.0/bits/stl_queue.h:388:18: error: field ‘std::priority_queue<EDGE, std::vector<EDGE>, cmp()>::comp’ invalidly declared function type _Compare comp; ^ user.cpp: In constructor ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = EDGE; _Sequence = std::vector<EDGE>; _Compare = cmp()]’: user.cpp:39:45: error: value-initialization of function type ‘cmp()’ priority_queue <EDGE, vector <EDGE>, cmp()> heap; ^ user.cpp:39:45: note: when instantiating default argument for call to std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = EDGE; _Sequence = std::vector<EDGE>; _Compare = cmp()] user.cpp: In function ‘int main()’: user.cpp:94:44: error: no match for ‘operator[]’ (operand types are ‘std::priority_queue<EDGE, std::vector<EDGE>, cmp()>’ and ‘int’) while(!heap.empty() && w[t] >= heap[0].cost) { ^ user.cpp:63:33: warning: unused variable ‘node’ [-Wunused-variable] int n, m, i, x, y, k, t, W, node; ^ In file included from /usr/local/include/c++/4.8.0/bits/stl_algo.h:61:0, from /usr/local/include/c++/4.8.0/algorithm:62, from user.cpp:3: /usr/local/include/c++/4.8.0/bits/stl_heap.h: In instantiation of ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<EDGE*, std::vector<EDGE> >; _Distance = int; _Tp = EDGE; _Compare = cmp (*)()]’: /usr/local/include/c++/4.8.0/bits/stl_heap.h:442:15: required from ‘void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<EDGE*, std::vector<EDGE> >; _Compare = cmp (*)()]’ /usr/local/include/c++/4.8.0/bits/stl_queue.h:411:48: required from ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = EDGE; _Sequence = std::vector<EDGE>; _Compare = cmp()]’ user.cpp:39:45: required from here /usr/local/include/c++/4.8.0/bits/stl_heap.h:310:40: error: too many arguments to function *(__first + (__secondChild - 1)))) ^ /usr/local/include/c++/4.8.0/bits/stl_heap.h:309:4: error: could not convert ‘__comp()’ from ‘cmp’ to ‘bool’ if (__comp(*(__first + __secondChild), ^ /usr/local/include/c++/4.8.0/bits/stl_heap.h: In instantiation of ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<EDGE*, std::vector<EDGE> >; _Distance = int; _Tp = EDGE; _Compare = cmp (*)()]’: /usr/local/include/c++/4.8.0/bits/stl_heap.h:222:58: required from ‘void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<EDGE*, std::vector<EDGE> >; _Compare = cmp (*)()]’ /usr/local/include/c++/4.8.0/bits/stl_queue.h:499:41: required from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = EDGE; _Sequence = std::vector<EDGE>; _Compare = cmp(); std::priority_queue<_Tp, _Sequence, _Compare>::value_type = EDGE]’ user.cpp:55:32: required from here /usr/local/include/c++/4.8.0/bits/stl_heap.h:183:47: error: too many arguments to function && __comp(*(__first + __parent), __value)) ^ /usr/local/include/c++/4.8.0/bits/stl_heap.h:183:7: error: no match for ‘operator&&’ (operand types are ‘bool’ and ‘cmp’) && __comp(*(__first + __parent), __value)) ^ /usr/local/include/c++/4.8.0/bits/stl_heap.h:183:7: note: candidate is: /usr/local/include/c++/4.8.0/bits/stl_heap.h:183:7: note: operator&&(bool, bool) <built-in> /usr/local/include/c++/4.8.0/bits/stl_heap.h:183:7: note: no known conversion for argument 2 from ‘cmp’ to ‘bool’

Ceva nu functioneaza?