Borderou de evaluare (job #2613983)

Utilizator raresAlex95Rares Stan raresAlex95 Data 10 mai 2020 23:29: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 'std::vector<int> calculateCosts(std::vector<std::vector<int> >&)': main.cpp:28:40: error: 'INT_MAX' was not declared in this scope vector<int> finalCosts(graph.size(), INT_MAX); ^~~~~~~ main.cpp:31:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < graph.size(); i++) ~~^~~~~~~~~~~~~~ main.cpp:33:30: error: no matching function for call to 'std::set<nodeCost, classcomp>::insert(<brace-enclosed initializer list>)' costs.insert({i, INT_MAX}); ^ In file included from /usr/include/c++/6/set:61:0, from main.cpp:4: /usr/include/c++/6/bits/stl_set.h:480:7: note: candidate: std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::value_type = nodeCost] insert(const value_type& __x) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:480:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const nodeCost&}' /usr/include/c++/6/bits/stl_set.h:489:7: note: candidate: std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::value_type = nodeCost] insert(value_type&& __x) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:489:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<nodeCost, classcomp>::value_type&& {aka nodeCost&&}' /usr/include/c++/6/bits/stl_set.h:517:7: note: candidate: std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::value_type = nodeCost] insert(const_iterator __position, const value_type& __x) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:517:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/6/bits/stl_set.h:522:7: note: candidate: std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<nodeCost>; std::set<_Key, _Compare, _Alloc>::value_type = nodeCost] insert(const_iterator __position, value_type&& __x) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:522:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/6/bits/stl_set.h:537:2: note: candidate: template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>] insert(_InputIterator __first, _InputIterator __last) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:537:2: note: template argument deduction/substitution failed: main.cpp:33:30: note: candidate expects 2 arguments, 1 provided costs.insert({i, INT_MAX}); ^ In file included from /usr/include/c++/6/set:61:0, from main.cpp:4: /usr/include/c++/6/bits/stl_set.h:549:7: note: candidate: void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = nodeCost; _Compare = classcomp; _Alloc = std::allocator<nodeCost>] insert(initializer_list<value_type> __l) ^~~~~~ /usr/include/c++/6/bits/stl_set.h:549:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::initializer_list<nodeCost>' main.cpp:46:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < graph.size(); i++) ~~^~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:73:24: error: 'INT_MAX' was not declared in this scope vector<int> tmp(n, INT_MAX); ^~~~~~~ main.cpp:86:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < aa.size(); i++) Non zero exit status: 1

Ceva nu functioneaza?