| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 378790 | rk42745417 | Evacuation plan (IZhO18_plan) | C++17 | 컴파일 에러 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll LINF = 2e18;
const double EPS = 1e-9;
#define EMT ios::sync_with_stdio(0); cin.tie(0);
const int N = 1e5 + 25;
int dis[N];
bool vis[N];
vector<int> npp;
vector<pair<int, int>> edge[N];
struct DisjointSet {
int pa[N], sz[N];
stack<pair<int, int>> st;
void init(int n) {
for(int i = 1; i <= n; i++)
sz[i] = 1, pa[i] = i;
}
int fnd(int x) { return pa[x] == x ? pa[x] : fnd(pa[x]); }
bool uni(int a, int b) {
if((a = fnd(a)) == (b = fnd(b)))
return false;
if(sz[a] > sz[b])
swap(a, b);
sz[b] += sz[a];
pa[a] = b;
st.push({a, b});
return true;
}
void undo() {
assert(st.size());
auto [a, b] = st.top();
st.pop();
pa[a] = a;
sz[b] -= sz[a];
}
} dsu;
void solve() {
memset(dis, 0x3f, sizeof dis);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
for(int a : npp)
dis[a] = 0, pq.push({dis[a], a});
while(!pq.empty()) {
auto [c, u] = pq.top();
pq.pop();
if(c > dis[u])
continue;
for(const auto &[v, d] : edge[u]) {
if(dis[v] > c + d) {
dis[v] = c + d;
pq.push({dis[v], v});
}
}
}
};
const int SQN = 500;
signed main() { EMT
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
edge[u].push_back({v, w});
edge[v].push_back({u, w});
}
int k;
cin >> k;
npp.resize(k);
for(int &a : npp)
cin >> a;
solve();
dsu.init(n);
int q;
cin >> q;
vector<pair<int, int>> arr(n);
unordered_set<tuple<int, int, int>> que;
vector<int> ans(q);
for(int i = 0, a, b; i < q; i++) {
cin >> a >> b;
que.insert({a, b, i});
}
for(int i = 1; i <= n; i++)
arr[i - 1] = {dis[i], i};
sort(arr.begin(), arr.end(), greater<pair<int, int>>());
vector<tuple<int, int, int>> owo;
for(int i = 0; i < n; i++) {
int u = arr[i].second;
vis[u] = 1;
for(const auto &[v, d] : edge[u])
if(vis[v])
if(dsu.uni(u, v))
owo.push_back({u, v, arr[i].first});
if((i && i % SQN == 0) || i == n - 1) {
vector<tuple<int, int, int>> tmp;
for(const auto &[a, b, id] : que)
if(dsu.fnd(a) == dsu.fnd(b))
tmp.push_back({a, b, id});
for(int i = 0; i < owo.size(); i++)
dsu.undo();
//cerr << "here\n";
for(const auto &[u, v, w] : owo) {
dsu.uni(u, v);
for(const auto &[a, b, id] : tmp) {
if(dsu.fnd(a) == dsu.fnd(b))
ans[id] = max(ans[id], w);
}
}
for(const auto &e : tmp)
que.erase(e);
//cerr << "here\n";
owo.clear();
}
//cerr << "XDD " << i << '\n';
}
//cerr << "here\n";
for(int a : ans)
cout << a << '\n';
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/
컴파일 시 표준 에러 (stderr) 메시지
plan.cpp: In function 'int main()':
plan.cpp:87:38: 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> >]'
87 | unordered_set<tuple<int, int, int>> que;
| ^~~
In file included from /usr/include/c++/9/unordered_set:47,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:118,
from plan.cpp:1:
/usr/include/c++/9/bits/unordered_set.h:135: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:
135 | unordered_set() = default;
| ^~~~~~~~~~~~~
/usr/include/c++/9/bits/unordered_set.h:135:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = 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++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable.h:414:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = 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:
414 | _Hashtable() = default;
| ^~~~~~~~~~
/usr/include/c++/9/bits/hashtable.h:414:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, true, true>]'
In file included from /usr/include/c++/9/bits/hashtable.h:35,
from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable_policy.h:1822:5: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, true, true>]' is implicitly deleted because the default definition would be ill-formed:
1822 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1822:5: error: use of deleted function 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing]'
/usr/include/c++/9/bits/hashtable_policy.h:1373:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::_Hash_code_base() [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing]' is implicitly deleted because the default definition would be ill-formed:
1373 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1373:7: error: use of deleted function '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++/9/bits/hashtable_policy.h:1096:7: note: 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::tuple<int, int, int> >]' is implicitly deleted because the default definition would be ill-formed:
1096 | _Hashtable_ebo_helper() = default;
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1096:7: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::hash()'
In file included from /usr/include/c++/9/string_view:43,
from /usr/include/c++/9/bits/basic_string.h:48,
from /usr/include/c++/9/string:55,
from /usr/include/c++/9/bits/locale_classes.h:40,
from /usr/include/c++/9/bits/ios_base.h:41,
from /usr/include/c++/9/ios:42,
from /usr/include/c++/9/istream:38,
from /usr/include/c++/9/sstream:38,
from /usr/include/c++/9/complex:45,
from /usr/include/c++/9/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
from plan.cpp:1:
/usr/include/c++/9/bits/functional_hash.h:101:12: note: 'std::hash<std::tuple<int, int, int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/9/bits/functional_hash.h:101:12: error: no matching function for call to 'std::__hash_enum<std::tuple<int, int, int>, false>::__hash_enum()'
/usr/include/c++/9/bits/functional_hash.h:82: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]'
82 | __hash_enum(__hash_enum&&);
| ^~~~~~~~~~~
/usr/include/c++/9/bits/functional_hash.h:82:7: note: candidate expects 1 argument, 0 provided
/usr/include/c++/9/bits/functional_hash.h:101:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<int, int, int>; bool <anonymous> = false]' is private within this context
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/9/bits/functional_hash.h:83:7: note: declared private here
83 | ~__hash_enum();
| ^
In file included from /usr/include/c++/9/bits/hashtable.h:35,
from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable_policy.h:1096:7: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::~hash()'
1096 | _Hashtable_ebo_helper() = default;
| ^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/9/string_view:43,
from /usr/include/c++/9/bits/basic_string.h:48,
from /usr/include/c++/9/string:55,
from /usr/include/c++/9/bits/locale_classes.h:40,
from /usr/include/c++/9/bits/ios_base.h:41,
from /usr/include/c++/9/ios:42,
from /usr/include/c++/9/istream:38,
from /usr/include/c++/9/sstream:38,
from /usr/include/c++/9/complex:45,
from /usr/include/c++/9/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:54,
from plan.cpp:1:
/usr/include/c++/9/bits/functional_hash.h:101:12: note: 'std::hash<std::tuple<int, int, int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/9/bits/functional_hash.h:101: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++/9/bits/functional_hash.h:83:7: note: declared private here
83 | ~__hash_enum();
| ^
In file included from /usr/include/c++/9/bits/hashtable.h:35,
from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable_policy.h:1373:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
1373 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1093: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:
1093 | struct _Hashtable_ebo_helper<_Nm, _Tp, true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1093:12: error: use of deleted function 'std::hash<std::tuple<int, int, int> >::~hash()'
/usr/include/c++/9/bits/hashtable_policy.h:1822:5: 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()'
1822 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1346: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:
1346 | struct _Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1347 | _Default_ranged_hash, true>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1346:12: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<int, int, int> >, true>::~_Hashtable_ebo_helper()'
In file included from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable.h:414: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()'
414 | _Hashtable() = default;
| ^~~~~~~~~~
In file included from /usr/include/c++/9/bits/hashtable.h:35,
from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable_policy.h:1770:10: 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:
1770 | struct _Hashtable_base
| ^~~~~~~~~~~~~~~
/usr/include/c++/9/bits/hashtable_policy.h:1770:10: 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()'
plan.cpp:110:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
110 | for(int i = 0; i < owo.size(); i++)
| ~~^~~~~~~~~~~~
In file included from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable.h: In instantiation of 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>]':
/usr/include/c++/9/bits/unordered_set.h:97:11: required from here
/usr/include/c++/9/bits/hashtable.h:1354: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()'
1354 | }
| ^
In file included from /usr/include/c++/9/bits/hashtable.h:35,
from /usr/include/c++/9/unordered_map:46,
from /usr/include/c++/9/functional:61,
from /usr/include/c++/9/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/9/algorithm:71,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from plan.cpp:1:
/usr/include/c++/9/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::__hash_code std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::_M_hash_code(const _Key&) const [with _Key = std::tuple<int, int, int>; _Value = std::tuple<int, int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::__hash_code = long unsigned int]':
/usr/include/c++/9/bits/hashtable.h:1810:14: required from 'std::pair<typename std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _Traits>::iterator, bool> std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits>::_M_insert(_Arg&&, const _NodeGenerator&, std::true_type, std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits>::size_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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, true, true>; typename std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _Traits>::iterator = std::__detail::_Node_iterator<std::tuple<int, int, int>, true, true>; std::true_type = std::integral_constant<bool, true>; std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits>::size_type = long unsigned int]'
/usr/include/c++/9/bits/hashtable_policy.h:955:66: required from 'std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::__ireturn_type std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::insert(std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::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> >; _H1 = std::hash<std::tuple<int, int, int> >; _H2 = std::__detail::_Mod_range_hashing; _Hash = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_po