| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1302105 | mikolaj00 | Robot (JOI21_ho_t4) | C++20 | Compilation error | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Edge
{
int v, c;
ll p;
};
struct Node
{
int v, from, c;
ll p;
friend bool operator==(Node const& n1, Node const& n2)
{
return make_tuple(n1.v, n1.from, n1.c, n1.p) == make_tuple(n2.v, n2.from, n2.c, n2.p);
}
};
struct NodeHash
{
size_t operator()(Node const& n) const
{
return hash(make_tuple(n.v, n.from, n.c, n.p));
}
};
vector<vector<Edge>> g;
vector<unordered_map<int, int>> cnt;
vector<unordered_map<int, ll>> cost;
ll dijkstra()
{
priority_queue<pair<ll, Node>, vector<pair<ll, Node>>, greater<pair<ll, Node>>> pq;
pq.push({0LL, {1, 0, 0, 0LL}});
unordered_map<Node, ll, NodeHash> dist;
dist[{1, 0, 0, 0LL}] = 0LL;
unordered_set<Node, NodeHash> processed;
while (!pq.empty())
{
auto[d, u] = pq.top();
pq.pop();
if (u.v == g.size()-1)
return d;
if (processed.count(u))
continue;
processed.insert(u);
for (auto e : g[u.v])
{
if (e.v == u.from)
continue;
ll w = e.p;
Node v = {e.v, u.v, e.c, e.p};
if (!dist.count(v) || dist[u] + w < dist[v])
{
pq.push({dist[u] + w, v});
dist[v] = dist[u] + w;
}
}
for (auto e : g[u.v])
{
if (e.v == u.from)
continue;
ll w = cost[u.v][e.c] - e.p;
if (u.c == e.c)
w -= u.p;
Node v = {e.v, u.v, 0, 0LL};
if (!dist.count(v) || dist[u] + w < dist[v])
{
pq.push({dist[u] + w, v});
dist[v] = dist[u] + w;
}
}
}
return -1LL;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
g = vector<vector<Edge>>(n+1);
cnt = vector<unordered_map<int, int>>(n+1);
cost = vector<unordered_map<int, ll>>(n+1);
for (int i = 0; i < m; i++)
{
int a, b, c;
ll p;
cin >> a >> b >> c >> p;
g[a].push_back({b, c, p});
g[b].push_back({a, c, p});
cnt[a][c]++;
cnt[b][c]++;
cost[a][c] += p;
cost[b][c] += p;
}
ll ans = dijkstra();
cout << ans;
}
Compilation message (stderr)
Main.cpp: In member function 'size_t NodeHash::operator()(const Node&) const':
Main.cpp:26:54: error: class template argument deduction failed:
26 | return hash(make_tuple(n.v, n.from, n.c, n.p));
| ^
Main.cpp:26:54: error: no matching function for call to 'hash(std::tuple<int, int, int, long long int>)'
In file included from /usr/include/c++/13/string_view:42,
from /usr/include/c++/13/bits/basic_string.h:47,
from /usr/include/c++/13/string:54,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from Main.cpp:1:
/usr/include/c++/13/bits/functional_hash.h:59:12: note: candidate: 'template<class _Tp> hash()-> std::hash<_Tp>'
59 | struct hash;
| ^~~~
/usr/include/c++/13/bits/functional_hash.h:59:12: note: template argument deduction/substitution failed:
Main.cpp:26:54: note: candidate expects 0 arguments, 1 provided
26 | return hash(make_tuple(n.v, n.from, n.c, n.p));
| ^
/usr/include/c++/13/bits/functional_hash.h:59:12: note: candidate: 'template<class _Tp> hash(std::hash<_Tp>)-> std::hash<_Tp>'
59 | struct hash;
| ^~~~
/usr/include/c++/13/bits/functional_hash.h:59:12: note: template argument deduction/substitution failed:
Main.cpp:26:54: note: 'std::tuple<int, int, int, long long int>' is not derived from 'std::hash<_Tp>'
26 | return hash(make_tuple(n.v, n.from, n.c, n.p));
| ^
In file included from /usr/include/c++/13/string:49:
/usr/include/c++/13/bits/stl_function.h: In instantiation of 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::pair<long long int, Node>]':
/usr/include/c++/13/bits/predefined_ops.h:196:23: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, Node>*, std::vector<std::pair<long long int, Node> > >; _Value = std::pair<long long int, Node>; _Compare = std::greater<std::pair<long long int, Node> >]'
/usr/include/c++/13/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<long long int, Node>*, vector<pair<long long int, Node> > >; _Distance = long int; _Tp = pair<long long int, Node>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<long long int, Node> > >]'
/usr/include/c++/13/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, Node>*, vector<pair<long long int, Node> > >; _Compare = greater<pair<long long int, Node> >]'
/usr/include/c++/13/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<long long int, Node>; _Sequence = std::vector<std::pair<long long int, Node> >; _Compare = std::greater<std::pair<long long int, Node> >; value_type = std::pair<long long int, Node>]'
Main.cpp:37:12: required from here
/usr/include/c++/13/bits/stl_function.h:398:20: error: no match for 'operator>' (operand types are 'const std::pair<long long int, Node>' and 'const std::pair<long long int, Node>')
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:67,
from /usr/include/c++/13/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51:
/usr/include/c++/13/bits/stl_iterator.h:583: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)
583 | operator<=>(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:583:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::reverse_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/stl_iterator.h:1690: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)
1690 | operator<=>(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1690:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::move_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/regex:68,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:181:
/usr/include/c++/13/bits/regex.h:1288:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Alloc> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)' (reversed)
1288 | operator<=>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/regex.h:1288:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/regex.h:1456:5: note: candidate: 'template<class _Bi_iter> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)' (reversed)
1456 | operator<=>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/regex.h:1456:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/regex.h:1629:5: note: candidate: 'template<class _Bi_iter> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)' (reversed)
1629 | operator<=>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/regex.h:1629:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:79:
/usr/include/c++/13/optional:1439:5: note: candidate: 'template<class _Tp, class _Up> requires !(__is_optional_v<_Up>) && (three_way_comparable_with<_Up, _Tp, std::partial_ordering>) constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const optional<_Tp>&, const _Up&)' (reversed)
1439 | operator<=>(const optional<_Tp>& __x, const _Up& __v)
| ^~~~~~~~
/usr/include/c++/13/optional:1439:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::optional<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/optional:1302:5: note: candidate: 'template<class _Tp> constexpr std::strong_ordering std::operator<=>(const optional<_Tp>&, nullopt_t)' (reversed)
1302 | operator<=>(const optional<_Tp>& __x, nullopt_t) noexcept
| ^~~~~~~~
/usr/include/c++/13/optional:1302:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::optional<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/optional:1287:5: note: candidate: 'template<class _Tp, class _Up> requires three_way_comparable_with<_Up, _Tp, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const optional<_Tp>&, const optional<_Up>&)' (reversed)
1287 | operator<=>(const optional<_Tp>& __x, const optional<_Up>& __y)
| ^~~~~~~~
/usr/include/c++/13/optional:1287:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::optional<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/memory:80,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:56:
/usr/include/c++/13/bits/shared_ptr.h:573:5: note: candidate: 'template<class _Tp> std::strong_ordering std::operator<=>(const shared_ptr<_Tp>&, nullptr_t)' (reversed)
573 | operator<=>(const shared_ptr<_Tp>& __a, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/13/bits/shared_ptr.h:573:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::shared_ptr<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/shared_ptr.h:567:5: note: candidate: 'template<class _Tp, class _Up> std::strong_ordering std::operator<=>(const shared_ptr<_Tp>&, const shared_ptr<_Tp>&)' (reversed)
567 | operator<=>(const shared_ptr<_Tp>& __a,
| ^~~~~~~~
/usr/include/c++/13/bits/shared_ptr.h:567:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::shared_ptr<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/bits/shared_ptr.h:53:
/usr/include/c++/13/bits/shared_ptr_base.h:1811:5: note: candidate: 'template<class _Tp, __gnu_cxx::_Lock_policy _Lp> std::strong_ordering std::operator<=>(const __shared_ptr<_Tp, _Lp>&, nullptr_t)' (reversed)
1811 | operator<=>(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept
| ^~~~~~~~
/usr/include/c++/13/bits/shared_ptr_base.h:1811:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__shared_ptr<_Tp, _Lp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/shared_ptr_base.h:1805:5: note: candidate: 'template<class _Tp, class _Up, __gnu_cxx::_Lock_policy _Lp> std::strong_ordering std::operator<=>(const __shared_ptr<_Tp1, _Lp>&, const __shared_ptr<_Tp2, _Lp>&)' (reversed)
1805 | operator<=>(const __shared_ptr<_Tp, _Lp>& __a,
| ^~~~~~~~
/usr/include/c++/13/bits/shared_ptr_base.h:1805:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__shared_ptr<_Tp1, _Lp>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/memory:78:
/usr/include/c++/13/bits/unique_ptr.h:997:5: note: candidate: 'template<class _Tp, class _Dp> requires three_way_comparable<typename std::unique_ptr<_Tp, _Dp>::pointer, std::partial_ordering> std::compare_three_way_result_t<typename std::unique_ptr<_Tp, _Dp>::pointer> std::operator<=>(const unique_ptr<_Tp, _Dp>&, nullptr_t)' (reversed)
997 | operator<=>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:997:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::unique_ptr<_Tp, _Dp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/unique_ptr.h:988:5: note: candidate: 'template<class _Tp, class _Dp, class _Up, class _Ep> requires three_way_comparable_with<typename std::unique_ptr<_Tp, _Dp>::pointer, typename std::unique_ptr<_Up, _Ep>::pointer, std::partial_ordering> std::compare_three_way_result_t<typename std::unique_ptr<_Tp, _Dp>::pointer, typename std::unique_ptr<_Up, _Ep>::pointer> std::operator<=>(const unique_ptr<_Tp, _Dp>&, const unique_ptr<_Up, _Ep>&)' (reversed)
988 | operator<=>(const unique_ptr<_Tp, _Dp>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:988:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::unique_ptr<_Tp, _Dp>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/bits/uses_allocator_args.h:38,
from /usr/include/c++/13/bits/memory_resource.h:41,
from /usr/include/c++/13/string:58:
/usr/include/c++/13/tuple:1952:5: note: candidate: 'template<class ... _Tps, class ... _Ups> constexpr std::common_comparison_category_t<decltype (std::__detail::__synth3way(declval<_Tps&>(), declval<_Ups&>()))...> std::operator<=>(const tuple<_UTypes ...>&, const tuple<_UTypes ...>&)' (reversed)
1952 | operator<=>(const tuple<_Tps...>& __t, const tuple<_Ups...>& __u)
| ^~~~~~~~
/usr/include/c++/13/tuple:1952:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::tuple<_UTypes ...>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/basic_string.h:3760:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> constexpr decltype (__char_traits_cmp_cat<_Traits>(0)) std::operator<=>(const __cxx11::basic_string<_CharT, _Traits, _Allocator>&, const _CharT*)' (reversed)
3760 | operator<=>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3760:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/string_view:633:5: note: candidate: 'template<class _CharT, class _Traits> constexpr decltype (__char_traits_cmp_cat<_Traits>(0)) std::operator<=>(basic_string_view<_CharT, _Traits>, __type_identity_t<basic_string_view<_CharT, _Traits> >)' (reversed)
633 | operator<=>(basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/13/string_view:633:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'std::pair<long long int, Node>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:64:
/usr/include/c++/13/bits/stl_pair.h:819: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)
819 | operator<=>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_pair.h:819:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/13/bits/stl_pair.h:65:
/usr/include/c++/13/compare: In substitution of '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>&) [with _T1 = long long int; _T2 = Node]':
/usr/include/c++/13/bits/stl_function.h:398:20: required from 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::pair<long long int, Node>]'
/usr/include/c++/13/bits/predefined_ops.h:196:23: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, Node>*, std::vector<std::pair<long long int, Node> > >; _Value = std::pair<long long int, Node>; _Compare = std::greater<std::pair<long long int, Node> >]'
/usr/include/c++/13/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<long long int, Node>*, vector<pair<long long int, Node> > >; _Distance = long int; _Tp = pair<long long int, Node>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<long long int, Node> > >]'
/usr/include/c++/13/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, Node>*, vector<pair<long long int, Node> > >; _Compare = greater<pair<long long int, Node> >]'
/usr/include/c++/13/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<long long int, Node>; _Sequence = std::vector<std::pair<long long int, Node> >; _Compare = std::greater<std::pair<long long int, Node> >; value_type = std::pair<long long int, Node>]'
Main.cpp:37:12: required from here
/usr/include/c++/13/compare:1239:41: error: no match for call to '(const std::__detail::_Synth3way) (Node&, Node&)'
1239 | = decltype(__detail::__synth3way(std::declval<_Tp&>(),
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
1240 | std::declval<_Up&>()));
| ~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/compare:1214:9: note: candidate: 'template<class _Tp, class _Up> constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];}'
1214 | operator()(const _Tp& __t, const _Up& __u) const
| ^~~~~~~~
/usr/include/c++/13/compare:1214:9: note: template argument deduction/substitution failed:
/usr/include/c++/13/compare:1214:9: note: constraints not satisfied
/usr/include/c++/13/compare: In substitution of 'template<class _Tp, class _Up> constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{__t < __u} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];{__u < __t} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];} [with _Tp = Node; _Up = Node]':
/usr/include/c++/13/compare:1239:34: required by substitution of '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>&) [with _T1 = long long int; _T2 = Node]'
/usr/include/c++/13/bits/stl_function.h:398:20: required from 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::pair<long long int, Node>]'
/usr/include/c++/13/bits/predefined_ops.h:196:23: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, Node>*, std::vector<std::pair<long long int, Node> > >; _Value = std::pair<long long int, Node>; _Compare = std::greater<std::pair<long long int, Node> >]'
/usr/include/c++/13/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<long long int, Node>*, vector<pair<long long int, Node> > >; _Distance = long int; _Tp = pair<long long int, Node>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<long long int, Node> > >]'
/usr/include/c++/13/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, Node>*, vector<pair<long long int, Node> > >; _Compare = greater<pair<long long int, Node> >]'
/usr/include/c++/13/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<long long int, Node>; _Sequence = std::vector<std::pair<long long int, Node> >; _Compare = std::greater<std::pair<long long int, Node> >; value_type = std::pair<long long int, Node>]'
Main.cpp:37:12: required from here
/usr/include/c++/13/compare:1214:2: required by the constraints of 'template<class _Tp, class _Up> constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{__t < __u} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];{__u < __t} -> decltype(auto) [requires std::__detail::__boolean_testable<<placeholder>, >];}'
/usr/include/c++/13/compare:1216:11: in requirements [with _Tp = Node; _Up = Node]
/usr/include/c++/13/compare:1218:17: note: the required expression '(__t < __u)' is invalid
1218 | { __t < __u } -> __boolean_testable;
| ~~~~^~~~~
/usr/include/c++/13/compare:1219:17: note: the required expression '(__u < __t)' is invalid
1219 | { __u < __t } -> __boolean_testable;
| ~~~~^~~~~
/usr/include/c++/13/compare: In substitution of '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>&) [with _T1 = long long int; _T2 = Node]':
/usr/include/c++/13/bits/stl_function.h:398:20: required from 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::pair<long long int, Node>]'
/usr/include/c++/13/bits/predefined_ops.h:196:23: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, Node>*, std::vector<std::pair<long long int, Node> > >; _Value = std::pair<long long int, Node>; _Compare = std::greater<std::pair<long long int, Node> >]'
/usr/include/c++/13/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<long long int, Node>*, vector<pair<long long int, Node> > >; _Distance = long int; _Tp = pair<long long int, Node>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<long long int, Node> > >]'
/usr/include/c++/13/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, Node>*, vector<pair<long long int, Node> > >; _Compare = greater<pair<long long int, Node> >]'
/usr/include/c++/13/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<long long int, Node>; _Sequence = std::vector<std::pair<long long int, Node> >; _Compare = std::greater<std::pair<long long int, Node> >; value_type = std::pair<long long int, Node>]'
Main.cpp:37:12: required from here
cc1plus: note: set '-fconcepts-diagnostics-depth=' to at least 2 for more detail
/usr/include/c++/13/bits/stl_function.h: In instantiation of 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = std::pair<long long int, Node>]':
/usr/include/c++/13/bits/predefined_ops.h:196:23: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, Node>*, std::vector<std::pair<long long int, Node> > >; _Value = std::pair<long long int, Node>; _Compare = std::greater<std::pair<long long int, Node> >]'
/usr/include/c++/13/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<long long int, Node>*, vector<pair<long long int, Node> > >; _Distance = long int; _Tp = pair<long long int, Node>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<pair<long long int, Node> > >]'
/usr/include/c++/13/bits/stl_heap.h:216:23: required from 'constexpr void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, Node>*, vector<pair<long long int, Node> > >; _Compare = greater<pair<long long int, Node> >]'
/usr/include/c++/13/bits/stl_queue.h:749:16: required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::pair<long long int, Node>; _Sequence = std::vector<std::pair<long long int, Node> >; _Compare = std::greater<std::pair<long long int, Node> >; value_type = std::pair<long long int, Node>]'
Main.cpp:37:12: required from here
/usr/include/c++/13/bits/stl_iterator.h:601: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)
601 | operator<=>(const reverse_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:601:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::reverse_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/stl_iterator.h:1756: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 move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)' (rewritten)
1756 | operator<=>(const move_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1756:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::move_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/regex.h:1116:5: note: candidate: 'template<class _BiIter> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, const sub_match<_BiIter>&)' (rewritten)
1116 | operator<=>(const sub_match<_BiIter>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/regex.h:1116:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::sub_match<_BiIter>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/forward_list:40,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:175:
/usr/include/c++/13/bits/forward_list.h:1473:5: note: candidate: 'template<class _Tp, class _Alloc> std::__detail::__synth3way_t<_T1> std::operator<=>(const forward_list<_Tp, _Alloc>&, const forward_list<_Tp, _Alloc>&)' (rewritten)
1473 | operator<=>(const forward_list<_Tp, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/forward_list.h:1473:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::forward_list<_Tp, _Alloc>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/stack:63,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:160:
/usr/include/c++/13/bits/stl_stack.h:410:5: note: candidate: 'template<class _Tp, class _Seq> requires three_way_comparable<_Seq, std::partial_ordering> std::compare_three_way_result_t<_Seq> std::operator<=>(const stack<_Tp, _Seq>&, const stack<_Tp, _Seq>&)' (rewritten)
410 | operator<=>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_stack.h:410:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::stack<_Tp, _Seq>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/set:64,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:158:
/usr/include/c++/13/bits/stl_multiset.h:994:5: note: candidate: 'template<class _Key, class _Compare, class _Alloc> std::__detail::__synth3way_t<_T1> std::operator<=>(const multiset<_Key, _Compare, _Allocator>&, const multiset<_Key, _Compare, _Allocator>&)' (rewritten)
994 | operator<=>(const multiset<_Key, _Compare, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_multiset.h:994:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::multiset<_Key, _Compare, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/set:63:
/usr/include/c++/13/bits/stl_set.h:1008:5: note: candidate: 'template<class _Key, class _Compare, class _Alloc> std::__detail::__synth3way_t<_T1> std::operator<=>(const set<_Key, _Compare, _Allocator>&, const set<_Key, _Compare, _Allocator>&)' (rewritten)
1008 | operator<=>(const set<_Key, _Compare, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_set.h:1008:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::set<_Key, _Compare, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/queue:66,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157:
/usr/include/c++/13/bits/stl_queue.h:434:5: note: candidate: 'template<class _Tp, class _Seq> requires three_way_comparable<_Seq, std::partial_ordering> std::compare_three_way_result_t<_Seq> std::operator<=>(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&)' (rewritten)
434 | operator<=>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_queue.h:434:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::queue<_Tp, _Seq>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/map:64,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:152:
/usr/include/c++/13/bits/stl_multimap.h:1155:5: note: candidate: 'template<class _Key, class _Tp, class _Compare, class _Alloc> std::__detail::__synth3way_t<std::pair<const _Key, _Val> > std::operator<=>(const multimap<_Key, _Tp, _Compare, _Allocator>&, const multimap<_Key, _Tp, _Compare, _Allocator>&)' (rewritten)
1155 | operator<=>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_multimap.h:1155:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::multimap<_Key, _Tp, _Compare, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/map:63:
/usr/include/c++/13/bits/stl_map.h:1534:5: note: candidate: 'template<class _Key, class _Tp, class _Compare, class _Alloc> std::__detail::__synth3way_t<std::pair<const _Key, _Val> > std::operator<=>(const map<_Key, _Tp, _Compare, _Allocator>&, const map<_Key, _Tp, _Compare, _Allocator>&)' (rewritten)
1534 | operator<=>(const map<_Key, _Tp, _Compare, _Alloc>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_map.h:1534:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::map<_Key, _Tp, _Compare, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/list:65,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:150:
/usr/include/c++/13/bits/stl_list.h:2159:5: note: candidate: 'template<class _Tp, class _Alloc> std::__detail::__synth3way_t<_T1> std::operator<=>(const __cxx11::list<_Tp, _Alloc>&, const __cxx11::list<_Tp, _Alloc>&)' (rewritten)
2159 | operator<=>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_list.h:2159:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::list<_Tp, _Alloc>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/deque:66,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:139:
/usr/include/c++/13/bits/stl_deque.h:2309:5: note: candidate: 'template<class _Tp, class _Alloc> std::__detail::__synth3way_t<_T1> std::operator<=>(const deque<_Tp, _Alloc>&, const deque<_Tp, _Alloc>&)' (rewritten)
2309 | operator<=>(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_deque.h:2309:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::deque<_Tp, _Alloc>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:80:
/usr/include/c++/13/variant:1280:5: note: candidate: 'template<class ... _Types> requires (three_way_comparable<_Types, std::partial_ordering> && ...) constexpr std::common_comparison_category_t<typename std::__detail::__cmp3way_res_impl<_Types, _Types>::type ...> std::operator<=>(const variant<_Types ...>&, const variant<_Types ...>&)' (rewritten)
1280 | operator<=>(const variant<_Types...>& __v, const variant<_Types...>& __w)
| ^~~~~~~~
/usr/include/c++/13/variant:1280:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::variant<_Types ...>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/functional:65,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53:
/usr/include/c++/13/array:304:5: note: candidate: 'template<class _Tp, long unsigned int _Nm> constexpr std::__detail::__synth3way_t<_T1> std::operator<=>(const array<_Tp, _Nm>&, const array<_Tp, _Nm>&)' (rewritten)
304 | operator<=>(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
| ^~~~~~~~
/usr/include/c++/13/array:304:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::array<_Tp, _Nm>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/vector:66,
from /usr/include/c++/13/functional:64:
/usr/include/c++/13/bits/stl_vector.h:2059:5: note: candidate: 'template<class _Tp, class _Alloc> constexpr std::__detail::__synth3way_t<_T1> std::operator<=>(const vector<_Tp, _Alloc>&, const vector<_Tp, _Alloc>&)' (rewritten)
2059 | operator<=>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
| ^~~~~~~~
/usr/include/c++/13/bits/stl_vector.h:2059:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::vector<_Tp, _Alloc>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/basic_string.h:3745:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> constexpr decltype (__char_traits_cmp_cat<_Traits>(0)) std::operator<=>(const __cxx11::basic_string<_CharT, _Traits, _Allocator>&, const __cxx11::basic_string<_CharT, _Traits, _Allocator>&)' (rewritten)
3745 | operator<=>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3745:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/string_view:625:5: note: candidate: 'template<class _CharT, class _Traits> constexpr decltype (__char_traits_cmp_cat<_Traits>(0)) std::operator<=>(basic_string_view<_CharT, _Traits>, basic_string_view<_CharT, _Traits>)' (rewritten)
625 | operator<=>(basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/13/string_view:625:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'std::pair<long long int, Node>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:184:
/usr/include/c++/13/thread:67:3: note: candidate: 'std::strong_ordering std::operator<=>(thread::id, thread::id)' (rewritten)
67 | operator<=>(thread::id __x, thread::id __y) noexcept
| ^~~~~~~~
/usr/include/c++/13/thread:67:26: note: no known conversion for argument 1 from 'const std::pair<long long int, Node>' to 'std::thread::id'
67 | operator<=>(thread::id __x, thread::id __y) noexcept
| ~~~~~~~~~~~^~~
/usr/include/c++/13/variant:1303:3: note: candidate: 'constexpr std::strong_ordering std::operator<=>(monostate, monostate)' (rewritten)
1303 | operator<=>(monostate, monostate) noexcept { return strong_ordering::equal; }
| ^~~~~~~~
/usr/include/c++/13/variant:1303:15: note: no known conversion for argument 1 from 'const std::pair<long long int, Node>' to 'std::monostate'
1303 | operator<=>(monostate, monostate) noexcept { return strong_ordering::equal; }
| ^~~~~~~~~
In file included from /usr/include/c++/13/bits/ios_base.h:46,
from /usr/include/c++/13/streambuf:43,
from /usr/include/c++/13/bits/streambuf_iterator.h:35,
from /usr/include/c++/13/iterator:66,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:54:
/usr/include/c++/13/system_error:498:3: note: candidate: 'std::strong_ordering std::operator<=>(const error_condition&, const error_condition&)' (rewritten)
498 | operator<=>(const error_condition& __lhs,
| ^~~~~~~~
/usr/include/c++/13/system_error:498:38: note: no known conversion for argument 1 from 'const std::pair<long long int, Node>' to 'const std::error_condition&'
498 | operator<=>(const error_condition& __lhs,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/usr/include/c++/13/system_error:316:3: note: candidate: 'std::strong_ordering std::operator<=>(const error_code&, const error_code&)' (rewritten)
316 | operator<=>(const error_code& __lhs, const error_code& __rhs) noexcept
| ^~~~~~~~
/usr/include/c++/13/system_error:316:33: note: no known conversion for argument 1 from 'const std::pair<long long int, Node>' to 'const std::error_code&'
316 | operator<=>(const error_code& __lhs, const error_code& __rhs) noexcept
| ~~~~~~~~~~~~~~~~~~^~~~~
/usr/include/c++/13/bits/stl_iterator.h:558:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&) requires requires{{std::operator>::__x->base() < std::operator>::__y->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];}'
558 | operator>(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:558:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::reverse_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/stl_iterator.h:1725:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&) requires requires{{std::operator>::__y->base() < std::operator>::__x->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];}'
1725 | operator>(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1725:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::move_iterator<_IteratorL>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:166:
/usr/include/c++/13/valarray:1211:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)'
1211 | _DEFINE_BINARY_OPERATOR(>, __greater)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1211:1: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::valarray<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/valarray:1211:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)'
1211 | _DEFINE_BINARY_OPERATOR(>, __greater)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1211:1: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::valarray<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/valarray:1211:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__greater, _Tp>::result_type> std::operator>(const valarray<_Tp>&, const valarray<_Tp>&)'
1211 | _DEFINE_BINARY_OPERATOR(>, __greater)
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1211:1: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::valarray<_Tp>'
398 | { return __x > __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/13/valarray:605:
/usr/include/c++/13/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)'
420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_function.h:398:20: note: 'const std::pair<long long int, Node>' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>'
398 | { return __x > __y; }
| ~~~~^~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__greater, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__greater, typename _Dom1::value_type>::result_type> std::operator>(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)'
420 | _DEFINE_EXPR_BINARY_OPERATOR(>, struct std::__greater)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:420:5: note: template argument deduction/substitution failed:
/us