Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #65006040

Rezumat problemă

Hamilton
#548

Se dă un graf neorientat cu n vârfuri. Determinați, dacă există, un ciclu hamiltonian.

Fișiere Candale Silviu (silviu) medie
Clasa 11 Teoria Grafurilor Parcurgerea grafurilor neorientate
Rezolvă

Detalii

Problema Hamilton Operații I/O hamilton.in/hamilton.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #65006040 Utilizator Grecu Vlad Ştefan (vladinfo)
Fișier hamilton.cpp Dimensiune 1.15 KB
Data încărcării 11 Iulie 2026, 20:59 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

hamilton.cpp: In function ‘void bkt(int)’:
hamilton.cpp:25:17: error: no match for ‘operator&&’ (operand types are ‘bool’ and ‘std::set<int>::iterator’ {aka ‘std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator’})
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |         ~~~~~~~ ^~~ ~~~~~~~~~~~~~~~~~~~~~~~~~
      |           |                      |
      |           bool                   std::set<int>::iterator {aka std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator}
hamilton.cpp:25:17: note: candidate: ‘operator&&(bool, bool)’ (built-in)
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hamilton.cpp:25:17: note:   no known conversion for argument 2 from ‘std::set<int>::iterator’ {aka ‘std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator’} to ‘bool’
In file included from /usr/include/c++/13/valarray:605,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:166,
                 from hamilton.cpp:1:
/usr/include/c++/13/bits/valarray_after.h:415:5: note: candidate: ‘template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)’
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘bool’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/bits/valarray_after.h:415:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)’
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘bool’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/bits/valarray_after.h:415:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)’
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   ‘std::set<int>::iterator’ {aka ‘std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator’} is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/bits/valarray_after.h:415:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)’
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘bool’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/bits/valarray_after.h:415:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__logical_and, typename _Dom1::value_type>::result_type> std::operator&&(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)’
  415 |     _DEFINE_EXPR_BINARY_OPERATOR(&&, struct std::__logical_and)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/valarray_after.h:415:5: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   ‘std::set<int>::iterator’ {aka ‘std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator’} is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/valarray:1206:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const valarray<_Tp>&, const valarray<_Tp>&)’
 1206 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1206:1: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   mismatched types ‘const std::valarray<_Tp>’ and ‘bool’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/valarray:1206:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)’
 1206 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1206:1: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   mismatched types ‘const std::valarray<_Tp>’ and ‘bool’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^
/usr/include/c++/13/valarray:1206:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__logical_and, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__logical_and, _Tp>::result_type> std::operator&&(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)’
 1206 | _DEFINE_BINARY_OPERATOR(&&, __logical_and)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/valarray:1206:1: note:   template argument deduction/substitution failed:
hamilton.cpp:25:45: note:   ‘std::set<int>::iterator’ {aka ‘std::_Rb_tree<int, int, std::_Identity<int>, std::less<int>, std::allocator<int> >::const_iterator’} is not derived from ‘const std::valarray<_Tp>’
   25 |     if (nr==n+1 and edges[1].find(drum[nr-1]))
      |                                             ^

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

  • probleme la care rezolvarea presupune scrierea unui program complet
  • probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema Hamilton face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

  • Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.

Du-te sus!