Borderou de evaluare (job #2330263)
Utilizator | Data | 28 ianuarie 2019 10:21:39 | |
---|---|---|---|
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 'void coada(int)':
main.cpp:22:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<v[nod].size();j++)
~^~~~~~~~~~~~~~
main.cpp:15:13: warning: variable 'cost' set but not used [-Wunused-but-set-variable]
int nod,cost,i,j;
^~~~
main.cpp: In function 'int main()':
main.cpp:41:14: error: 'INT_MAX' was not declared in this scope
d[i]=INT_MAX;
^~~~~~~
In file included from /usr/include/c++/6/string:48:0,
from /usr/include/c++/6/bits/locale_classes.h:40,
from /usr/include/c++/6/bits/ios_base.h:41,
from /usr/include/c++/6/ios:42,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from main.cpp:1:
/usr/include/c++/6/bits/stl_function.h: In instantiation of 'constexpr bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = dist]':
/usr/include/c++/6/bits/predefined_ops.h:125:18: required from 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<dist*, std::vector<dist, std::allocator<dist> > >; _Iterator2 = __gnu_cxx::__normal_iterator<dist*, std::vector<dist, std::allocator<dist> > >; _Compare = std::less<dist>]'
/usr/include/c++/6/bits/stl_heap.h:217:14: required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<dist*, std::vector<dist, std::allocator<dist> > >; _Distance = long int; _Tp = dist; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<std::less<dist> >]'
/usr/include/c++/6/bits/stl_heap.h:335:22: required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<dist*, std::vector<dist, std::allocator<dist> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<std::less<dist> >]'
/usr/include/c++/6/bits/stl_heap.h:388:23: required from 'void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<dist*, std::vector<dist, std::allocator<dist> > >; _Compare = std::less<dist>]'
/usr/include/c++/6/bits/stl_queue.h:447:23: required from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = dist; _Sequence = std::vector<dist, std::allocator<dist> >; _Compare = std::less<dist>]'
main.cpp:12:23: required from here
/usr/include/c++/6/bits/stl_function.h:386:20: error: no match for 'operator<' (operand types are 'const dist' and 'const dist')
{ return __x < __y; }
~~~~^~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:64:0,
from /usr/include/c++/6/bits/char_traits.h:39,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from main.cpp:1:
/usr/include/c++/6/bits/stl_pair.h:441:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^~~~~~~~
/usr/include/c++/6/bits/stl_pair.h:441:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/6/string:48:0,
from /usr/include/c++/6/bits/locale_classes.h:40,
from /usr/include/c++/6/bits/ios_base.h:41,
from /usr/include/c++/6/ios:42,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from main.cpp:1:
/usr/include/c++/6/bits/stl_function.h:386:20: note: 'const dist' is not derived from 'const std::pair<_T1, _T2>'
{ return __x < __y; }
~~~~^~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/bits/char_traits.h:39,
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !