Borderou de evaluare (job #2198409)

Utilizator marian98Horodnic Gheorghe Marian marian98 Data 24 aprilie 2018 14:34:25
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void dijsktra(int)’: user.cpp:49:13: warning: unused variable ‘cost’ [-Wunused-variable] int cost = heap.top().cost; ^~~~ In file included from /usr/include/c++/6/string:48:0, from /usr/include/c++/6/bits/locale_classes.h:40, from /usr/include/c++/6/bits/ios_base.h:41, from /usr/include/c++/6/ios:42, from /usr/include/c++/6/ostream:38, from /usr/include/c++/6/iostream:39, from user.cpp:1: /usr/include/c++/6/bits/stl_function.h: In instantiation of ‘bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = Edge]’: /usr/include/c++/6/bits/predefined_ops.h:147:11: required from ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Value = Edge; _Compare = std::less<Edge>]’ /usr/include/c++/6/bits/stl_heap.h:129:48: required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Distance = int; _Tp = Edge; _Compare = __gnu_cxx::__ops::_Iter_comp_val<std::less<Edge> >]’ /usr/include/c++/6/bits/stl_heap.h:201:23: required from ‘void std::push_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Edge*, std::vector<Edge> >; _Compare = std::less<Edge>]’ /usr/include/c++/6/bits/stl_queue.h:569:16: required from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Edge; _Sequence = std::vector<Edge>; _Compare = std::less<Edge>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Edge]’ user.cpp:45:30: required from here /usr/include/c++/6/bits/stl_function.h:386:20: error: no match for ‘operator<’ (operand types are ‘const Edge’ and ‘const Edge’) { return __x < __y; } ~~~~^~~~~ In file included from /usr/include/c++/6/bits/stl_algobase.h:64:0, from /usr/include/c++/6/bits/char_traits.h:39, from /usr/include/c++/6/ios:40, from /usr/include/c++/6/ostream:38, from /usr/include/c++/6/iostream:39, from user.cpp:1: /usr/include/c++/6/bits/stl_pair.h:441:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) ^~~~~~~~ /usr/include/c++/6/bits/stl_pair.h:441:5: note: template argument deduction/substitution failed: In file included from /usr/include/c++/6/string:48:0, from /usr/include/c++/6/bits/locale_classes.h:40, from /usr/include/c++/6/bits/ios_base.h:41, from /usr/include/c++/6/ios:42, from /usr/include/c++/6/ostream:38, from /usr/include/c++/6/iostream:39, from user.cpp:1: /usr/include/c++/6/bits/stl_function.h:386:20: note: ‘const Edge’ is not derived from ‘const std::pair<_T1, _T2>’ { return __x < __y; } ~~~~^~~~~ In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0, from /usr/include/c++/6/bits/char_traits.h:39, from /usr/include/c++/6/ios:40, from /usr/include/c++/6/ostream:38, from /usr/include/c++/6/iostream:39, from user.cpp:1: /usr/include/c++/6/bits/stl_iterator.h:298:5: note: candidate: template<class _Iterator> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&) operator<(const reverse_iterator<_Iterator>& __x, ^~~~~~~~ /usr/include/c++/6/bits/stl_iterator.h:298:5: note: template argument deduction/substitution failed:

Ceva nu functioneaza?