| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1178489 | huydarwin | 원 고르기 (APIO18_circle_selection) | C++20 | 컴파일 에러 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ii pii
#define fi first
#define sc second
#define ll long long
#define pll pair<ll,ll>
#define ill pair<int,ll>
#define lli pair<ll,int>
#define inf 2000000000
#define INF inf
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define llinf (ll)1e18
#define LLINF llinf
#define maxn 300005
#define maxm
#define task ""
using namespace std;
int n;
struct{
ll x,y,r;
} a[maxn];
ll dist2(int u,int v){
ll diffx = (a[u].x - a[v].x) * (a[u].x - a[v].x);
ll diffy = (a[u].y - a[v].y) * (a[u].y - a[v].y);
return diffx + diffy;
}
double dist(int u,int v){
return sqrt(dist2(u,v));
}
bool intersect(int u,int v){
return dist2(u,v) <= (a[u].r + a[v].r) * (a[u].r + a[v].r);
}
vector<int> adj[maxn];
int cnt;
int vt[maxn];
int cl[maxn];
int c[maxn];
void sub1(){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j) continue;
if(intersect(i,j)) adj[i].pb(j);
}
}
for(int i=1;i<=n;i++) vt[i]=i;
sort(vt+1,vt+n+1,[](auto u,auto v){
return a[u].r > a[v].r;
});
for(int i=1;i<=n;i++) cl[i]=1;
cnt=n;
int j=1;
while(cnt>0){
while(j<=n && cl[vt[j]] == 0) j++;
cnt--;
cl[vt[j]]=0;
c[vt[j]] = vt[j];
for(auto u: adj[vt[j]]) if(cl[u] == 1){
cnt--;
cl[u] = 0;
c[u] = vt[j];
}
}
for(int i=1;i<=n;i++) cout<<c[i]<<" "; cout<<endl;
}
bool checksub2(){
for(int i=1;i<=n;i++) if(a[i].y != 0) return false;
return true;
}
multiset<lli> bankinh,val;
int cnt2=0;
int luu2[2*maxn];
void sub2(){
for(int i=1;i<=n;i++){
bankinh.insert({-a[i].r, i});
val.insert({a[i].x - a[i].r, i});
val.insert({a[i].x + a[i].r, i});
}
while(!bankinh.empty()){
int u=bankinh.begin()->sc;
bankinh.erase({-a[u].r, u});
val.erase({a[u].x - a[u].r, u});
val.erase({a[u].x + a[u].r, u});
c[u] = u;
cnt2=0;
auto it = val.lower_bound({a[u].x - a[u].r, 0});
for(it;; it++){
if(it==val.end()) break;
if(it->fi > a[u].x + a[u].r) break;
luu2[++cnt2] = it->sc;
}
for(int i=1;i<=cnt2;i++){
int v = luu2[i];
if(c[v] != 0) continue;
bankinh.erase({-a[v].r, v});
val.erase({a[v].x - a[v].r, v});
val.erase({a[v].x + a[v].r, v});
c[v] = u;
}
}
for(int i=1;i<=n;i++) cout<<c[i]<<" "; cout<<endl;
}
set<lli> marker;
pair<lli,int> value[2*maxn];
void sub3(){
for(int i=1;i<=n;i++){
value[i] = {{a[i].y + a[i].r, i}, 1};
value[i+n] = {{a[i].y - a[i].r, i}, 0};
}
for(int i=1;i<=n;i++) c[i]=i;
sort(value+1, value+2*n+1);
reverse(value+1, value+2*n+1);
for(int i=1;i<=2*n;i++){
int id = value[i].fi.sc;
if(value[i].sc == 1){
marker.insert({a[id].x, id});
auto it = marker.lower_bound({a[id].x, id});
if (it != marker.begin()) {
auto itprev = marker.lower_bound({a[id].x, id});
--itprev;
int idprev = itprev -> sc;
if (intersect(id, idprev)) {
if (a[id].r > a[idprev].r) c[idprev] = id;
else if (a[id].r < a[idprev].r) c[id] = idprev;
else if (id < idprev) c[idprev] = id;
else if (id > idprev) c[id] = idprev;
}
}
if (it != marker.rbegin()) {
auto itnext = marker.lower_bound({a[id].x, id});
++itnext;
int idnext = itnext -> sc;
if (intersect(id, idnext)) {
if (a[id].r > a[idnext].r) c[idnext] = id;
else if (a[id].r < a[idnext].r) c[id] = idnext;
else if (id < idnext) c[idnext] = id;
else if (id > idnext) c[id] = idnext;
}
}
}
else{
auto it = marker.lower_bound({a[id].x, id});
if (it != marker.begin() && it != marker.rbegin()) {
auto itprev = marker.lower_bound({a[id].x, id});
--itprev;
int idprev = itprev -> sc;
auto itnext = marker.lower_bound({a[id].x, id});
++itnext;
int idnext = itnext -> sc;
if (intersect(idprev, idnext)) {
if (a[idprev].r > a[idnext].r) c[idnext] = idprev;
else if (a[idprev].r < a[idnext].r) c[idprev] = idnext;
else if (idprev < idnext) c[idnext] = idprev;
else if (idprev > idnext) c[idprev] = idnext;
}
}
marker.erase({a[id].x, id});
}
}
for(int i=1;i<=n;i++) cout<<c[i]<<" "; cout<<endl;
}
int main(){
if (fopen(task".inp","r")) {
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y>>a[i].r;
if(n<=5000) sub1();
else if(checksub2()) sub2();
else sub3();
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
circle_selection.cpp: In function 'void sub3()':
circle_selection.cpp:145:20: error: no match for 'operator!=' (operand types are 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' and 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'})
145 | if (it != marker.rbegin()) {
| ~~ ^~ ~~~~~~~~~~~~~~~
| | |
| | std::set<std::pair<long long int, int> >::reverse_iterator {aka std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >}
| std::_Rb_tree_const_iterator<std::pair<long long int, int> >
In file included from /usr/include/c++/11/regex:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:110,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/regex.h:1230: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>&)' (reversed)
1230 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/regex.h:1230:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/regex:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:110,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/regex.h:1397:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)' (reversed)
1397 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/regex.h:1397:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/regex:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:110,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/regex.h:1569:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)' (reversed)
1569 | operator==(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/regex.h:1569:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/stl_algobase.h:67,
from /usr/include/c++/11/bits/specfun.h:45,
from /usr/include/c++/11/cmath:1935,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_iterator.h:495:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const std::reverse_iterator<_IteratorL>&, const std::reverse_iterator<_IteratorR>&) requires requires{{std::operator==::__x->base() == std::operator==::__y->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];}' (reversed)
495 | operator==(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/stl_iterator.h:495:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::reverse_iterator<_IteratorR>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/stl_algobase.h:67,
from /usr/include/c++/11/bits/specfun.h:45,
from /usr/include/c++/11/cmath:1935,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_iterator.h:1585:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator==(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorR>&) requires requires{{std::operator==::__x->base() == std::operator==::__y->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];}' (reversed)
1585 | operator==(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/stl_iterator.h:1585:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::move_iterator<_IteratorL>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/string:41,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/allocator.h:218:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator==(const std::allocator<_CharT>&, const std::allocator<_T2>&)' (reversed)
218 | operator==(const allocator<_T1>&, const allocator<_T2>&)
| ^~~~~~~~
/usr/include/c++/11/bits/allocator.h:218:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::allocator<_CharT>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/basic_string.h:48,
from /usr/include/c++/11/string:55,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/string_view:541:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(std::basic_string_view<_CharT, _Traits>, std::__type_identity_t<std::basic_string_view<_CharT, _Traits> >)' (reversed)
541 | operator==(basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/11/string_view:541:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >' is not derived from 'std::basic_string_view<_CharT, _Traits>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/string:55,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/basic_string.h:6248:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const _CharT*)' (reversed)
6248 | operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/basic_string.h:6248:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/complex:469:5: note: candidate: 'template<class _Tp> constexpr bool std::operator==(const std::complex<_Tp>&, const _Tp&)' (reversed)
469 | operator==(const complex<_Tp>& __x, const _Tp& __y)
| ^~~~~~~~
/usr/include/c++/11/complex:469:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::complex<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/functional:54,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/tuple:1524:5: note: candidate: 'template<class ... _TElements, class ... _UElements> constexpr bool std::operator==(const std::tuple<_Tps ...>&, const std::tuple<_UTypes ...>&)' (reversed)
1524 | operator==(const tuple<_TElements...>& __t,
| ^~~~~~~~
/usr/include/c++/11/tuple:1524:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::tuple<_Tps ...>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/functional:59,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/std_function.h:718:5: note: candidate: 'template<class _Res, class ... _Args> bool std::operator==(const std::function<_Res(_ArgTypes ...)>&, std::nullptr_t)' (reversed)
718 | operator==(const function<_Res(_Args...)>& __f, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/11/bits/std_function.h:718:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::function<_Res(_ArgTypes ...)>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/locale_conv.h:41,
from /usr/include/c++/11/locale:43,
from /usr/include/c++/11/iomanip:43,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/unique_ptr.h:753:5: note: candidate: 'template<class _Tp, class _Dp, class _Up, class _Ep> bool std::operator==(const std::unique_ptr<_Tp, _Dp>&, const std::unique_ptr<_Up, _Ep>&)' (reversed)
753 | operator==(const unique_ptr<_Tp, _Dp>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/unique_ptr.h:753:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::unique_ptr<_Tp, _Dp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/locale_conv.h:41,
from /usr/include/c++/11/locale:43,
from /usr/include/c++/11/iomanip:43,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:72,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/unique_ptr.h:760:5: note: candidate: 'template<class _Tp, class _Dp> bool std::operator==(const std::unique_ptr<_Tp, _Dp>&, std::nullptr_t)' (reversed)
760 | operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/11/bits/unique_ptr.h:760:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::unique_ptr<_Tp, _Dp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/shared_ptr.h:53,
from /usr/include/c++/11/memory:77,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:82,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/shared_ptr_base.h:1410:5: note: candidate: 'template<class _Tp1, class _Tp2, __gnu_cxx::_Lock_policy _Lp> bool std::operator==(const std::__shared_ptr<_Tp1, _Lp>&, const std::__shared_ptr<_Tp2, _Lp>&)' (reversed)
1410 | operator==(const __shared_ptr<_Tp1, _Lp>& __a,
| ^~~~~~~~
/usr/include/c++/11/bits/shared_ptr_base.h:1410:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__shared_ptr<_Tp1, _Lp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/shared_ptr.h:53,
from /usr/include/c++/11/memory:77,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:82,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/shared_ptr_base.h:1416:5: note: candidate: 'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator==(const std::__shared_ptr<_Tp, _Lp>&, std::nullptr_t)' (reversed)
1416 | operator==(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/11/bits/shared_ptr_base.h:1416:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::__shared_ptr<_Tp, _Lp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/memory:77,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:82,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/shared_ptr.h:437:5: note: candidate: 'template<class _Tp, class _Up> bool std::operator==(const std::shared_ptr<_Tp>&, const std::shared_ptr<_Tp>&)' (reversed)
437 | operator==(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept
| ^~~~~~~~
/usr/include/c++/11/bits/shared_ptr.h:437:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::shared_ptr<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/memory:77,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:82,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/shared_ptr.h:443:5: note: candidate: 'template<class _Tp> bool std::operator==(const std::shared_ptr<_Tp>&, std::nullptr_t)' (reversed)
443 | operator==(const shared_ptr<_Tp>& __a, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/11/bits/shared_ptr.h:443:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::shared_ptr<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/valarray:603,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/valarray_after.h:417:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::_Expr<_Dom2, typename _Dom2::value_type>&)' (reversed)
417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/valarray:603,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/valarray_after.h:417:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)' (reversed)
417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/valarray:603,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/valarray_after.h:417:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const typename _Dom::value_type&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)' (reversed)
417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/valarray:603,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/valarray_after.h:417:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::valarray<typename _Dom::value_type>&)' (reversed)
417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/valarray:603,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/valarray_after.h:417:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const std::valarray<typename _Dom::value_type>&, const std::_Expr<_Dom1, typename _Dom1::value_type>&)' (reversed)
417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/valarray:1198:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__equal_to, _Tp>::result_type> std::operator==(const std::valarray<_Tp>&, const typename std::valarray<_Tp>::value_type&)' (reversed)
1198 | _DEFINE_BINARY_OPERATOR(==, __equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/valarray:1198:1: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::valarray<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:95,
from circle_selection.cpp:1:
/usr/include/c++/11/valarray:1198:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__equal_to, _Tp>::result_type> std::operator==(const typename std::valarray<_Tp>::value_type&, const std::valarray<_Tp>&)' (reversed)
1198 | _DEFINE_BINARY_OPERATOR(==, __equal_to)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/valarray:1198:1: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::valarray<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:111,
from circle_selection.cpp:1:
/usr/include/c++/11/scoped_allocator:499:5: note: candidate: 'template<class _OutA1, class _OutA2, class ... _InA> bool std::operator==(const std::scoped_allocator_adaptor<_OutA1, _InA ...>&, const std::scoped_allocator_adaptor<_InnerHead, _InnerTail ...>&)' (reversed)
499 | operator==(const scoped_allocator_adaptor<_OutA1, _InA...>& __a,
| ^~~~~~~~
/usr/include/c++/11/scoped_allocator:499:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::scoped_allocator_adaptor<_OutA1, _InA ...>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:130,
from circle_selection.cpp:1:
/usr/include/c++/11/optional:1045:5: note: candidate: 'template<class _Tp, class _Up> constexpr std::__optional_eq_t<_Tp, _Up> std::operator==(const std::optional<_Tp>&, const std::optional<_Up>&)' (reversed)
1045 | operator==(const optional<_Tp>& __lhs, const optional<_Up>& __rhs)
| ^~~~~~~~
/usr/include/c++/11/optional:1045:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::optional<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:130,
from circle_selection.cpp:1:
/usr/include/c++/11/optional:1105:5: note: candidate: 'template<class _Tp> constexpr bool std::operator==(const std::optional<_Tp>&, std::nullopt_t)' (reversed)
1105 | operator==(const optional<_Tp>& __lhs, nullopt_t) noexcept
| ^~~~~~~~
/usr/include/c++/11/optional:1105:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::optional<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:130,
from circle_selection.cpp:1:
/usr/include/c++/11/optional:1173:5: note: candidate: 'template<class _Tp, class _Up> constexpr std::__optional_eq_t<_Tp, _Up> std::operator==(const std::optional<_Tp>&, const _Up&)' (reversed)
1173 | operator==(const optional<_Tp>& __lhs, const _Up& __rhs)
| ^~~~~~~~
/usr/include/c++/11/optional:1173:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} is not derived from 'const std::optional<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:130,
from circle_selection.cpp:1:
/usr/include/c++/11/optional:1179:5: note: candidate: 'template<class _Tp, class _Up> constexpr std::__optional_eq_t<_Up, _Tp> std::operator==(const _Up&, const std::optional<_Tp>&)' (reversed)
1179 | operator==(const _Up& __lhs, const optional<_Tp>& __rhs)
| ^~~~~~~~
/usr/include/c++/11/optional:1179:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::optional<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/ios_base.h:46,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/system_error:368:3: note: candidate: 'bool std::operator==(const std::error_code&, const std::error_condition&)' (reversed)
368 | operator==(const error_code& __lhs, const error_condition& __rhs) noexcept
| ^~~~~~~~
/usr/include/c++/11/system_error:368:32: note: no known conversion for argument 1 from 'std::set<std::pair<long long int, int> >::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_const_iterator<std::pair<long long int, int> > >'} to 'const std::error_code&'
368 | operator==(const error_code& __lhs, const error_condition& __rhs) noexcept
| ~~~~~~~~~~~~~~~~~~^~~~~
In file included from /usr/include/c++/11/regex:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:110,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/regex.h:1059:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator==(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)' (rewritten)
1059 | operator==(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
| ^~~~~~~~
/usr/include/c++/11/bits/regex.h:1059:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/regex:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:110,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/regex.h:2125:5: note: candidate: 'template<class _Bi_iter, class _Alloc> bool std::__cxx11::operator==(const std::__cxx11::match_results<_BiIter, _Alloc>&, const std::__cxx11::match_results<_BiIter, _Alloc>&)' (rewritten)
2125 | operator==(const match_results<_Bi_iter, _Alloc>& __m1,
| ^~~~~~~~
/usr/include/c++/11/bits/regex.h:2125:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::__cxx11::match_results<_BiIter, _Alloc>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/stl_algobase.h:64,
from /usr/include/c++/11/bits/specfun.h:45,
from /usr/include/c++/11/cmath:1935,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_pair.h:466:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator==(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)' (rewritten)
466 | operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
| ^~~~~~~~
/usr/include/c++/11/bits/stl_pair.h:466:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::pair<_T1, _T2>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/stl_algobase.h:67,
from /usr/include/c++/11/bits/specfun.h:45,
from /usr/include/c++/11/cmath:1935,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_iterator.h:547:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const std::reverse_iterator<_IteratorL>&, const std::reverse_iterator<_IteratorL>&) requires requires{{std::operator==::__x->base() == std::operator==::__y->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];}' (rewritten)
547 | operator==(const reverse_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/stl_iterator.h:547:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::reverse_iterator<_IteratorL>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/stl_algobase.h:67,
from /usr/include/c++/11/bits/specfun.h:45,
from /usr/include/c++/11/cmath:1935,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_iterator.h:1648:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator==(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorL>&)' (rewritten)
1648 | operator==(const move_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/stl_iterator.h:1648:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::move_iterator<_IteratorL>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/iosfwd:40,
from /usr/include/c++/11/ios:38,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/postypes.h:222:5: note: candidate: 'template<class _StateT> bool std::operator==(const std::fpos<_StateT>&, const std::fpos<_StateT>&)' (rewritten)
222 | operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
| ^~~~~~~~
/usr/include/c++/11/bits/postypes.h:222:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::fpos<_StateT>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/basic_string.h:48,
from /usr/include/c++/11/string:55,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/string_view:535:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator==(std::basic_string_view<_CharT, _Traits>, std::basic_string_view<_CharT, _Traits>)' (rewritten)
535 | operator==(basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/11/string_view:535:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'std::basic_string_view<_CharT, _Traits>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/string:55,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/basic_string.h:6226:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&)' (rewritten)
6226 | operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/basic_string.h:6226:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/string:55,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/basic_string.h:6234:5: note: candidate: 'template<class _CharT> typename __gnu_cxx::__enable_if<std::__is_char<_Tp>::__value, bool>::__type std::operator==(const std::__cxx11::basic_string<_CharT>&, const std::__cxx11::basic_string<_CharT>&)' (rewritten)
6234 | operator==(const basic_string<_CharT>& __lhs,
| ^~~~~~~~
/usr/include/c++/11/bits/basic_string.h:6234:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::__cxx11::basic_string<_CharT>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/bits/locale_facets.h:48,
from /usr/include/c++/11/bits/basic_ios.h:37,
from /usr/include/c++/11/ios:44,
from /usr/include/c++/11/istream:38,
from /usr/include/c++/11/sstream:38,
from /usr/include/c++/11/complex:45,
from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/streambuf_iterator.h:226:5: note: candidate: 'template<class _CharT, class _Traits> bool std::operator==(const std::istreambuf_iterator<_CharT, _Traits>&, const std::istreambuf_iterator<_CharT, _Traits>&)' (rewritten)
226 | operator==(const istreambuf_iterator<_CharT, _Traits>& __a,
| ^~~~~~~~
/usr/include/c++/11/bits/streambuf_iterator.h:226:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::istreambuf_iterator<_CharT, _Traits>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
from circle_selection.cpp:1:
/usr/include/c++/11/complex:464:5: note: candidate: 'template<class _Tp> constexpr bool std::operator==(const std::complex<_Tp>&, const std::complex<_Tp>&)' (rewritten)
464 | operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)
| ^~~~~~~~
/usr/include/c++/11/complex:464:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::complex<_Tp>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/tuple:39,
from /usr/include/c++/11/functional:54,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/array:276:5: note: candidate: 'template<class _Tp, long unsigned int _Nm> constexpr bool std::operator==(const std::array<_Tp, _Nm>&, const std::array<_Tp, _Nm>&)' (rewritten)
276 | operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
| ^~~~~~~~
/usr/include/c++/11/array:276:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::array<_Tp, _Nm>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:2134:5: note: candidate: 'template<class _Key1, class _Tp1, class _Hash1, class _Pred1, class _Alloc1> bool std::operator==(const std::unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&, const std::unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&)' (rewritten)
2134 | operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:2134:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:2148:5: note: candidate: 'template<class _Key1, class _Tp1, class _Hash1, class _Pred1, class _Alloc1> bool std::operator==(const std::unordered_multimap<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&, const std::unordered_multimap<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&)' (rewritten)
2148 | operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:2148:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::unordered_multimap<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/vector:67,
from /usr/include/c++/11/functional:62,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_vector.h:1892:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator==(const std::vector<_Tp, _Alloc>&, const std::vector<_Tp, _Alloc>&)' (rewritten)
1892 | operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/11/bits/stl_vector.h:1892:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::vector<_Tp, _Alloc>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/deque:67,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:68,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_deque.h:2247:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator==(const std::deque<_Tp, _Alloc>&, const std::deque<_Tp, _Alloc>&)' (rewritten)
2247 | operator==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/11/bits/stl_deque.h:2247:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::deque<_Tp, _Alloc>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/list:63,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:79,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_list.h:2030:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator==(const std::__cxx11::list<_Tp, _Alloc>&, const std::__cxx11::list<_Tp, _Alloc>&)' (rewritten)
2030 | operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/11/bits/stl_list.h:2030:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::__cxx11::list<_Tp, _Alloc>'
145 | if (it != marker.rbegin()) {
| ^
In file included from /usr/include/c++/11/map:61,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:81,
from circle_selection.cpp:1:
/usr/include/c++/11/bits/stl_map.h:1463:5: note: candidate: 'template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator==(const std::map<_Key, _Tp, _Compare, _Allocator>&, const std::map<_Key, _Tp, _Compare, _Allocator>&)' (rewritten)
1463 | operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/11/bits/stl_map.h:1463:5: note: template argument deduction/substitution failed:
circle_selection.cpp:145:37: note: 'std::_Rb_tree_const_iterator<std::pair<long long int, int> >' is not derived from 'const std::map<_Key, _Tp, _Compare, _Allocator>'
14