Borderou de evaluare (job #3175916)
Utilizator | Data | 26 noiembrie 2023 15:43:56 | |
---|---|---|---|
Problema | Apm2 | Status | done |
Runda | Arhiva Monthly | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:28:159: error: could not convert '{-1, -1, 0}' from '<brace-enclosed initializer list>' to 'std::tuple<int, int, int>'
28 | void apmK(int &n, vector<vector<int>> &edges, vector<int> &parents, int &totalCost, set<tuple<int, int, int>> &apm, tuple<int, int, int> newEdge = {-1, -1, 0})
| ^
| |
| <brace-enclosed initializer list>
main.cpp:28:138: error: 'newEdge' has incomplete type
28 | void apmK(int &n, vector<vector<int>> &edges, vector<int> &parents, int &totalCost, set<tuple<int, int, int>> &apm, tuple<int, int, int> newEdge = {-1, -1, 0})
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:64,
from /usr/include/c++/12.2.1/string:50,
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/ostream:38,
from /usr/include/c++/12.2.1/iostream:39,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_pair.h:90:11: note: declaration of 'class std::tuple<int, int, int>'
90 | class tuple;
| ^~~~~
main.cpp: In function 'void apmK(int&, std::vector<std::vector<int> >&, std::vector<int>&, int&, std::set<std::tuple<int, int, int> >&, std::tuple<int, int, int>)':
main.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for (int i = 0; i < edges.size(); i++)
| ~~^~~~~~~~~~~~~~
main.cpp:49:27: error: no matching function for call to 'std::set<std::tuple<int, int, int> >::insert(<brace-enclosed initializer list>)'
49 | apm.insert({edges[i][2], edges[i][0], edges[i][1]});
| ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/set:61,
from main.cpp:5:
/usr/include/c++/12.2.1/bits/stl_set.h:566:9: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _Key = std::tuple<int, int, int>; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >]'
566 | insert(_InputIterator __first, _InputIterator __last)
| ^~~~~~
/usr/include/c++/12.2.1/bits/stl_set.h:566:9: note: template argument deduction/substitution failed:
main.cpp:49:27: note: candidate expects 2 arguments, 1 provided
49 | apm.insert({edges[i][2], edges[i][0], edges[i][1]});
| ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12.2.1/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::tuple<int, int, int>; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::tuple<int, int, int>, std::tuple<int, int, int>, std::_Identity<std::tuple<int, int, int> >, std::less<std::tuple<int, int, int> >, std::allocator<std::tuple<int, int, int> > >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::tuple<int, int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::tuple<int, int, int> >, std::tuple<int, int, int> >::rebind<std::tuple<int, int, int> >; typename _Alloc::value_type = std::tuple<int, int, int>; value_type = std::tuple<int, int, int>]'
509 | insert(const value_type& __x)
| ^~~~~~
/usr/include/c++/12.2.1/bits/stl_set.h:509:32: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const std::set<std::tuple<int, int, int> >::value_type&' {aka 'const std::tuple<int, int, int>&'}
509 | insert(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/12.2.1/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(value_type&&) [with _Key = std::tuple<int, int, int>; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::tuple<int, int, int>, std::tuple<int, int, int>, std::_Identity<std::tuple<int, int, int> >, std::less<std::tuple<int, int, int> >, std::allocator<std::tuple<int, int, int> > >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::tuple<int, int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::tuple<int, int, int> >, std::tuple<int, int, int> >::rebind<std::tuple<int, int, int> >; typename _Alloc::value_type = std::tuple<int, int, int>; value_type = std::tuple<int, int, int>]'
518 | insert(value_type&& __x)
| ^~~~~~
/usr/include/c++/12.2.1/bits/stl_set.h:518:27: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<std::tuple<int, int, int> >::value_type&&' {aka 'std::tuple<int, int, int>&&'}
518 | insert(value_type&& __x)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/12.2.1/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(const_iterator, const value_type&) [with _Key = std::tuple<int, int, int>; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::tuple<int, int, int> >; iterator = std::_Rb_tree<std::tuple<int, int, int>, std::tuple<int, int, int>, std::_Identity<std::tuple<int, int, int> >, std::less<std::tuple<int, int, int> >, std::allocator<std::tuple<int, int, int> > >::const_iterator; const_iterator = std::_Rb_tree<std::tuple<int, int, int>, std::tuple<int, int, int>, std::_Identity<std::tuple<int, int, int> >, std::less<std::tuple<int, int, int> >, std::allocator<std::tuple<int, int, int> > >::const_iterator; value_type = std::tuple<int, int, int>]'
546 | insert(const_iterator __position, const value_type& __x)
| ^~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !