Problem | binaryroads |
---|---|
User | user123 |
Submission Time | 2023-07-18 15:47:46 |
Score | 0 |
Max Time | N/A |
Max Memory | N/A |
Owl Get a Life
binaryroads.cpp: In function ‘void dijkstra(int)’:
binaryroads.cpp:29:29: error: ‘d’ was not declared in this scope
29 | for (int a=0; a<n; a++) d[a]=INT32_MAX;
| ^
binaryroads.cpp:33:5: error: ‘d’ was not declared in this scope
33 | d[0]=0;
| ^
binaryroads.cpp:46:48: error: no matching function for call to ‘std::priority_queue<node, std::vector<node>, rule>::push(<brace-enclosed initializer list>)’
46 | pq.push({d[b.x], b.x, 1-cur.st});
| ^
In file included from /usr/include/c++/9/queue:64,
from binaryroads.cpp:3:
/usr/include/c++/9/bits/stl_queue.h:627:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = node; _Sequence = std::vector<node>; _Compare = rule; std::priority_queue<_Tp, _Sequence, _Compare>::value_t