Borderou de evaluare (job #1324198)
Utilizator | Data | 21 ianuarie 2015 22:33:32 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void Dijkstra()’:
user.cpp:110:14: error: cannot convert ‘std::pair<int, int>’ to ‘int’ in assignment
Node = Heap.front();
^
user.cpp:118:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i = 0; i < Graph[Node].size(); i++) {
^
user.cpp: In instantiation of ‘void priorityQueue<T>::sort() [with T = std::pair<int, int>]’:
user.cpp:147:12: required from here
user.cpp:55:35: error: no matching function for call to ‘priorityQueue<std::pair<int, int> >::sort(std::vector<std::pair<int, int> >::iterator, std::vector<std::pair<int, int> >::iterator, bool (&)(std::pair<int, int>, std::pair<int, int>))’
sort(H.begin(), H.end(), compare);
^
user.cpp:55:35: note: candidate is:
user.cpp:53:7: note: void priorityQueue<T>::sort() [with T = std::pair<int, int>]
void sort() {
^
user.cpp:53:7: note: candidate expects 0 arguments, 3 provided
user.cpp: In instantiation of ‘void priorityQueue<T>::down(int) [with T = std::pair<int, int>]’:
user.cpp:38:22: required from ‘void priorityQueue<T>::pop() [with T = std::pair<int, int>]’
user.cpp:111:18: required from here
user.cpp:74:21: error: no match for ‘operator=’ (operand types are ‘std::pair<int, int>’ and ‘int’)
son = 0;
^
user.cpp:74:21: note: candidates are:
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_pair.h:158:7: note: std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(const std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]
operator=(const pair& __p)
^
/usr/include/c++/4.8/bits/stl_pair.h:158:7: note: no known conversion for argument 1 from ‘int’ to ‘const std::pair<int, int>&’
/usr/include/c++/4.8/bits/stl_pair.h:166:7: note: std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) [with _T1 = int; _T2 = int]
operator=(pair&& __p)
^
/usr/include/c++/4.8/bits/stl_pair.h:166:7: note: no known conversion for argument 1 from ‘int’ to ‘std::pair<int, int>&&’
/usr/include/c++/4.8/bits/stl_pair.h:177:2: note: template<class _U1, class _U2> std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(const std::pair<_U1, _U2>&) [with _U1 = _U1; _U2 = _U2; _T1 = int; _T2 = int]
operator=(const pair<_U1, _U2>& __p)
^
/usr/include/c++/4.8/bits/stl_pair.h:177:2: note: template argument deduction/substitution failed:
user.cpp:74:21: note: mismatched types ‘const std::pair<_T1, _T2>’ and ‘int’
son = 0;
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !