Borderou de evaluare (job #3271703)
Utilizator | Data | 27 ianuarie 2025 00:38:00 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int prim(int, std::vector<std::pair<int, int> >&)':
main.cpp:243:16: error: no matching function for call to 'std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::push(<brace-enclosed initializer list>)'
243 | pq.push({cost, 1, nod_vecin});
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/queue:64,
from main.cpp:224:
/usr/include/c++/12.2.1/bits/stl_queue.h:738:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::vector<std::tuple<int, int, int> >; _Compare = std::greater<void>; value_type = std::tuple<int, int, int>]'
738 | push(const value_type& __x)
| ^~~~
/usr/include/c++/12.2.1/bits/stl_queue.h:738:30: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::value_type&' {aka 'const std::tuple<int, int, int>&'}
738 | push(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/12.2.1/bits/stl_queue.h:746:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::vector<std::tuple<int, int, int> >; _Compare = std::greater<void>; value_type = std::tuple<int, int, int>]'
746 | push(value_type&& __x)
| ^~~~
/usr/include/c++/12.2.1/bits/stl_queue.h:746:25: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::value_type&&' {aka 'std::tuple<int, int, int>&&'}
746 | push(value_type&& __x)
| ~~~~~~~~~~~~~^~~
main.cpp:247:22: error: 'std::tuple<int, int, int> <structured bindings>' has incomplete type
247 | auto [cost, nod_curent, nod_vecin] = pq.top();
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:260:40: error: no matching function for call to 'std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::push(<brace-enclosed initializer list>)'
260 | pq.push({ muchie_cost, nod_vecin, vecin });
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/12.2.1/bits/stl_queue.h:738:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::vector<std::tuple<int, int, int> >; _Compare = std::greater<void>; value_type = std::tuple<int, int, int>]'
738 | push(const value_type& __x)
| ^~~~
/usr/include/c++/12.2.1/bits/stl_queue.h:738:30: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::value_type&' {aka 'const std::tuple<int, int, int>&'}
738 | push(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/12.2.1/bits/stl_queue.h:746:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::vector<std::tuple<int, int, int> >; _Compare = std::greater<void>; value_type = std::tuple<int, int, int>]'
746 | push(value_type&& __x)
| ^~~~
/usr/include/c++/12.2.1/bits/stl_queue.h:746:25: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int> >, std::greater<void> >::value_type&&' {aka 'std::tuple<int, int, int>&&'}
746 | push(value_type&& __x)
| ~~~~~~~~~~~~~^~~
In file included from /usr/include/c++/12.2.1/vector:64,
from main.cpp:223:
/usr/include/c++/12.2.1/bits/stl_vector.h: In instantiation of 'constexpr std::_Vector_base<_Tp, _Alloc>::~_Vector_base() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]':
/usr/include/c++/12.2.1/bits/stl_vector.h:526:7: required from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue() [with _Seq = std::vector<std::tuple<int, int, int> >; _Requires = void; _Tp = std::tuple<int, int, int>; _Sequence = std::vector<std::tuple<int, int, int> >; _Compare = std::greater<void>]'
main.cpp:237:80: required from here
/usr/include/c++/12.2.1/bits/stl_vector.h:367:49: error: invalid use of incomplete type 'class std::tuple<int, int, int>'
367 | _M_impl._M_end_of_storage - _M_impl._M_start);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
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,
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !