Borderou de evaluare (job #2969167)

Utilizator Teodor94Teodor Plop Teodor94 Data 22 ianuarie 2023 17:20:58
Problema Cele mai apropiate puncte din plan Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: main.cpp: In function 'int main()': main.cpp:38:71: warning: narrowing conversion of '((double)points[i].Point::y - minDist)' from 'double' to 'int' [-Wnarrowing] 38 | auto firstIt = activePoints.lower_bound({INT_MIN, points[i].y - minDist}); | ~~~~~~~~~~~~^~~~~~~~~ main.cpp:39:24: error: no match for 'operator<' (operand types are 'std::_Rb_tree_const_iterator<Point>' and 'std::set<Point, bool (*)(const Point&, const Point&)>::iterator' {aka 'std::_Rb_tree<Point, Point, std::_Identity<Point>, bool (*)(const Point&, const Point&), std::allocator<Point> >::const_iterator'}) 39 | while (firstIt < activePoints.end() && firstIt->y - points[i].y <= minDist) { | ~~~~~~~ ^ ~~~~~~~~~~~~~~~~~~ | | | | | _Rb_tree_const_iterator<[...]> | _Rb_tree_const_iterator<[...]> In file included from /usr/include/c++/10/regex:62, from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110, from main.cpp:1: /usr/include/c++/10/bits/regex.h:1075:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator<(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)' 1075 | operator<(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs) | ^~~~~~~~ /usr/include/c++/10/bits/regex.h:1075:5: note: template argument deduction/substitution failed: main.cpp:39:43: note: 'std::_Rb_tree_const_iterator<Point>' is not derived from 'const std::__cxx11::sub_match<_BiIter>' 39 | while (firstIt < activePoints.end() && firstIt->y - points[i].y <= minDist) { | ^ In file included from /usr/include/c++/10/regex:62, from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110, from main.cpp:1: /usr/include/c++/10/bits/regex.h:1156:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<(std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const std::__cxx11::sub_match<_BiIter>&)' 1156 | operator<(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs, | ^~~~~~~~ /usr/include/c++/10/bits/regex.h:1156:5: note: template argument deduction/substitution failed: main.cpp:39:43: note: 'std::_Rb_tree_const_iterator<Point>' is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>' 39 | while (firstIt < activePoints.end() && firstIt->y - points[i].y <= minDist) { | ^ In file included from /usr/include/c++/10/regex:62, from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110, from main.cpp:1: /usr/include/c++/10/bits/regex.h:1249:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<(const std::__cxx11::sub_match<_BiIter>&, std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)' 1249 | operator<(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/10/bits/regex.h:1249:5: note: template argument deduction/substitution failed: main.cpp:39:43: note: 'std::_Rb_tree_const_iterator<Point>' is not derived from 'const std::__cxx11::sub_match<_BiIter>' 39 | while (firstIt < activePoints.end() && firstIt->y - points[i].y <= minDist) { | ^ In file included from /usr/include/c++/10/regex:62, from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110, from main.cpp:1: /usr/include/c++/10/bits/regex.h:1323:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator<(const typename std::iterator_traits<_Iter>::value_type*, const std::__cxx11::sub_match<_BiIter>&)' 1323 | operator<(typename iterator_traits<_Bi_iter>::value_type const* __lhs, | ^~~~~~~~ /usr/include/c++/10/bits/regex.h:1323:5: note: template argument deduction/substitution failed: main.cpp:39:43: note: 'std::set<Point, bool (*)(const Point&, const Point&)>::iterator' {aka 'std::_Rb_tree<Point, Point, std::_Identity<Point>, bool (*)(const Point&, const Point&), std::allocator<Point> >::const_iterator'} is not derived from 'const std::__cxx11::sub_match<_BiIter>' 39 | while (firstIt < activePoints.end() && firstIt->y - points[i].y <= minDist) { | ^ Non zero exit status: 1

Ceva nu functioneaza?