QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#533972#8712. Flooding WallZhaoZiLongCompile Error//C++20515b2024-08-26 17:55:182024-08-26 17:55:19

详细

answer.code: In function ‘bool cmp(node, node)’:
answer.code:11:18: error: ‘val’ was not declared in this scope
   11 |         return a,val>b.val;
      |                  ^~~
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:1:
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = long long int*; _Iterator2 = long long int*; _Compare = bool (*)(node, node)]’:
/usr/include/c++/13/bits/stl_algo.h:1819:14:   required from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = long long int*; _Compare = bool (*)(node, node)]’
answer.code:24:7:   required from here
/usr/include/c++/13/bits/predefined_ops.h:158:30: error: could not convert ‘* __it1’ from ‘long long int’ to ‘node’
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
      |                              |
      |                              long long int
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = long long int; _Iterator = long long int*; _Compare = bool (*)(node, node)]’:
/usr/include/c++/13/bits/stl_algo.h:1799:20:   required from ‘constexpr void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:1827:36:   required from ‘constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = long long int*; _Compare = bool (*)(node, node)]’
answer.code:24:7:   required from here
/usr/include/c++/13/bits/predefined_ops.h:240:30: error: could not convert ‘__val’ from ‘long long int’ to ‘node’
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
      |                              |
      |                              long long int
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = long long int*; _Value = long long int; _Compare = bool (*)(node, node)]’:
/usr/include/c++/13/bits/stl_heap.h:140:48:   required from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = long long int*; _Distance = long int; _Tp = long long int; _Compare = __gnu_cxx::__ops::_Iter_comp_val<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_heap.h:247:23:   required from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = long long int*; _Distance = long int; _Tp = long long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/include/c++/13/bits/stl_heap.h:356:22:   required from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = long long int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(node, node)>]’
/usr/incl...