| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354804 | scalifrastico_098 | Nile (IOI24_nile) | C++20 | Compilation error | 0 ms | 0 KiB |
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define S second
#define F first
const ll mod=1e18;
ll tc=0;
vector<pair<pair<int, int>, pair<int, int>>> h;
struct DSU
{
vector<ll> mp, im, ns, qh, mi; vector<int> p, ta;
DSU (int n)
{
ta.assign(n, 1); p.resize(n); im.resize(n); mp.assign(n, mod);
ns.resize(n); qh.assign(n, 0); mi.assign(n, mod);
for(int i=0; i<n; i++)
{
p[i]=i; im[i]=h[i].S.F-h[i].S.S; ns[i]=h[i].S.F-h[i].S.S;
}
}
int find(int x)
{
if(p[x]==x)return x; return p[x]=find(x);
}
bool uni(int x, int y)
{
int a=find(x), b=find(y); if(a==b)return false;
tc-=qh[a]; tc-=qh[b]; ll me=min(mp[a], mp[b]), mn=min(im[a], im[b]);
ll uw=ns[a]+ns[b], ik=uw;
if(ta[a]%2)
{
me=min(mp[a], im[b]); mn=min(im[a], mp[b]);
}
if((ta[a]+ta[b])%2){ik=max(uw-me, uw-min(uw, min(mi[a], mi[b])));}
if(ta[a]<ta[b])swap(a, b);
p[b]=a; ta[a]+=ta[b]; mp[a]=me; im[a]=mn; ns[a]=uw; qh[a]=ik;
mi[a]=min(mi[a], mi[b]); tc+=qh[a];
return true;
}
};
vector<long long> calculate_costs(vector<int> w, vector<int> a,vector<int> b, vector<int> e) {
int q = (int)e.size(), n=a.size(); vector<long long> r(q, 0); h.resize(n);
for(int i=0; i<n; i++)h[i]={{w[i],i},{a[i],b[i]}};
sort(h.begin(), h.end());
tc=0; DSU r1(n); vector<pair<int, int>> q1; vector<pair<int, int>> q2;
vector<pair<int, int>> gj(q);
for(int i=0; i<q; i++){gj[i]={e[i], i};} sort(gj.begin(), gj.end());
for(int i=0; i<n; i++)
{
if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
}
sort(q1.rbegin(), q1.rend());
for(int i=0; i<n; i++)
{
if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
}
sort(q2.rbegin(), q2.rend());
for(int c=0; c<q; c++)
{
while(!q1.empty()&&q1.back().F<=gj[c].F)
{
r1.uni(q1.back().S, q1.back().S+1); q1.pop_back();
}
while(!q2.empty()&&q2.back().F<=gj[c].F)
{
int ux=r1.find(q2.back().S), ph=h[q2.back().S+1].S.F-h[q2.back().S+1].S.S;
r1.mi[ux]=min(r1.mi[ux],(ll)ph);
if(r1.ta[ux]%2)
{
tc-=r1.qh[ux]; r1.qh[ux]=max(r1.qh[ux], r1.ns[ux]-min(r1.ns[ux],(ll)ph));
tc+=r1.qh[ux];
}q2.pop_back();
}
r[gj[c].S]=tc;
}
return r;
}Compilation message (stderr)
nile.cpp: In function 'std::vector<long long int> calculate_costs(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
nile.cpp:51:36: error: no match for 'operator-' (operand types are 'std::pair<int, int>' and 'std::pair<int, int>')
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
In file included from /usr/include/c++/13/bits/stl_algobase.h:67,
from /usr/include/c++/13/vector:62,
from nile.h:1,
from nile.cpp:1:
/usr/include/c++/13/bits/stl_iterator.h:625:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__y.base() - __x.base())) std::operator-(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&)'
625 | operator-(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:625:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::reverse_iterator<_IteratorL>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/bits/stl_iterator.h:1800:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__x.base() - __y.base())) std::operator-(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
1800 | operator-(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1800:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::move_iterator<_IteratorL>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
In file included from /usr/include/c++/13/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
from nile.cpp:2:
/usr/include/c++/13/complex:365:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&, const complex<_Tp>&)'
365 | operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:365:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/complex:374:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&, const _Tp&)'
374 | operator-(const complex<_Tp>& __x, const _Tp& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:374:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/complex:383:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const _Tp&, const complex<_Tp>&)'
383 | operator-(const _Tp& __x, const complex<_Tp>& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:383:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/complex:460:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&)'
460 | operator-(const complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/13/complex:460:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
In file included from /usr/include/c++/13/valarray:605,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:166:
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const valarray<_Tp>&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:51:42: note: in expansion of macro 'F'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ^
nile.cpp:51:26: error: no matching function for call to 'std::vector<std::pair<int, int> >::push_back(<brace-enclosed initializer list>)'
51 | if(i+1<n)q1.push_back({h[i+1].F-h[i].F,i});
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66:
/usr/include/c++/13/bits/stl_vector.h:1281:7: note: candidate: 'constexpr void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; value_type = std::pair<int, int>]'
1281 | push_back(const value_type& __x)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1281:35: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const std::vector<std::pair<int, int> >::value_type&' {aka 'const std::pair<int, int>&'}
1281 | push_back(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/13/bits/stl_vector.h:1298:7: note: candidate: 'constexpr void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; value_type = std::pair<int, int>]'
1298 | push_back(value_type&& __x)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1298:30: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'}
1298 | push_back(value_type&& __x)
| ~~~~~~~~~~~~~^~~
nile.cpp:56:36: error: no match for 'operator-' (operand types are 'std::pair<int, int>' and 'std::pair<int, int>')
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/stl_iterator.h:625:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__y.base() - __x.base())) std::operator-(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&)'
625 | operator-(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:625:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::reverse_iterator<_IteratorL>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/stl_iterator.h:1800:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr decltype ((__x.base() - __y.base())) std::operator-(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
1800 | operator-(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1800:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::move_iterator<_IteratorL>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/complex:365:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&, const complex<_Tp>&)'
365 | operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:365:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/complex:374:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&, const _Tp&)'
374 | operator-(const complex<_Tp>& __x, const _Tp& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:374:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/complex:383:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const _Tp&, const complex<_Tp>&)'
383 | operator-(const _Tp& __x, const complex<_Tp>& __y)
| ^~~~~~~~
/usr/include/c++/13/complex:383:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/complex:460:5: note: candidate: 'template<class _Tp> constexpr std::complex<_Tp> std::operator-(const complex<_Tp>&)'
460 | operator-(const complex<_Tp>& __x)
| ^~~~~~~~
/usr/include/c++/13/complex:460:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::complex<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/bits/valarray_after.h:406:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
406 | _DEFINE_EXPR_BINARY_OPERATOR(-, struct std::__minus)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:406:5: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const valarray<_Tp>&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
/usr/include/c++/13/valarray:1197:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__minus, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)'
1197 | _DEFINE_BINARY_OPERATOR(-, __minus)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1197:1: note: template argument deduction/substitution failed:
nile.cpp:6:11: note: 'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
6 | #define F first
| ^~~~~
nile.cpp:56:42: note: in expansion of macro 'F'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ^
nile.cpp:56:26: error: no matching function for call to 'std::vector<std::pair<int, int> >::push_back(<brace-enclosed initializer list>)'
56 | if(i+2<n)q2.push_back({h[i+2].F-h[i].F, i});
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1281:7: note: candidate: 'constexpr void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; value_type = std::pair<int, int>]'
1281 | push_back(const value_type& __x)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1281:35: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const std::vector<std::pair<int, int> >::value_type&' {aka 'const std::pair<int, int>&'}
1281 | push_back(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/13/bits/stl_vector.h:1298:7: note: candidate: 'constexpr void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; value_type = std::pair<int, int>]'
1298 | push_back(value_type&& __x)
| ^~~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1298:30: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'}
1298 | push_back(value_type&& __x)
| ~~~~~~~~~~~~~^~~