QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#306121#8005. Crossing the Borderucup-team1005#Compile Error//C++201.7kb2024-01-16 14:02:352024-01-16 14:02:36

Details

answer.code: In function ‘void work()’:
answer.code:58:73: error: no match for ‘operator>’ (operand types are ‘unsigned int’ and ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’})
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                 ~~~~~~~ ^ ~~~~~~~~~~~~~~~
      |                                                                   |                     |
      |                                                                   unsigned int          pii {aka std::pair<unsigned int, unsigned int>}
In file included from /usr/include/c++/13/regex:68,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:181,
                 from answer.code:4:
/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:
answer.code:58:89: note:   ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’} is not derived from ‘const std::__cxx11::sub_match<_BiIter>’
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                                         ^
/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:
answer.code:58:89: note:   ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’} is not derived from ‘const std::__cxx11::sub_match<_BiIter>’
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                                         ^
/usr/include/c++/13/bits/regex.h:1629:5: note: candidate: ‘template<class _Bi_iter> auto std::__cxx11::operator<=>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)’ (reversed)
 1629 |     operator<=>(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/regex.h:1629:5: note:   template argument deduction/substitution failed:
answer.code:58:89: note:   ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’} is not derived from ‘const std::__cxx11::sub_match<_BiIter>’
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                                         ^
In file included from /usr/include/c++/13/bits/stl_algobase.h:67,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51:
/usr/include/c++/13/bits/stl_iterator.h:583:5: note: candidate: ‘template<class _IteratorL, class _IteratorR>  requires  three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&)’ (reversed)
  583 |     operator<=>(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:583:5: note:   template argument deduction/substitution failed:
answer.code:58:89: note:   ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’} is not derived from ‘const std::reverse_iterator<_IteratorL>’
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                                         ^
/usr/include/c++/13/bits/stl_iterator.h:1690:5: note: candidate: ‘template<class _IteratorL, class _IteratorR>  requires  three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)’ (reversed)
 1690 |     operator<=>(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1690:5: note:   template argument deduction/substitution failed:
answer.code:58:89: note:   ‘pii’ {aka ‘std::pair<unsigned int, unsigned int>’} is not derived from ‘const std::move_iterator<_IteratorL>’
   58 |                 if (!flag || p.first > f[(1 << n) - 1].first || p.first > f[i | (1 << c)]) continue;
      |                                                                    ...