Borderou de evaluare (job #3366787)

Utilizator o_ctFerent Octavian o_ct Data 4 octombrie 2026 12:17:43
Problema Arbore partial de cost minim 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/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, from main.cpp:1: /usr/include/c++/12.2.1/bits/stl_function.h: In instantiation of 'constexpr bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = Muchie]': /usr/include/c++/12.2.1/bits/stl_tree.h:2117:35: required from 'std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_unique_pos(const key_type&) [with _Key = Muchie; _Val = Muchie; _KeyOfValue = std::_Identity<Muchie>; _Compare = std::less<Muchie>; _Alloc = std::allocator<Muchie>; key_type = Muchie]' /usr/include/c++/12.2.1/bits/stl_tree.h:2170:4: required from 'std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = Muchie; _Key = Muchie; _Val = Muchie; _KeyOfValue = std::_Identity<Muchie>; _Compare = std::less<Muchie>; _Alloc = std::allocator<Muchie>]' /usr/include/c++/12.2.1/bits/stl_set.h:521:25: required from 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(value_type&&) [with _Key = Muchie; _Compare = std::less<Muchie>; _Alloc = std::allocator<Muchie>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<Muchie, Muchie, std::_Identity<Muchie>, std::less<Muchie>, std::allocator<Muchie> >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<Muchie>; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<Muchie>, Muchie>::rebind<Muchie>; typename _Alloc::value_type = Muchie; value_type = Muchie]' main.cpp:27:20: required from here /usr/include/c++/12.2.1/bits/stl_function.h:408:20: error: no match for 'operator<' (operand types are 'const Muchie' and 'const Muchie') 408 | { return __x < __y; } | ~~~~^~~~~ In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:67, 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: /usr/include/c++/12.2.1/bits/stl_iterator.h:579:5: note: candidate: 'template<class _IteratorL, class _IteratorR> requires three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&)' (reversed) 579 | operator<=>(const reverse_iterator<_IteratorL>& __x, | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_iterator.h:579:5: note: template argument deduction/substitution failed: /usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const Muchie' is not derived from 'const std::reverse_iterator<_IteratorL>' 408 | { return __x < __y; } | ~~~~^~~~~ /usr/include/c++/12.2.1/bits/stl_iterator.h:1668:5: note: candidate: 'template<class _IteratorL, class _IteratorR> requires three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)' (reversed) 1668 | operator<=>(const move_iterator<_IteratorL>& __x, | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_iterator.h:1668:5: note: template argument deduction/substitution failed: /usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const Muchie' is not derived from 'const std::move_iterator<_IteratorL>' 408 | { return __x < __y; } | ~~~~^~~~~ In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:64: /usr/include/c++/12.2.1/bits/stl_pair.h:647:5: note: candidate: 'template<class _T1, class _T2> constexpr std::common_comparison_category_t<decltype (std::__detail::__synth3way(declval<_T1&>(), declval<_T1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_T2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)' (rewritten) 647 | operator<=>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_pair.h:647:5: note: template argument deduction/substitution failed: /usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const Muchie' is not derived from 'const std::pair<_T1, _T2>' 408 | { return __x < __y; } | ~~~~^~~~~ /usr/include/c++/12.2.1/bits/stl_iterator.h:597:5: note: candidate: 'template<class _Iterator> requires three_way_comparable<_Iterator, std::partial_ordering> constexpr std::compare_three_way_result_t<_Iterator, _Iterator> std::operator<=>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorL>&)' (rewritten) 597 | operator<=>(const reverse_iterator<_Iterator>& __x, | ^~~~~~~~ /usr/include/c++/12.2.1/bits/stl_iterator.h:597:5: note: template argument deduction/substitution failed: /usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const Muchie' is not derived from 'const std::reverse_iterator<_IteratorL>' 408 | { return __x < __y; } Non zero exit status: 1

Ceva nu functioneaza?