Borderou de evaluare (job #3270400)
Utilizator | Data | 23 ianuarie 2025 10:49:30 | |
---|---|---|---|
Problema | Lanterna | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:24:12: error: template argument 1 is invalid
24 | vector<data> g[NMAX + 5];
| ^
main.cpp:24:12: error: template argument 2 is invalid
main.cpp: In function 'void dij()':
main.cpp:58:36: error: 'begin' was not declared in this scope
58 | for(auto i : g[current_node])
| ^
main.cpp:58:36: note: suggested alternatives:
In file included from /usr/include/c++/12.2.1/vector:67,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/range_access.h:114:37: note: 'std::begin'
114 | template<typename _Tp> const _Tp* begin(const valarray<_Tp>&) noexcept;
| ^~~~~
In file included from /usr/include/c++/12.2.1/bits/ranges_algobase.h:39,
from /usr/include/c++/12.2.1/bits/ranges_algo.h:35,
from /usr/include/c++/12.2.1/algorithm:63,
from main.cpp:3:
/usr/include/c++/12.2.1/bits/ranges_base.h:566:44: note: 'std::ranges::__cust::begin'
566 | inline constexpr __cust_access::_Begin begin{};
| ^~~~~
In file included from /usr/include/c++/12.2.1/bits/stl_iterator_base_types.h:71,
from /usr/include/c++/12.2.1/bits/stl_algobase.h:65,
from /usr/include/c++/12.2.1/vector:60:
/usr/include/c++/12.2.1/bits/iterator_concepts.h:969:10: note: 'std::ranges::__cust_access::begin'
969 | void begin(const auto&) = delete;
| ^~~~~
main.cpp:58:36: error: 'end' was not declared in this scope
58 | for(auto i : g[current_node])
| ^
main.cpp:58:36: note: suggested alternatives:
/usr/include/c++/12.2.1/bits/range_access.h:116:37: note: 'std::end'
116 | template<typename _Tp> const _Tp* end(const valarray<_Tp>&) noexcept;
| ^~~
/usr/include/c++/12.2.1/bits/ranges_base.h:567:42: note: 'std::ranges::__cust::end'
567 | inline constexpr __cust_access::_End end{};
| ^~~
/usr/include/c++/12.2.1/bits/ranges_base.h:136:10: note: 'std::ranges::__cust_access::end'
136 | void end(const auto&) = delete;
| ^~~
main.cpp:68:23: error: no matching function for call to 'std::priority_queue<point>::push(<brace-enclosed initializer list>)'
68 | q.push({i.node, costT[i.node], costw[i.node]});
| ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/12.2.1/queue:64,
from main.cpp:2:
/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 = point; _Sequence = std::vector<point, std::allocator<point> >; _Compare = std::less<point>; value_type = point]'
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<point>::value_type&' {aka 'const point&'}
738 | push(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 !