Borderou de evaluare (job #3193577)
Utilizator | Data | 14 ianuarie 2024 22:39:02 | |
---|---|---|---|
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 'void citire()':
main.cpp:59:10: error: 'N' was not declared in this scope
59 | fin>>N>>M;
| ^
main.cpp:59:13: error: 'M' was not declared in this scope
59 | fin>>N>>M;
| ^
main.cpp: In function 'int main()':
main.cpp:82:20: error: 'm' was not declared in this scope
82 | for(int i=0; i<m && nr_muchii < n-1; i++)
| ^
main.cpp:82:37: error: 'n' was not declared in this scope
82 | for(int i=0; i<m && nr_muchii < n-1; i++)
| ^
main.cpp:90:29: error: 'struct Muchie' has no member named 'c'
90 | cmin+=Muchii[i].c; //adaugam costul Muchiei i la total
| ^
main.cpp:73:9: warning: unused variable 'x' [-Wunused-variable]
73 | int x,y;
| ^
main.cpp:73:11: warning: unused variable 'y' [-Wunused-variable]
73 | int x,y;
| ^
In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:71,
from /usr/include/c++/12.2.1/bits/specfun.h:45,
from /usr/include/c++/12.2.1/cmath:1935,
from /usr/include/c++/12.2.1/x86_64-pc-linux-gnu/bits/stdc++.h:41,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = Muchie*; _Iterator2 = Muchie*]':
/usr/include/c++/12.2.1/bits/stl_algo.h:1809:14: required from 'constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Muchie*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/include/c++/12.2.1/bits/stl_algo.h:1849:25: required from 'constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Muchie*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/include/c++/12.2.1/bits/stl_algo.h:1940:31: required from 'constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Muchie*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]'
/usr/include/c++/12.2.1/bits/stl_algo.h:4820:18: required from 'constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = Muchie*]'
main.cpp:80:9: required from here
/usr/include/c++/12.2.1/bits/predefined_ops.h:45:23: error: no match for 'operator<' (operand types are 'Muchie' and 'Muchie')
45 | { return *__it1 < *__it2; }
| ~~~~~~~^~~~~~~~
In file included from /usr/include/c++/12.2.1/bits/stl_algobase.h:67:
/usr/include/c++/12.2.1/bits/stl_iterator.h:1185:5: note: candidate: 'template<class _IteratorL, class _IteratorR, class _Container> constexpr std::__detail::__synth3way_t<_IteratorR, _IteratorL> __gnu_cxx::operator<=>(const __normal_iterator<_IteratorL, _Container>&, const __normal_iterator<_IteratorR, _Container>&)' (reversed)
1185 | operator<=>(const __normal_iterator<_IteratorL, _Container>& __lhs,
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1185:5: note: template argument deduction/substitution failed:
/usr/include/c++/12.2.1/bits/predefined_ops.h:45:23: note: 'Muchie' is not derived from 'const __gnu_cxx::__normal_iterator<_IteratorL, _Container>'
45 | { return *__it1 < *__it2; }
| ~~~~~~~^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1204:5: note: candidate: 'template<class _Iterator, class _Container> constexpr std::__detail::__synth3way_t<_T1> __gnu_cxx::operator<=>(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&)' (rewritten)
1204 | operator<=>(const __normal_iterator<_Iterator, _Container>& __lhs,
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator.h:1204:5: note: template argument deduction/substitution failed:
/usr/include/c++/12.2.1/bits/predefined_ops.h:45:23: note: 'Muchie' is not derived from 'const __gnu_cxx::__normal_iterator<_Iterator, _Container>'
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !