QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#186755 | #5540. City Hall | MaMengQi | Compile Error | / | / | C++20 | 2.0kb | 2023-09-24 11:14:50 | 2023-09-24 11:14:52 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
answer.code:19:22: error: use of deleted function ‘std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::array<long long int, 3>; _Tp = long long int; _Hash = std::hash<std::array<long long int, 3> >; _Pred = std::equal_to<std::array<long long int, 3> >; _Alloc = std::allocator<std::pair<const std::array<long long int, 3>, long long int> >]’ 19 | unordered_map<ar,ll> d; | ^ 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 answer.code:1: /usr/include/c++/11/bits/unordered_map.h:141:7: note: ‘std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::array<long long int, 3>; _Tp = long long int; _Hash = std::hash<std::array<long long int, 3> >; _Pred = std::equal_to<std::array<long long int, 3> >; _Alloc = std::allocator<std::pair<const std::array<long long int, 3>, long long 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::array<long long int, 3>; _Value = std::pair<const std::array<long long int, 3>, long long int>; _Alloc = std::allocator<std::pair<const std::array<long long int, 3>, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::array<long long int, 3> >; _Hash = std::hash<std::array<long long int, 3> >; _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 answer.code:1: /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::array<long long int, 3>; _Value = std::pair<const std::array<long long int, 3>, long long int>; _Alloc = std::allocator<std::pair<const std::array<long long int, 3>, long long int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::array<long long int, 3> >; _Hash = std::hash<std::array<long long int, 3> >; _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::array<long long int, 3>; _Value = std::pair<const std::array<long long int, 3>, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::array<long long int, 3> >; _Hash = std::hash<std::array<long long int, 3> >; _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 answer.code:1: /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::array<long long int, 3>; _Value = std::pair<const std::array<long long int, 3>, long long int>; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::array<long long int, 3> >; _Hash = std::hash<std::array<long long int, 3> >; _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 defa...