Borderou de evaluare (job #1634291)
Utilizator | Data | 6 martie 2016 13:39:58 | |
---|---|---|---|
Problema | Avioane2 | Status | done |
Runda | ONIS 2016, Runda 1 | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:27:32: error: ‘kMaxM’ was not declared in this scope
vector<pair<int, int> > vertex[kMaxM];
^
user.cpp:29:14: error: ‘kMaxNM’ was not declared in this scope
int best_djk[kMaxNM];
^
user.cpp: In function ‘int main()’:
user.cpp:61:17: error: ‘vertex’ was not declared in this scope
vertex[node_cnt - 1].push_back({node_cnt, 0});
^
user.cpp:68:9: error: ‘vertex’ was not declared in this scope
vertex[get_node(itr.a, itr.x)].push_back({get_node(itr.b, itr.y), itr.cost});
^
user.cpp:72:9: error: ‘best_djk’ was not declared in this scope
best_djk[i] = +inf;
^
user.cpp:74:5: error: ‘best_djk’ was not declared in this scope
best_djk[get_node(0, 0)] = 0;
^
user.cpp:88:25: error: ‘vertex’ was not declared in this scope
for (auto itr : vertex[node]) {
^
user.cpp:91:58: error: no matching function for call to ‘std::priority_queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)’
pq.push({-best_djk[itr.first], itr.first});
^
user.cpp:91:58: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
from user.cpp:5:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]
push(const value_type& __x)
^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const value_type& {aka const std::pair<int, int>&}’
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::less<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>]
push(value_type&& __x)
^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::priority_queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}’
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !