| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1340416 | biblicaleagle | Triple Peaks (IOI25_triples) | C++20 | Compilation error | 0 ms | 0 KiB |
#include "triples.h"
#include <map>
#include <tuple>
#include <unordered_set>
#include <algorithm>
#include <cmath>
using namespace std;
long long count_triples(vector<int> H) {
vector<int> X, Y;
for (int i=0; i < H.size(); i++) {
X.push_back(H[i]+i);
Y.push_back(H[i]-i);
}
vector<int> supX = X, supY = Y;
sort(supX.begin(), supX.end());
sort(supY.begin(), supY.end());
supX.erase(unique(supX.begin(), supX.end()), supX.end());
supY.erase(unique(supY.begin(), supY.end()), supY.end());
map<int, vector<int>> invX, invY;
for (int i=0; i < H.size(); i++) {
int x = X[i], y = Y[i];
invX[x].push_back(i);
invY[y].push_back(i);
}
unordered_set<tuple<int, int, int>> triples;
for (int i=0; i < H.size(); i++) {
int x = X[i], y = Y[i];
if (x < H.size()) {
int yx = Y[x];
int xx = X[x];
if (i < yx) {
int yyx = Y[yx];
if (yyx == i) triples.insert({i, yx, x});
}
if (xx < H.size()) {
int yxx = Y[xx];
if (yxx == i) triples.insert({i, x, xx});
}
int hx = H[x];
if (i + hx < H.size()) {
if (x == X[i + hx]) triples.insert({i, i + hx, x});
if (x == Y[i + hx]) triples.insert({i, x, i + hx});
}
}
if (y >= 0) {
int hy = H[y];
if (i + hy < H.size()) {
if (y == Y[i + hy]) triples.insert({y, i, i + hy});
}
}
}
for (int x : supX) {
if (invX[x].size() < sqrt(H.size())) {
for (int j: invX[x])
for (int k: invX[x])
if (j < k) {
int yj = Y[j], yk = Y[k];
if ((yk - yj) % 2 == 0) {
int i = (yj + yk) / 2;
if (i >= 0 && i < H.size())
if (H[i] == (yk - yj) / 2) triples.insert({i, j, k});
}
}
} else {
for (int i=0; i < H.size(); i++)
if ((x - X[i]) % 2 == 0 && (x - Y[i]) % 2 == 0) {
int j = (x + X[i]) / 2, k = (x + Y[i]) / 2;
if (j >= 0 && j < H.size() && k >= 0 && k < H.size())
if (X[j] == X[k] == x) triples.insert({i, j, k});
}
}
}
return triples.size();
}
std::vector<int> construct_range(int M, int K) {
return {1, 1, 1};
}
Compilation message (stderr)
triples.cpp: In function 'long long int count_triples(std::vector<int>)':
triples.cpp:31:39: error: use of deleted function 'std::unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set() [with _Value = std::tuple<int, int, int>; _Hash = std::hash<std::tuple<int, int, int> >; _Pred = std::equal_to<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >]'
31 | unordered_set<tuple<int, int, int>> triples;
| ^~~~~~~
In file included from /usr/include/c++/13/unordered_set:41,
from triples.cpp:5:
/usr/include/c++/13/bits/unordered_set.h:142:7: note: 'std::unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set() [with _Value = std::tuple<int, int, int>; _Hash = std::hash<std::tuple<int, int, int> >; _Pred = std::equal_to<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >]' is implicitly deleted because the default definition would be ill-formed:
142 | unordered_set() = default;
| ^~~~~~~~~~~~~
/usr/include/c++/13/bits/unordered_set.h:142:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>]'
In file included from /usr/include/c++/13/bits/unordered_set.h:33:
/usr/include/c++/13/bits/hashtable.h:530:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>]' is implicitly deleted because the default definition would be ill-formed:
530 | _Hashtable() = default;
| ^~~~~~~~~~
/usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, true, true>]'
In file included from /usr/include/c++/13/bits/hashtable.h:35:
/usr/include/c++/13/bits/hashtable_policy.h:1701:7: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, true, true>]' is implicitly deleted because the default definition would be ill-formed:
1701 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1701:7: error: use of deleted function 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]'
/usr/include/c++/13/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::tuple<int, int, int> >]':
/usr/include/c++/13/bits/hashtable_policy.h:1301:7: required from here
/usr/include/c++/13/bits/hashtable_policy.h:1218:49: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::hash()'
1218 | _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
| ^~~~~
In file included from /usr/include/c++/13/bits/stl_bvector.h:65,
from /usr/include/c++/13/vector:67,
from triples.h:1,
from triples.cpp:1:
/usr/include/c++/13/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<int, int, int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/13/bits/functional_hash.h:102:12: error: no matching function for call to 'std::__hash_enum<std::tuple<int, int, int>, false>::__hash_enum()'
/usr/include/c++/13/bits/functional_hash.h:83:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]'
83 | __hash_enum(__hash_enum&&);
| ^~~~~~~~~~~
/usr/include/c++/13/bits/functional_hash.h:83:7: note: candidate expects 1 argument, 0 provided
/usr/include/c++/13/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]' is private within this context
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/13/bits/functional_hash.h:84:7: note: declared private here
84 | ~__hash_enum();
| ^
/usr/include/c++/13/bits/hashtable_policy.h:1301:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]' is implicitly deleted because the default definition would be ill-formed:
1301 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1301:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/13/bits/hashtable_policy.h:1215:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
1215 | struct _Hashtable_ebo_helper<_Nm, _Tp, true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1215:12: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::~hash()'
/usr/include/c++/13/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<int, int, int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
102 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/13/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]' is private within this context
/usr/include/c++/13/bits/functional_hash.h:84:7: note: declared private here
84 | ~__hash_enum();
| ^
/usr/include/c++/13/bits/hashtable_policy.h:1701:7: error: use of deleted function 'std::__detail::_Hash_code_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
1701 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1279:12: note: 'std::__detail::_Hash_code_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()' is implicitly deleted because the default definition would be ill-formed:
1279 | struct _Hash_code_base
| ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1279:12: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function 'std::__detail::_Hashtable_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::~_Hashtable_base()'
530 | _Hashtable() = default;
| ^~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1658:12: note: 'std::__detail::_Hashtable_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::~_Hashtable_base()' is implicitly deleted because the default definition would be ill-formed:
1658 | struct _Hashtable_base
| ^~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1658:12: error: use of deleted function 'std::__detail::_Hash_code_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
/usr/include/c++/13/bits/hashtable.h:530:7: error: use of deleted function 'constexpr std::_Enable_default_constructor<false, _Tag>::_Enable_default_constructor() [with _Tag = std::__detail::_Hash_node_base]'
530 | _Hashtable() = default;
| ^~~~~~~~~~
In file included from /usr/include/c++/13/bits/hashtable.h:36:
/usr/include/c++/13/bits/enable_special_members.h:113:15: note: declared here
113 | constexpr _Enable_default_constructor() noexcept = delete;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable.h: In instantiation of 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::~_Hashtable() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>]':
/usr/include/c++/13/bits/unordered_set.h:104:11: required from here
/usr/include/c++/13/bits/hashtable.h:1610:5: error: use of deleted function 'std::__detail::_Hashtable_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::~_Hashtable_base()'
1610 | }
| ^
/usr/include/c++/13/bits/hashtable.h:1602:21: error: static assertion failed: Cache the hash code or qualify your functors involved in hash code and bucket index computation with noexcept
1602 | static_assert(noexcept(declval<const __hash_code_base_access&>()
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1603 | ._M_bucket_index(declval<const __node_value_type&>(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1604 | (std::size_t)0)),
| ~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable.h:1602:21: note: 'false' evaluates to false
/usr/include/c++/13/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::__hash_code std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_M_hash_code_tr(const _Kt&) const [with _Kt = std::tuple<int, int, int>; _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true; __hash_code = long unsigned int]':
/usr/include/c++/13/bits/hashtable.h:2264:44: required from 'std::pair<typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator, bool> std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_insert_unique(_Kt&&, _Arg&&, const _NodeGenerator&) [with _Kt = std::tuple<int, int, int>; _Arg = std::tuple<int, int, int>; _NodeGenerator = std::__detail::_AllocNode<std::allocator<std::__detail::_Hash_node<std::tuple<int, int, int>, true> > >; _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>; typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator = std::__detail::_Insert_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> >, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, true, true> >::iterator; typename _Traits::__constant_iterators = std::__detail::_Hashtable_traits<true, true, true>::__constant_iterators]'
/usr/include/c++/13/bits/hashtable.h:904:27: required from 'std::pair<typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator, bool> std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_insert_unique_aux(_Arg&&, const _NodeGenerator&) [with _Arg = std::tuple<int, int, int>; _NodeGenerator = std::__detail::_AllocNode<std::allocator<std::__detail::_Hash_node<std::tuple<int, int, int>, true> > >; _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>; typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator = std::__detail::_Insert_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> >, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, true, true> >::iterator; typename _Traits::__constant_iterators = std::__detail::_Hashtable_traits<true, true, true>::__constant_iterators]'
/usr/include/c++/13/bits/hashtable.h:916:31: required from 'std::pair<typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator, bool> std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_insert(_Arg&&, const _NodeGenerator&, std::true_type) [with _Arg = std::tuple<int, int, int>; _NodeGenerator = std::__detail::_AllocNode<std::allocator<std::__detail::_Hash_node<std::tuple<int, int, int>, true> > >; _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>; typename std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::iterator = std::__detail::_Insert_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> >, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, true, true> >::iterator; typename _Traits::__constant_iterators = std::__detail::_Hashtable_traits<true, true, true>::__constant_iterators; std::true_type = std::integral_constant<bool, true>]'
/usr/include/c++/13/bits/hashtable_policy.h:1075:22: required from 'std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::__ireturn_type std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::insert(value_type&&) [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::tuple<int, int, int> >; _Hash = std::hash<std::tuple<int, int, int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>; __ireturn_type = std::__detail::_Insert<std::tuple<int, int, int>, std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> >, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, true, true>, true>::__ireturn_type; value_type = std::tuple<int, int, int>]'
/usr/include/c++/13/bits/unordered_set.h:433:27: required from 'std::pair<typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__is_nothrow_invocable<const _Hash&, const _Tp&> > >::value, true, true> >::iterator, bool> std::unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(value_type&&) [with _Value = std::tuple<int, int, int>; _Hash = std::hash<std::tuple<int, int, int> >; _Pred = std::equal_to<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >; typename std::_Hashtable<_Value, _Value, _Alloc, std::__detail::_Identity, _Pred, _Hash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<std::__not_<std::__and_<std::__is_fast_hash<_Hash>, std::__is_nothrow_invocable<const _Hash&, const _Tp&> > >::value, true, true> >::iterator = std::__detail::_Insert_base<std::tuple<int, int, int>, std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> >, std::__detail::_Identity, std::equal_to<std::tuple<int, int, int> >, std::hash<std::tuple<int, int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, true, true> >::iterator; value_type = std::tuple<int, int, int>]'
triples.cpp:41:37: required from here
/usr/include/c++/13/bits/hashtable_policy.h:1317:25: error: static assertion failed: hash function must be invocable with an argument of key type
1317 | static_assert(__is_invocable<const _Hash&, const _Kt&>{},
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/hashtable_policy.h:1317:25: note: 'std::__is_invocable<const std::hash<std::tuple<int, int, int> >&, const std::tuple<int, int, int>&>()' evaluates to false
/usr/include/c++/13/bits/hashtable_policy.h:1319:27: error: no match for call to '(const std::hash<std::tuple<int, int, int> >) (const std::tuple<int, int, int>&)'
1319 | return _M_hash()(__k);
| ~~~~~~~~~^~~~~