| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 487404 | 2021-11-15T11:43:48 Z | Koosha_mv | Cities (BOI16_cities) | C++14 | 컴파일 오류 |
0 ms | 0 KB |
#include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define Add(x,y) x=(x+y)%mod
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=2e5+99,K=5;
const ll inf=1e15;
int n,k,m,a[N],imp[N],col[N];
ll ans=inf,dp[N][(1<<K)];
vector<int> v[(1<<K)];
vector<pair<int,int> > g[N];
unordered_set <pair<ll,int> > s;
void build(){
f(mask1,0,(1<<k)){
f(mask2,0,(1<<k)){
if(((mask1&mask2)==0)){
v[mask1].pb(mask2);
}
}
}
}
void upd(int u,int mask,ll x){
if(dp[u][mask]<=x) return ;
dp[u][mask]=x;
}
void solve(int mk){
s.clear();
f(i,1,n+1){
s.insert(mp(dp[i][mk],i));
}
/*while(s.size()){
pair<ll,int> p=*s.begin();
int u=p.S;
s.erase(p);
f(i,0,g[u].size()){
if(dp[u][mk]+g[u][i].S<dp[g[u][i].F][mk]){
s.erase(mp(dp[g[u][i].F][mk],g[u][i].F));
dp[g[u][i].F][mk]=dp[u][mk]+g[u][i].S;
s.insert(mp(dp[g[u][i].F][mk],g[u][i].F));
}
}
}*/
f(i,1,n+1){
int u=i,mask=mk;
f(i,0,g[u].size()){
f(j,0,v[mask].size()){
int nmask=v[mask][j];
upd(u,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S);
upd(g[u][i].F,mask|nmask,dp[u][mask]+dp[g[u][i].F][nmask]+g[u][i].S);
}
}
}
}
main(){
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
fill(col,col+N,-1);
cin>>n>>k>>m;
build();
f(i,0,k){
cin>>imp[i];
col[imp[i]]=i;
}
f(i,0,m){
int u,v,c;
cin>>u>>v>>c;
g[u].pb(mp(v,c));
g[v].pb(mp(u,c));
}
f(i,1,n+1){
f(mask,0,(1<<k)){
dp[i][mask]=inf;
}
}
f(i,1,n+1){
if(col[i]==-1){
dp[i][0]=0;
}
else{
dp[i][(1<<col[i])]=0;
}
}
f(mask,0,(1<<k)-1){
solve(mask);
}
f(i,1,n+1){
minm(ans,dp[i][(1<<k)-1]);
}
cout<<ans;
}
Compilation message
cities.cpp:27:31: error: use of deleted function 'std::unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set() [with _Value = std::pair<long long int, int>; _Hash = std::hash<std::pair<long long int, int> >; _Pred = std::equal_to<std::pair<long long int, int> >; _Alloc = std::allocator<std::pair<long long int, int> >]'
27 | unordered_set <pair<ll,int> > s;
| ^
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 cities.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::pair<long long int, int>; _Hash = std::hash<std::pair<long long int, int> >; _Pred = std::equal_to<std::pair<long long int, int> >; _Alloc = std::allocator<std::pair<long long int, 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::pair<long long int, int>; _Value = std::pair<long long int, int>; _Alloc = std::allocator<std::pair<long long int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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++/10/unordered_map:46,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:117,
from cities.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::pair<long long int, int>; _Value = std::pair<long long int, int>; _Alloc = std::allocator<std::pair<long long int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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:
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::pair<long long int, int>; _Value = std::pair<long long int, int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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++/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 cities.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::pair<long long int, int>; _Value = std::pair<long long int, int>; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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:
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::pair<long long int, int>; _Value = std::pair<long long int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::pair<long long int, 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::pair<long long int, int>; _Value = std::pair<long long int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::pair<long long int, 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::pair<long long int, 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::pair<long long int, 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::pair<long long int, 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 cities.cpp:1:
/usr/include/c++/10/bits/functional_hash.h:101:12: note: 'std::hash<std::pair<long long int, 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::pair<long long int, 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::pair<long long int, 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::pair<long long int, 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 cities.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1112:7: error: use of deleted function 'std::hash<std::pair<long long int, 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 cities.cpp:1:
/usr/include/c++/10/bits/functional_hash.h:101:12: note: 'std::hash<std::pair<long long int, 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::pair<long long int, 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 cities.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::pair<long long int, 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::pair<long long int, 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::pair<long long int, int> >::~hash()'
/usr/include/c++/10/bits/hashtable_policy.h:1791:5: error: use of deleted function 'std::__detail::_Hash_code_base<std::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::hash<std::pair<long long int, 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::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::hash<std::pair<long long 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:
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::pair<long long int, 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 cities.cpp:1:
/usr/include/c++/10/bits/hashtable.h:451:7: error: use of deleted function 'std::__detail::_Hashtable_base<std::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::equal_to<std::pair<long long int, int> >, std::hash<std::pair<long long int, 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 cities.cpp:1:
/usr/include/c++/10/bits/hashtable_policy.h:1725:10: note: 'std::__detail::_Hashtable_base<std::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::equal_to<std::pair<long long int, int> >, std::hash<std::pair<long long 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:
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::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::hash<std::pair<long long int, int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
cities.cpp: In function 'void solve(int)':
cities.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
61 | f(i,0,g[u].size()){
| ~~~~~~~~~~~~~~~
cities.cpp:61:3: note: in expansion of macro 'f'
61 | f(i,0,g[u].size()){
| ^
cities.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
62 | f(j,0,v[mask].size()){
| ~~~~~~~~~~~~~~~~~~
cities.cpp:62:4: note: in expansion of macro 'f'
62 | f(j,0,v[mask].size()){
| ^
cities.cpp: At global scope:
cities.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
71 | main(){
| ^~~~
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 cities.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::pair<long long int, int>; _Value = std::pair<long long int, int>; _ExtractKey = std::__detail::_Identity; _H1 = std::hash<std::pair<long long 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++/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::pair<long long int, int>; _NodeGenerator = std::__detail::_AllocNode<std::allocator<std::__detail::_Hash_node<std::pair<long long int, int>, true> > >; _Key = std::pair<long long int, int>; _Value = std::pair<long long int, int>; _Alloc = std::allocator<std::pair<long long int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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::_Hashtable_base<std::pair<long long int, int>, std::pair<long long int, int>, std::__detail::_Identity, std::equal_to<std::pair<long long int, int> >, std::hash<std::pair<long long int, 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::pair<long long int, int>; _Value = std::pair<long long int, int>; _Alloc = std::allocator<std::pair<long long int, int> >; _ExtractKey = std::__detail::_Identity; _Equal = std::equal_to<std::pair<long long int, int> >; _H1 = std::hash<std::pair<long long 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>; std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::__ireturn_type = std::__detail::_Insert<std::pair<long long int, int>, std::pair<long long int, int>, std::allocator<std::pair<long long int, int> >, std::__detail::_Identity, std::equal_to<std::pair<long long int, int> >, std::hash<std::pair<long long 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; std::__detail::_Insert<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true>::value_type = std::pair<long long int, 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::pair<long long int, int>; _Hash = std::hash<std::pair<long lon