| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1061589 | 2024-08-16T11:04:39 Z | beaconmc | Maze (JOI23_ho_t3) | C++14 | 컴파일 오류 |
0 ms | 0 KB |
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
ll r,c,n;
vector<vector<ll>> grid;
vector<vector<ll>> visited;
bool iswithin(ll a, ll b, ll x, ll y){
if ((abs(x-a)<=n && abs(y-b) < n) || (abs(x-a)<n && abs(y-b) <= n)){
return 1;
}
return 0;
}
vector<vector<ll>> getvalid(ll a, ll b){
unordered_set<vector<ll>> ans;
FOR(i,-(n-1), n){
ans.insert({a-n, b+i});
ans.insert({a+n, b+i});
ans.insert({a+i, b-n});
ans.insert({a+i, b+n});
}
FOR(i,0,r){
if (iswithin(a, b, i, c-1)) ans.insert({i, c-1});
if (iswithin(a, b, i, 0)) ans.insert({i, 0});
}
FOR(i,0,c){
if (iswithin(a,b,r-1,i)) ans.insert({r-1, i});
if (iswithin(a,b,0,i)) ans.insert({0, i});
}
vector<vector<ll>> realans;
for (auto&i : ans){
if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c) realans.push_back(i);
}
return realans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> r >> c >> n;
ll a,b;
ll x,y;
cin >> a >> b >> x >> y;
a--;b--;x--;y--;
FOR(i,0,r){
vector<ll> temp;
vector<ll> idk;
string temp2;
cin >> temp2;
FOR(j,0,c){
temp.push_back(temp2[j]);
idk.push_back(100000000);
}
grid.push_back(temp);
visited.push_back(idk);
}
ll ans = -1;
deque<vector<ll>> sus;
sus.push_back({a,b,0});
visited[a][b] = 0;
while (sus.size()){
vector<ll> node = sus.front();
sus.pop_front();
if (visited[node[0]][node[1]] != node[2]) continue;
if (node[0] == x && node[1] == y){
ans = node[2];
break;
}
if (iswithin(node[0],node[1],x,y)){
if (visited[x][y]> node[2]+1){
visited[x][y] = node[2]+1;
sus.push_back({x,y,node[2]+1});
}
}
vector<vector<ll>> pos = {{node[0]-1,node[1]},{node[0]+1,node[1]},{node[0],node[1]-1},{node[0],node[1]+1}};
vector<vector<ll>> temp = getvalid(node[0], node[1]);
for (auto&i : pos){
if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c){
if (grid[i[0]][i[1]] == '.'){
if (visited[i[0]][i[1]] > node[2]){
visited[i[0]][i[1]] = node[2];
sus.push_front({i[0], i[1], node[2]});
}
}
else{
if (visited[i[0]][i[1]] > node[2]+1 ){
visited[i[0]][i[1]] = node[2]+1;
sus.push_back({i[0], i[1], node[2]+1});
}
}
}
}
for (auto&i : temp){
if (0<=i[0] && i[0]<r && 0<=i[1] && i[1]<c){
if (visited[i[0]][i[1]] > node[2]+1){
visited[i[0]][i[1]] = node[2]+1;
sus.push_back({i[0], i[1], node[2]+1});
}
}
}
}
cout << ans << endl;
}
Compilation message
Main.cpp: In function 'std::vector<std::vector<long long int> > getvalid(ll, ll)':
Main.cpp:26:28: error: use of deleted function 'std::unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set() [with _Value = std::vector<long long int>; _Hash = std::hash<std::vector<long long int> >; _Pred = std::equal_to<std::vector<long long int> >; _Alloc = std::allocator<std::vector<long long int> >]'
26 | unordered_set<vector<ll>> ans;
| ^~~
In file included from /usr/include/c++/10/unordered_set:47,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:118,
from Main.cpp:1:
/usr/include/c++/10/bits/unordered_set.h:135:7: note: 'std::unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set() [with _Value = std::vector<long long int>; _Hash = std::hash<std::vector<long long int> >; _Pred = std::equal_to<std::vector<long long int> >; _Alloc = std::allocator<std::vector<long long int> >]' is implicitly deleted because the default definition would be ill-formed:
135 | unordered_set() = default;
| ^~~~~~~~~~~~~
/usr/include/c++/10/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::vector<long long int>; _Value = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable.h:451:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::vector<long long int>; _Value = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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:
451 | _Hashtable() = default;
| ^~~~~~~~~~
/usr/include/c++/10/bits/hashtable.h:451:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _Traits>::_Hashtable_base() [with _Key = std::vector<long long int>; _Value = std::vector<long long int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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++/10/bits/hashtable.h:35,
from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1791:5: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _Traits>::_Hashtable_base() [with _Key = std::vector<long long int>; _Value = std::vector<long long int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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:
1791 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1791: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::vector<long long int>; _Value = std::vector<long long int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::vector<long long int> >; _H2 = std::__detail::_Mod_range_hashing]'
/usr/include/c++/10/bits/hashtable_policy.h:1368:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2, std::__detail::_Default_ranged_hash, true>::_Hash_code_base() [with _Key = std::vector<long long int>; _Value = std::vector<long long int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::vector<long long int> >; _H2 = std::__detail::_Mod_range_hashing]' is implicitly deleted because the default definition would be ill-formed:
1368 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1368: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::vector<long long int> >]'
/usr/include/c++/10/bits/hashtable_policy.h:1112:7: note: 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::vector<long long int> >]' is implicitly deleted because the default definition would be ill-formed:
1112 | _Hashtable_ebo_helper() = default;
| ^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1112:7: error: use of deleted function 'std::hash<std::vector<long long int> >::hash()'
In file included from /usr/include/c++/10/bits/basic_string.h:6787,
from /usr/include/c++/10/string:55,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
from /usr/include/c++/10/istream:38,
from /usr/include/c++/10/sstream:38,
from /usr/include/c++/10/complex:45,
from /usr/include/c++/10/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
from Main.cpp:1:
/usr/include/c++/10/bits/functional_hash.h:101:12: note: 'std::hash<std::vector<long long int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/10/bits/functional_hash.h:101:12: error: no matching function for call to 'std::__hash_enum<std::vector<long long int>, false>::__hash_enum()'
/usr/include/c++/10/bits/functional_hash.h:82:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::vector<long long int>; bool <anonymous> = false]'
82 | __hash_enum(__hash_enum&&);
| ^~~~~~~~~~~
/usr/include/c++/10/bits/functional_hash.h:82:7: note: candidate expects 1 argument, 0 provided
/usr/include/c++/10/bits/functional_hash.h:101:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<long long int>; bool <anonymous> = false]' is private within this context
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/10/bits/functional_hash.h:83:7: note: declared private here
83 | ~__hash_enum();
| ^
In file included from /usr/include/c++/10/bits/hashtable.h:35,
from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1112:7: error: use of deleted function 'std::hash<std::vector<long long int> >::~hash()'
1112 | _Hashtable_ebo_helper() = default;
| ^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/bits/basic_string.h:6787,
from /usr/include/c++/10/string:55,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
from /usr/include/c++/10/istream:38,
from /usr/include/c++/10/sstream:38,
from /usr/include/c++/10/complex:45,
from /usr/include/c++/10/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
from Main.cpp:1:
/usr/include/c++/10/bits/functional_hash.h:101:12: note: 'std::hash<std::vector<long long int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
101 | struct hash : __hash_enum<_Tp>
| ^~~~
/usr/include/c++/10/bits/functional_hash.h:101:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<long long int>; bool <anonymous> = false]' is private within this context
/usr/include/c++/10/bits/functional_hash.h:83:7: note: declared private here
83 | ~__hash_enum();
| ^
In file included from /usr/include/c++/10/bits/hashtable.h:35,
from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1368:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<long long int> >, true>::~_Hashtable_ebo_helper()'
1368 | _Hash_code_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1109:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<long long int> >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
1109 | struct _Hashtable_ebo_helper<_Nm, _Tp, true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1109:12: error: use of deleted function 'std::hash<std::vector<long long int> >::~hash()'
/usr/include/c++/10/bits/hashtable_policy.h:1791:5: error: use of deleted function 'std::__detail::_Hash_code_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::hash<std::vector<long long int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
1791 | _Hashtable_base() = default;
| ^~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1341:12: note: 'std::__detail::_Hash_code_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::hash<std::vector<long long 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:
1341 | struct _Hash_code_base<_Key, _Value, _ExtractKey, _H1, _H2,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1342 | _Default_ranged_hash, true>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1341:12: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<long long int> >, true>::~_Hashtable_ebo_helper()'
In file included from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable.h:451:7: error: use of deleted function 'std::__detail::_Hashtable_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::equal_to<std::vector<long long int> >, std::hash<std::vector<long long int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::~_Hashtable_base()'
451 | _Hashtable() = default;
| ^~~~~~~~~~
In file included from /usr/include/c++/10/bits/hashtable.h:35,
from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1725:10: note: 'std::__detail::_Hashtable_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::equal_to<std::vector<long long int> >, std::hash<std::vector<long long 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:
1725 | struct _Hashtable_base
| ^~~~~~~~~~~~~~~
/usr/include/c++/10/bits/hashtable_policy.h:1725:10: error: use of deleted function 'std::__detail::_Hash_code_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::hash<std::vector<long long int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
In file included from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/bits/hashtable.h: In instantiation of 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits>::~_Hashtable() [with _Key = std::vector<long long int>; _Value = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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++/10/bits/unordered_set.h:97:11: required from here
/usr/include/c++/10/bits/hashtable.h:1389:5: error: use of deleted function 'std::__detail::_Hashtable_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::equal_to<std::vector<long long int> >, std::hash<std::vector<long long int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::~_Hashtable_base()'
1389 | }
| ^
In file included from /usr/include/c++/10/bits/hashtable.h:35,
from /usr/include/c++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from Main.cpp:1:
/usr/include/c++/10/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::vector<long long int>; _Value = std::vector<long long int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::vector<long long 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++/10/bits/hashtable.h:1807:41: 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::vector<long long int>; _NodeGenerator = std::__detail::_AllocNode<std::allocator<std::__detail::_Hash_node<std::vector<long long int>, true> > >; _Key = std::vector<long long int>; _Value = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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::_Hashtable_base<std::vector<long long int>, std::vector<long long int>, std::__detail::_Identity, std::equal_to<std::vector<long long int> >, std::hash<std::vector<long long int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, true, true> >::iterator; 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++/10/bits/hashtable_policy.h:971:22: 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::vector<long long int>; _Value = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::vector<long long int> >; _H1 = std::hash<std::vector<long long 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>; std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::__ireturn_type = std::__detail::_Insert<std::vector<long long int>, std::vector<long long int>, std::allocator<std::vector<long long int> >, std::__detail::_Identity, std::equal_to<std::vector<long long int> >, std::hash<std::vector<long long 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; std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::value_type = std::vector<long long int>]'
/usr/include/c++/10/bits/unordered_set.h:425: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(std::unordered_set<_Value, _Hash, _Pred, _Alloc>::value_type&&) [with _Value = std::vector<long long int>; _Hash = std::ha