Submission #1188795

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188795		simona1230	Scales (IOI15_scales)	C++20	Compilation error	0 ms	0 KiB

scales

#include "scales.h"
//#include "graderlib.c"
#include <bits/stdc++.h>
using namespace std;

int id,p[1024][32],h[32],in[32];
void perm(int i)
{
    if(i==7)
    {
        id++;
        for(int j=1; j<=6; j++)
            p[id][h[j]]=j;
        return;
    }

    for(int j=1; j<=6; j++)
    {
        if(in[j])continue;
        in[j]=1;
        h[i]=j;
        perm(i+1);
        in[j]=0;
    }
}

unordered_map<vector<int>, int> mp;
bool build(vector<int> v,int cnt)
{
    if(mp[v]!=0)
    {
        if(mp[v]==-1)return 0;
        return 1;
    }

    if(v.size()<=1)return 1;

    for(int i1=1; i1<=4; i1++)
    {
        for(int i2=i1+1; i2<=5; i2++)
        {
            for(int i3=i2+1; i3<=6; i3++)
            {
                for(int t=0; t<=2; t++)
                {
                    vector<int> v1= {},v2= {},v3= {};
                    for(int i=0; i<v.size(); i++)
                    {
                        int j=v[i];
                        if(t==0)
                        {
                            if(p[j][i1]<p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                            else if(p[j][i2]<p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                            else v3.push_back(j);
                        }
                        if(t==1)
                        {
                            if(p[j][i1]>p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                            else if(p[j][i1]>p[j][i3]&&p[j][i1]<p[j][i2])v1.push_back(j);
                            else if(p[j][i2]>p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                            else if(p[j][i2]>p[j][i3]&&p[j][i2]<p[j][i1])v2.push_back(j);
                            else v3.push_back(j);
                        }
                        if(t==2)
                        {
                            if(p[j][i1]>p[j][i2]&&p[j][i1]>p[j][i3])v1.push_back(j);
                            else if(p[j][i2]>p[j][i1]&&p[j][i2]>p[j][i3])v2.push_back(j);
                            else v3.push_back(j);
                        }
                    }

                    if(v1.size()<=cnt/3&&v2.size()<=cnt/3&&v3.size()<=cnt/3&&build(v1,cnt/3)&&build(v2,cnt/3)&&build(v3,cnt/3))
                    {
                        mp[v]=i1*1000+i2*100+i3*10+t;
                        return 1;
                    }
                }

                for(int i4=1; i4<=6; i4++)
                {
                    if(i1==i4||i2==i4||i3==i4)continue;
                    vector<int> v1= {},v2= {},v3= {};
                    for(int i=0; i<v.size(); i++)
                    {
                        int j=v[i];
                        int h1=7,h2=7,h3=7;
                        if(p[j][i1]>p[j][i4])h1=p[j][i1];
                        if(p[j][i2]>p[j][i4])h2=p[j][i2];
                        if(p[j][i3]>p[j][i4])h3=p[j][i3];
                        if(h1+h2+h3==21)
                        {
                            if(p[j][i1]<p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                            else if(p[j][i2]<p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                            else v3.push_back(j);
                        }
                        else
                        {
                            int mn=min(h1,min(h2,h3));
                            if(mn==h1)v1.push_back(j);
                            else if(mn==h2)v2.push_back(j);
                            else v3.push_back(j);
                        }
                    }

                    if(v1.size()<=cnt/3&&v2.size()<=cnt/3&&v3.size()<=cnt/3&&build(v1,cnt/3)&&build(v2,cnt/3)&&build(v3,cnt/3))
                    {
                        mp[v]=i4*10000+i1*1000+i2*100+i3*10+3;
                        return 1;
                    }
                }
            }
        }
    }

    mp[v]=-1;
    return 0;
}

void init(int T) {}
int ans[6];

void orderCoins()
{
    perm(1);
    vector<int> v;
    for(int i=1; i<=id; i++)
        v.push_back(i);
    build(v,729);
    //cout<<mp[v]<<endl;

    while(v.size()>1)
    {
        int i1=mp[v]/1000%10;
        int i2=mp[v]/100%10;
        int i3=mp[v]/10%10;
        int i4=mp[v]/10000;
        int t=mp[v]%10;

        vector<int> v1= {},v2= {},v3= {};

        for(int i=0; i<v.size(); i++)
        {
            int j=v[i];
            if(t==0)
            {
                if(p[j][i1]<p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                else if(p[j][i2]<p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                else v3.push_back(j);
            }
            else if(t==1)
            {
                if(p[j][i1]>p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                else if(p[j][i1]>p[j][i3]&&p[j][i1]<p[j][i2])v1.push_back(j);
                else if(p[j][i2]>p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                else if(p[j][i2]>p[j][i3]&&p[j][i2]<p[j][i1])v2.push_back(j);
                else v3.push_back(j);
            }
            else if(t==2)
            {
                if(p[j][i1]>p[j][i2]&&p[j][i1]>p[j][i3])v1.push_back(j);
                else if(p[j][i2]>p[j][i1]&&p[j][i2]>p[j][i3])v2.push_back(j);
                else v3.push_back(j);
            }
            else
            {
                int h1=7,h2=7,h3=7;
                if(p[j][i1]>p[j][i4])h1=p[j][i1];
                if(p[j][i2]>p[j][i4])h2=p[j][i2];
                if(p[j][i3]>p[j][i4])h3=p[j][i3];
                if(h1+h2+h3==21)
                {
                    if(p[j][i1]<p[j][i2]&&p[j][i1]<p[j][i3])v1.push_back(j);
                    else if(p[j][i2]<p[j][i1]&&p[j][i2]<p[j][i3])v2.push_back(j);
                    else v3.push_back(j);
                }
                else
                {
                    int mn=min(h1,min(h2,h3));
                    if(mn==h1)v1.push_back(j);
                    else if(mn==h2)v2.push_back(j);
                    else v3.push_back(j);
                }
            }
        }

        int x;
        if(t==0)x=getLightest(i1,i2,i3);
        else if(t==1)x=getMedian(i1,i2,i3);
        else if(t==2)x=getHeaviest(i1,i2,i3);
        else x=getNextLightest(i1,i2,i3,i4);

        if(x==i1)v=v1;
        else if(x==i2)v=v2;
        else v=v3;
    }


    for(int i=1;i<=6;i++)
        ans[p[v[0]][i]-1]=i;
    answer(ans);
}
/*
int main()
{
    orderCoins();
    return 0;
}
*/

Compilation message (stderr)

scales.cpp:27:33: error: use of deleted function 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::vector<int>; _Tp = int; _Hash = std::hash<std::vector<int> >; _Pred = std::equal_to<std::vector<int> >; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >]'
   27 | unordered_map<vector<int>, int> mp;
      |                                 ^~
In file included from /usr/include/c++/11/unordered_map:47,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/unordered_map.h:141:7: note: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::vector<int>; _Tp = int; _Hash = std::hash<std::vector<int> >; _Pred = std::equal_to<std::vector<int> >; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >]' is implicitly deleted because the default definition would be ill-formed:
  141 |       unordered_map() = default;
      |       ^~~~~~~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:141:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<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, false, true>]'
In file included from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable.h:528:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<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, false, true>]' is implicitly deleted because the default definition would be ill-formed:
  528 |       _Hashtable() = default;
      |       ^~~~~~~~~~
/usr/include/c++/11/bits/hashtable.h:528:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/11/bits/hashtable.h:35,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable_policy.h:1604:7: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
 1604 |       _Hashtable_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1604: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::vector<int>; _Value = std::pair<const std::vector<int>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]'
/usr/include/c++/11/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::vector<int> >]':
/usr/include/c++/11/bits/hashtable_policy.h:1210:7:   required from here
/usr/include/c++/11/bits/hashtable_policy.h:1127:49: error: use of deleted function 'std::hash<std::vector<int> >::hash()'
 1127 |       _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
      |                                                 ^~~~~
In file included from /usr/include/c++/11/string_view:42,
                 from /usr/include/c++/11/bits/basic_string.h:48,
                 from /usr/include/c++/11/string:55,
                 from /usr/include/c++/11/bits/locale_classes.h:40,
                 from /usr/include/c++/11/bits/ios_base.h:41,
                 from /usr/include/c++/11/ios:42,
                 from /usr/include/c++/11/istream:38,
                 from /usr/include/c++/11/sstream:38,
                 from /usr/include/c++/11/complex:45,
                 from /usr/include/c++/11/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
                 from scales.cpp:3:
/usr/include/c++/11/bits/functional_hash.h:102:12: note: 'std::hash<std::vector<int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/11/bits/functional_hash.h:102:12: error: no matching function for call to 'std::__hash_enum<std::vector<int>, false>::__hash_enum()'
/usr/include/c++/11/bits/functional_hash.h:83:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::vector<int>; bool <anonymous> = false]'
   83 |       __hash_enum(__hash_enum&&);
      |       ^~~~~~~~~~~
/usr/include/c++/11/bits/functional_hash.h:83:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<int>; bool <anonymous> = false]' is private within this context
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/11/bits/functional_hash.h:84:7: note: declared private here
   84 |       ~__hash_enum();
      |       ^
In file included from /usr/include/c++/11/bits/hashtable.h:35,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable_policy.h:1210:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<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:
 1210 |       _Hash_code_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1210:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/11/bits/hashtable_policy.h:1124:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<int> >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
 1124 |     struct _Hashtable_ebo_helper<_Nm, _Tp, true>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1124:12: error: use of deleted function 'std::hash<std::vector<int> >::~hash()'
In file included from /usr/include/c++/11/string_view:42,
                 from /usr/include/c++/11/bits/basic_string.h:48,
                 from /usr/include/c++/11/string:55,
                 from /usr/include/c++/11/bits/locale_classes.h:40,
                 from /usr/include/c++/11/bits/ios_base.h:41,
                 from /usr/include/c++/11/ios:42,
                 from /usr/include/c++/11/istream:38,
                 from /usr/include/c++/11/sstream:38,
                 from /usr/include/c++/11/complex:45,
                 from /usr/include/c++/11/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:54,
                 from scales.cpp:3:
/usr/include/c++/11/bits/functional_hash.h:102:12: note: 'std::hash<std::vector<int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/11/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::vector<int>; bool <anonymous> = false]' is private within this context
/usr/include/c++/11/bits/functional_hash.h:84:7: note: declared private here
   84 |       ~__hash_enum();
      |       ^
In file included from /usr/include/c++/11/bits/hashtable.h:35,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable_policy.h:1604:7: error: use of deleted function 'std::__detail::_Hash_code_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::hash<std::vector<int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
 1604 |       _Hashtable_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1188:12: note: 'std::__detail::_Hash_code_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::hash<std::vector<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:
 1188 |     struct _Hash_code_base
      |            ^~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1188:12: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::vector<int> >, true>::~_Hashtable_ebo_helper()'
In file included from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable.h:528:7: error: use of deleted function 'std::__detail::_Hashtable_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::equal_to<std::vector<int> >, std::hash<std::vector<int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()'
  528 |       _Hashtable() = default;
      |       ^~~~~~~~~~
In file included from /usr/include/c++/11/bits/hashtable.h:35,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable_policy.h:1561:12: note: 'std::__detail::_Hashtable_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::equal_to<std::vector<int> >, std::hash<std::vector<int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()' is implicitly deleted because the default definition would be ill-formed:
 1561 |     struct _Hashtable_base
      |            ^~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1561:12: error: use of deleted function 'std::__detail::_Hash_code_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::hash<std::vector<int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, true>::~_Hash_code_base()'
In file included from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable.h:528:7: error: use of deleted function 'constexpr std::_Enable_default_constructor<false, _Tag>::_Enable_default_constructor() [with _Tag = std::__detail::_Hash_node_base]'
  528 |       _Hashtable() = default;
      |       ^~~~~~~~~~
In file included from /usr/include/c++/11/bits/hashtable.h:36,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/enable_special_members.h:113:15: note: declared here
  113 |     constexpr _Enable_default_constructor() noexcept = delete;
      |               ^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/11/bits/hashtable.h:35,
                 from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/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(const _Key&) const [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::vector<int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true; std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::__hash_code = long unsigned int]':
/usr/include/c++/11/bits/hashtable_policy.h:702:45:   required from 'std::__detail::_Map_base<_Key, _Pair, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::mapped_type& std::__detail::_Map_base<_Key, _Pair, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::operator[](const key_type&) [with _Key = std::vector<int>; _Pair = std::pair<const std::vector<int>, int>; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<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, false, true>; std::__detail::_Map_base<_Key, _Pair, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::mapped_type = int; std::__detail::_Map_base<_Key, _Pair, _Alloc, std::__detail::_Select1st, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, true>::key_type = std::vector<int>]'
/usr/include/c++/11/bits/unordered_map.h:980:20:   required from 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = std::vector<int>; _Tp = int; _Hash = std::hash<std::vector<int> >; _Pred = std::equal_to<std::vector<int> >; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = std::vector<int>]'
scales.cpp:30:12:   required from here
/usr/include/c++/11/bits/hashtable_policy.h:1217:23: error: static assertion failed: hash function must be invocable with an argument of key type
 1217 |         static_assert(__is_invocable<const _Hash&, const _Key&>{},
      |                       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/11/bits/hashtable_policy.h:1217:23: note: 'std::__is_invocable<const std::hash<std::vector<int> >&, const std::vector<int, std::allocator<int> >&>{}' evaluates to false
/usr/include/c++/11/bits/hashtable_policy.h:1219:25: error: no match for call to '(const std::hash<std::vector<int> >) (const std::vector<int>&)'
 1219 |         return _M_hash()(__k);
      |                ~~~~~~~~~^~~~~
In file included from /usr/include/c++/11/unordered_map:46,
                 from /usr/include/c++/11/functional:61,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from scales.cpp:3:
/usr/include/c++/11/bits/hashtable.h: In instantiation of 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::~_Hashtable() [with _Key = std::vector<int>; _Value = std::pair<const std::vector<int>, int>; _Alloc = std::allocator<std::pair<const std::vector<int>, int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::vector<int> >; _Hash = std::hash<std::vector<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, false, true>]':
/usr/include/c++/11/bits/unordered_map.h:102:11:   required from here
/usr/include/c++/11/bits/hashtable.h:1534:5: error: use of deleted function 'std::__detail::_Hashtable_base<std::vector<int>, std::pair<const std::vector<int>, int>, std::__detail::_Select1st, std::equal_to<std::vector<int> >, std::hash<std::vector<int> >, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Hashtable_traits<true, false, true> >::~_Hashtable_base()'
 1534 |     }
      |     ^