QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#577779 | #9313. Make Max | trj | Compile Error | / | / | C++23 | 4.3kb | 2024-09-20 14:45:59 | 2024-09-20 14:45:59 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
answer.code: In function ‘void solve()’: answer.code:156:65: error: too many initializers for ‘std::array<long long int, 3>’ 156 | st.in (array<ll, 3>{a[i - 1], lst, i - 1}); | ^ answer.code:167:22: error: deduced type ‘std::array<long long int, 3>’ for ‘<structured bindings>’ is incomplete 167 | auto [x, l1, r1] = *st.be; | ^~~~~~~~~~~ In file included from /usr/include/c++/13/bits/uses_allocator_args.h:38, from /usr/include/c++/13/bits/memory_resource.h:41, from /usr/include/c++/13/string:58, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from answer.code:1: /usr/include/c++/13/tuple:2005:45: note: declaration of ‘struct std::array<long long int, 3>’ 2005 | template<typename _Tp, size_t _Nm> struct array; | ^~~~~ answer.code:177:58: error: too many initializers for ‘std::array<long long int, 3>’ 177 | st.er (array<ll, 3>{a[r0], l0, r0}); | ^ answer.code:182:58: error: too many initializers for ‘std::array<long long int, 3>’ 182 | st.er (array<ll, 3>{a[r2], l2, r2}); | ^ answer.code:187:58: error: too many initializers for ‘std::array<long long int, 3>’ 187 | st.er (array<ll, 3>{a[r0], l0, r0}); | ^ answer.code:188:58: error: too many initializers for ‘std::array<long long int, 3>’ 188 | st.er (array<ll, 3>{a[r2], l2, r2}); | ^ answer.code:191:44: error: too many initializers for ‘std::array<long long int, 3>’ 191 | st.in (array<ll, 3>{t, l, r}); | ^ In file included from /usr/include/c++/13/bits/stl_tree.h:69, from /usr/include/c++/13/set:62, from answer.code:6: /usr/include/c++/13/ext/aligned_buffer.h: In instantiation of ‘struct __gnu_cxx::__aligned_membuf<std::array<long long int, 3> >’: /usr/include/c++/13/bits/stl_tree.h:231:41: required from ‘struct std::_Rb_tree_node<std::array<long long int, 3> >’ /usr/include/c++/13/bits/stl_tree.h:359:17: required from ‘const _Tp& std::_Rb_tree_const_iterator<_Tp>::operator*() const [with _Tp = std::array<long long int, 3>; reference = const std::array<long long int, 3>&]’ answer.code:167:26: required from here /usr/include/c++/13/ext/aligned_buffer.h:56:65: error: invalid application of ‘sizeof’ to incomplete type ‘std::array<long long int, 3>’ 56 | alignas(__alignof__(_Tp2::_M_t)) unsigned char _M_storage[sizeof(_Tp)]; | ^~~~~~~~~~~ In file included from /usr/include/c++/13/bits/move.h:37, from /usr/include/c++/13/bits/exception_ptr.h:41, from /usr/include/c++/13/exception:164, from /usr/include/c++/13/ios:41: /usr/include/c++/13/type_traits: In instantiation of ‘struct std::is_nothrow_destructible<std::array<long long int, 3> >’: /usr/include/c++/13/bits/alloc_traits.h:554:41: required from ‘static constexpr void std::allocator_traits<std::allocator<_CharT> >::destroy(allocator_type&, _Up*) [with _Up = std::array<long long int, 3>; _Tp = std::_Rb_tree_node<std::array<long long int, 3> >; allocator_type = std::allocator<std::_Rb_tree_node<std::array<long long int, 3> > >]’ /usr/include/c++/13/bits/stl_tree.h:625:24: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_destroy_node(_Link_type) [with _Key = std::array<long long int, 3>; _Val = std::array<long long int, 3>; _KeyOfValue = std::_Identity<std::array<long long int, 3> >; _Compare = std::less<std::array<long long int, 3> >; _Alloc = std::allocator<std::array<long long int, 3> >; _Link_type = std::_Rb_tree_node<std::array<long long int, 3> >*]’ /usr/include/c++/13/bits/stl_tree.h:633:2: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_drop_node(_Link_type) [with _Key = std::array<long long int, 3>; _Val = std::array<long long int, 3>; _KeyOfValue = std::_Identity<std::array<long long int, 3> >; _Compare = std::less<std::array<long long int, 3> >; _Alloc = std::allocator<std::array<long long int, 3> >; _Link_type = std::_Rb_tree_node<std::array<long long int, 3> >*]’ /usr/include/c++/13/bits/stl_tree.h:1938:4: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare,...