/ Vijos /

记录详情

Compile Error

/in/foo.cc: In function 'int main()':
/in/foo.cc:30:20: error: no matching function for call to 'std::priority_queue<int, std::vector<int>, Greater>::push(<brace-enclosed initializer list>)'
  q1.push({a[1].y,1});
                    ^
In file included from /usr/include/c++/6/queue:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:86,
                 from /in/foo.cc:1:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Greater; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(const value_type& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const int&}'
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Greater; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(value_type&& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<int, std::vector<int>, Greater>::value_type&& {aka int&&}'
/in/foo.cc:31:20: error: no matching function for call to 'std::priority_queue<int, std::vector<int>, Less>::push(<brace-enclosed initializer list>)'
  q2.push({a[1].y,1});
                    ^
In file included from /usr/include/c++/6/queue:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:86,
                 from /in/foo.cc:1:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Less; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(const value_type& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const int&}'
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Less; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(value_type&& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<int, std::vector<int>, Less>::value_type&& {aka int&&}'
/in/foo.cc:33:21: error: no matching function for call to 'std::priority_queue<int, std::vector<int>, Greater>::push(<brace-enclosed initializer list>)'
   q1.push({a[i].y,i});
                     ^
In file included from /usr/include/c++/6/queue:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:86,
                 from /in/foo.cc:1:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Greater; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(const value_type& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const int&}'
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Greater; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(value_type&& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<int, std::vector<int>, Greater>::value_type&& {aka int&&}'
/in/foo.cc:34:24: error: no matching function for call to 'std::priority_queue<int, std::vector<int>, Less>::push(<brace-enclosed initializer list>)'
      q2.push({a[i].y,i});
                        ^
In file included from /usr/include/c++/6/queue:64:0,
                 from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:86,
                 from /in/foo.cc:1:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Less; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(const value_type& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const int&}'
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Less; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]
       push(value_type&& __x)
       ^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<int, std::vector<int>, Less>::value_type&& {aka int&&}'
/in/foo.cc:36:4: error: 'tmin' was not declared in this scope
    tmin=q1.top();
    ^~~~
/in/foo.cc:37:7: error: 'tmax' was not declared in this scope
       tmax=q2.top();
       ^~~~
/in/foo.cc:32:10: warning: unused variable 'j' [-Wunused-variable]
  for(int j=1,i=2;i<=N;i++){
          ^
In file included from /usr/include/c++/6/bits/stl_algobase.h:71:0,
                 from /usr/include/c++/6/bits/char_traits.h:39,
                 from /usr/include/c++/6/ios:40,
                 from /usr/include/c++/6/istream:38,
                 from /usr/include/c++/6/sstream:38,
                 from /usr/include/c++/6/complex:45,
                 from /usr/include/c++/6/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:52,
                 from /in/foo.cc:1:
/usr/include/c++/6/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Iterator2 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = Greater]':
/usr/include/c++/6/bits/stl_heap.h:217:14:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<Greater>]'
/usr/include/c++/6/bits/stl_heap.h:335:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<Greater>]'
/usr/include/c++/6/bits/stl_heap.h:388:23:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = Greater]'
/usr/include/c++/6/bits/stl_queue.h:447:23:   required from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = Greater]'
/in/foo.cc:27:42:   required from here
/usr/include/c++/6/bits/predefined_ops.h:125:18: error: no match for call to '(Greater) (int&, int&)'
         { return bool(_M_comp(*__it1, *__it2)); }
                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/foo.cc:12:7: note: candidate: bool Greater::operator()(XX, XX)
  bool operator()(XX a,XX b){
       ^~~~~~~~
/in/foo.cc:12:7: note:   no known conversion for a

信息

递交者
类型
递交
题目
P1266 花盆宽度
语言
C++
递交时间
2024-10-08 12:17:34
评测时间
2024-10-08 12:17:34
评测机
分数
0
总耗时
0ms
峰值内存
0 Bytes