Borderou de evaluare (job #2295706)
Utilizator | Data | 3 decembrie 2018 21:38:00 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int main()':
main.cpp:36:20: error: no match for 'operator[]' (operand types are 'std::vector<std::pair<int, int> > [1000001]' and 'std::pair<int, int>')
int s=A[nod][i];
^
main.cpp:39:23: error: no match for 'operator[]' (operand types are 'int [1000001]' and 'std::pair<int, int>')
R[s]=R[nod]+1;
^
main.cpp:40:25: error: no matching function for call to 'std::priority_queue<std::pair<int, int> >::push(int&)'
Q.push(s);
^
In file included from /usr/include/c++/6/queue:64:0,
from main.cpp:4:
/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 = 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++/6/bits/stl_queue.h:558:7: note: no known conversion for argument 1 from 'int' to 'const value_type& {aka const std::pair<int, 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 = 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++/6/bits/stl_queue.h:566:7: note: no known conversion for argument 1 from 'int' to 'std::priority_queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}'
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !