Borderou de evaluare (job #3208407)

Utilizator AlexInfoIordachioaiei Alex AlexInfo Data 28 februarie 2024 16:23:09
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:71, from /usr/include/c++/12.2.1/bits/specfun.h:45, from /usr/include/c++/12.2.1/cmath:1935, from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:41, from main.cpp:1: /usr/include/c++/12.2.1/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Value = std::pair<int, int>; _Compare = std::greater<int>]': /usr/include/c++/12.2.1/bits/stl_heap.h:140:48: required from 'constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<int, int>*, vector<pair<int, int> > >; _Distance = long int; _Tp = pair<int, int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<int> >]' /usr/include/c++/12.2.1/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<int, int>*, vector<pair<int, int> > >; _Compare = greater<int>]' /usr/include/c++/12.2.1/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::greater<int>; value_type = std::pair<int, int>]' main.cpp:31:12: required from here /usr/include/c++/12.2.1/bits/predefined_ops.h:196:30: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' 196 | { return bool(_M_comp(*__it, __val)); } | ~~~~~~~^~~~~~~~~~~~~~ In file included from /usr/include/c++/12.2.1/string:48, from /usr/include/c++/12.2.1/bits/locale_classes.h:40, from /usr/include/c++/12.2.1/bits/ios_base.h:41, from /usr/include/c++/12.2.1/ios:42, from /usr/include/c++/12.2.1/istream:38, from /usr/include/c++/12.2.1/sstream:38, from /usr/include/c++/12.2.1/complex:45, from /usr/include/c++/12.2.1/ccomplex:39, from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:54: /usr/include/c++/12.2.1/bits/stl_function.h:397:7: note: candidate: 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' 397 | operator()(const _Tp& __x, const _Tp& __y) const | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_function.h:397:29: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' 397 | operator()(const _Tp& __x, const _Tp& __y) const | ~~~~~~~~~~~^~~ /usr/include/c++/12.2.1/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = std::greater<int>]': /usr/include/c++/12.2.1/bits/stl_heap.h:232:14: required from 'constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<int, int>*, vector<pair<int, int> > >; _Distance = long int; _Tp = pair<int, int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<int> >]' /usr/include/c++/12.2.1/bits/stl_heap.h:264:25: required from 'constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<int, int>*, vector<pair<int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<int> >]' /usr/include/c++/12.2.1/bits/stl_heap.h:333:19: required from 'constexpr void std::pop_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<int, int>*, vector<pair<int, int> > >; _Compare = greater<int>]' /usr/include/c++/12.2.1/bits/stl_queue.h:776:15: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::pop() [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::greater<int>]' main.cpp:37:15: required from here /usr/include/c++/12.2.1/bits/predefined_ops.h:158:30: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ /usr/include/c++/12.2.1/bits/stl_function.h:397:7: note: candidate: 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]' 397 | operator()(const _Tp& __x, const _Tp& __y) const | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_function.h:397:29: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' 397 | operator()(const _Tp& __x, const _Tp& __y) const | ~~~~~~~~~~~^~~ Non zero exit status: 1

Ceva nu functioneaza?