Borderou de evaluare (job #3327938)
| Utilizator | Data | 5 decembrie 2025 17:53:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
main.cpp:15:17: warning: integer constant is so large that it is unsigned
15 | int d[50001] = {inf}, rez[50001];
| ^~~
main.cpp:4:13: error: narrowing conversion of '10000000000000000000' from '__int128' to 'int' [-Wnarrowing]
4 | #define inf 10000000000000000000
| ^~~~~~~~~~~~~~~~~~~~
main.cpp:15:17: note: in expansion of macro 'inf'
15 | int d[50001] = {inf}, rez[50001];
| ^~~
main.cpp: In function 'int main()':
main.cpp:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<ura>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
39 | for (i=0;i<v[nod].size();i++)
| ~^~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/string:48,
from /usr/include/c++/12.2.1/bits/locale_classes.h:40,
from /usr/include/c++/12.2.1/bits/ios_base.h:41,
from /usr/include/c++/12.2.1/ios:42,
from /usr/include/c++/12.2.1/istream:38,
from /usr/include/c++/12.2.1/fstream:38,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_function.h: In instantiation of 'constexpr bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = ura]':
/usr/include/c++/12.2.1/bits/stl_tree.h:2533:33: required from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::find(const _Key&) [with _Key = ura; _Val = ura; _KeyOfValue = std::_Identity<ura>; _Compare = std::less<ura>; _Alloc = std::allocator<ura>; iterator = std::_Rb_tree<ura, ura, std::_Identity<ura>, std::less<ura>, std::allocator<ura> >::iterator]'
/usr/include/c++/12.2.1/bits/stl_set.h:795:25: required from 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::find(const key_type&) [with _Key = ura; _Compare = std::less<ura>; _Alloc = std::allocator<ura>; iterator = std::_Rb_tree<ura, ura, std::_Identity<ura>, std::less<ura>, std::allocator<ura> >::const_iterator; key_type = ura]'
main.cpp:46:28: required from here
/usr/include/c++/12.2.1/bits/stl_function.h:408:20: error: no match for 'operator<' (operand types are 'const ura' and 'const ura')
408 | { return __x < __y; }
| ~~~~^~~~~
In file included from /usr/include/c++/12.2.1/string:47:
/usr/include/c++/12.2.1/bits/stl_iterator.h:579:5: note: candidate: 'template<class _IteratorL, class _IteratorR> requires three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorR>&)' (reversed)
579 | operator<=>(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:579:5: note: template argument deduction/substitution failed:
/usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const ura' is not derived from 'const std::reverse_iterator<_IteratorL>'
408 | { return __x < __y; }
| ~~~~^~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1668:5: note: candidate: 'template<class _IteratorL, class _IteratorR> requires three_way_comparable_with<_IteratorR, _IteratorL, std::partial_ordering> constexpr std::compare_three_way_result_t<_IteratorL, _IteratorR> std::operator<=>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)' (reversed)
1668 | operator<=>(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1668:5: note: template argument deduction/substitution failed:
/usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const ura' is not derived from 'const std::move_iterator<_IteratorL>'
408 | { return __x < __y; }
| ~~~~^~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:597:5: note: candidate: 'template<class _Iterator> requires three_way_comparable<_Iterator, std::partial_ordering> constexpr std::compare_three_way_result_t<_Iterator, _Iterator> std::operator<=>(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorL>&)' (rewritten)
597 | operator<=>(const reverse_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:597:5: note: template argument deduction/substitution failed:
/usr/include/c++/12.2.1/bits/stl_function.h:408:20: note: 'const ura' is not derived from 'const std::reverse_iterator<_IteratorL>'
408 | { return __x < __y; }
| ~~~~^~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1734:5: note: candidate: 'template<class _Iterator> requires three_way_comparable<_Iterator, std::partial_ordering> constexpr std::compare_three_way_result_t<_Iterator, _Iterator> std::operator<=>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)' (rewritten)
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
