F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_37030707_11358.cpp: In function 'void solve()':
0_0_37030707_11358.cpp:46:20: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
   qa.push({a[i], i});
                    ^
0_0_37030707_11358.cpp:46:20: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(value_type&& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<Node>::value_type&& {aka Node&&}'
0_0_37030707_11358.cpp:48:28: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
   qab.push({a[i] + b[i], i});
                            ^
0_0_37030707_11358.cpp:48:28: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(value_type&& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<Node>::value_type&& {aka Node&&}'
0_0_37030707_11358.cpp:74:31: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
    qi.push({-cur.x, cur.id, 1});
                               ^
0_0_37030707_11358.cpp:74:31: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(value_type&& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<Node>::value_type&& {aka Node&&}'
0_0_37030707_11358.cpp:77:31: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
    qb.push({b[cur.id], cur.id});
                               ^
0_0_37030707_11358.cpp:77:31: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(value_type&& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<Node>::value_type&& {aka Node&&}'
0_0_37030707_11358.cpp:87:35: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
    qi.push({-a[cur.id], cur.id, 1});
                                   ^
0_0_37030707_11358.cpp:87:35: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(value_type&& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<Node>::value_type&& {aka Node&&}'
0_0_37030707_11358.cpp:88:35: error: no matching function for call to 'std::priority_queue<Node>::push(<brace-enclosed initializer list>)'
    qi.push({-b[cur.id], cur.id, 2});
                                   ^
0_0_37030707_11358.cpp:88:35: note: candidates are:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:85,
                 from 0_0_37030707_11358.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = Node; _Sequence = std::vector<Node, std::allocator<Node> >; _Compare = std::less<Node>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = Node]
       push(const value_type& __x)
       ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:499:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const Node&}'
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:507:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = Node; _Sequence = std::vect


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2025-01-11 00:47:48, Gzip enabled