QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#317617 | #7612. Matrix Inverse | bobcheeseburger | Compile Error | / | / | C++23 | 8.2kb | 2024-01-29 10:00:05 | 2024-01-29 10:00:07 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
In file included from /usr/include/c++/13/bits/stl_algobase.h:71, from /usr/include/c++/13/algorithm:60, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51, from answer.code:2: /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >*, std::vector<std::pair<std::pair<long long int, long long int>, ModInt<1000000007> > > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >*, std::vector<std::pair<std::pair<long long int, long long int>, ModInt<1000000007> > > >]’: /usr/include/c++/13/bits/stl_algo.h:1819:14: required from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<pair<long long int, long long int>, ModInt<1000000007> >*, vector<pair<pair<long long int, long long int>, ModInt<1000000007> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1859:25: required from ‘constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<pair<long long int, long long int>, ModInt<1000000007> >*, vector<pair<pair<long long int, long long int>, ModInt<1000000007> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1950:31: required from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<pair<long long int, long long int>, ModInt<1000000007> >*, vector<pair<pair<long long int, long long int>, ModInt<1000000007> > > >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<pair<pair<long long int, long long int>, ModInt<1000000007> >*, vector<pair<pair<long long int, long long int>, ModInt<1000000007> > > >]’ answer.code:240:6: required from here /usr/include/c++/13/bits/predefined_ops.h:45:23: error: no match for ‘operator<’ (operand types are ‘std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >’ and ‘std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >’) 45 | { return *__it1 < *__it2; } | ~~~~~~~^~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:67: /usr/include/c++/13/bits/stl_iterator.h:1189:5: note: candidate: ‘template<class _IteratorL, class _IteratorR, class _Container> constexpr std::__detail::__synth3way_t<_IteratorR, _IteratorL> __gnu_cxx::operator<=>(const __normal_iterator<_IteratorL, _Container>&, const __normal_iterator<_IteratorR, _Container>&)’ (reversed) 1189 | operator<=>(const __normal_iterator<_IteratorL, _Container>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator.h:1189:5: note: template argument deduction/substitution failed: /usr/include/c++/13/bits/predefined_ops.h:45:23: note: ‘std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >’ is not derived from ‘const __gnu_cxx::__normal_iterator<_IteratorL, _Container>’ 45 | { return *__it1 < *__it2; } | ~~~~~~~^~~~~~~~ In file included from /usr/include/c++/13/regex:68, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:181: /usr/include/c++/13/bits/regex.h:1288:5: note: candidate: ‘template<class _Bi_iter, class _Ch_traits, class _Alloc> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)’ (reversed) 1288 | operator<=>(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1288:5: note: template argument deduction/substitution failed: /usr/include/c++/13/bits/predefined_ops.h:45:23: note: ‘std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 45 | { return *__it1 < *__it2; } | ~~~~~~~^~~~~~~~ /usr/include/c++/13/bits/regex.h:1456:5: note: candidate: ‘template<class _Bi_iter> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)’ (reversed) 1456 | operator<=>(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1456:5: note: template argument deduction/substitution failed: /usr/include/c++/13/bits/predefined_ops.h:45:23: note: ‘std::pair<std::pair<long long int, long long int>, ModInt<1000000007> >’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 45 | { return *__it1 < *__it2; } ...