Rezumat problemă

Cub1

#628

Lui Andrei îi plac foarte mult jocurile de tip puzzle. De curând, el a descoperit un joc nou: un cub de dimensiune n format din n•n•n cuburi unitate sub forma unor cămăruţe. Cubul poate fi văzut ca o matrice tridimensionala ale cărei elemente sunt cămăruţele. Două cămăruţe se numesc adiacente dacă au o faţă comună. Astfel, o cămăruţă poate fi adiacentă cu maxim 6 cămăruţe. Scopul jocului este acela de a duce o bilă din cămăruţa de coordonate (1,1,1) în cămăruţa de coordonate (n,n,n). Bila poate trece dintr-o cămăruţă în alta doar dacă acestea sunt adiacente, iar noua cămăruţă este accesibilă din cămăruţa curentă.

Cunoscând n, dimensiunea cubului şi valorile asociate fiecărei cămăruţe, determinaţi:

a) cămăruța cu un număr maxim de cămăruțe ce pot fi accesate din ea;
b) un drum de lungime minimă de la cămăruţa (1,1,1) la cămăruţa (n,n,n).

Grigore Moisil, 2014

Fișiere Candale Silviu (silviu) Nicolae Dragos concurs

Clasa 10 Structuri de date liniare Coada Algoritmul lui Lee

Rezolvă

Detalii

Problema	Cub1	Operații I/O	cub1.in/cub1.out
Limita timp	2 secunde	Limita memorie	Total: 32 MB / Stivă 16 MB
Id soluție	#60889451	Utilizator	Lakatos Ioana Rebeka (Rebekaa1)
Fișier	cub1.cpp	Dimensiune	2.09 KB
Data încărcării	13 Noiembrie 2025, 22:14	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

cub1.cpp: In function 'int subpunctulb()':
cub1.cpp:42:19: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(<brace-enclosed initializer list>)'
     Q.push({1,1,1});

                   ^
cub1.cpp:42:19: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from cub1.cpp:4:
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::tuple<int, int, int>&}'
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}'
cub1.cpp:47:15: error: 'get' was not declared in this scope
        int ic=get<0>(Q.front());

               ^
cub1.cpp:64:29: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(<brace-enclosed initializer list>)'
            Q.push({iv,jv,kv});

                             ^
cub1.cpp:64:29: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from cub1.cpp:4:
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::tuple<int, int, int>&}'
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}'
In file included from /usr/include/c++/4.8/deque:64:0,
                 from /usr/include/c++/4.8/queue:60,
                 from cub1.cpp:4:
/usr/include/c++/4.8/bits/stl_deque.h: In instantiation of 'void std::deque<_Tp, _Alloc>::_M_destroy_data(std::deque<_Tp, _Alloc>::iterator, std::deque<_Tp, _Alloc>::iterator, const std::allocator<_CharT>&) [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; std::deque<_Tp, _Alloc>::iterator = std::_Deque_iterator<std::tuple<int, int, int>, std::tuple<int, int, int>&, std::tuple<int, int, int>*>]':
/usr/include/c++/4.8/bits/stl_deque.h:918:62:   required from 'std::deque<_Tp, _Alloc>::~deque() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
cub1.cpp:6:26:   required from here
/usr/include/c++/4.8/bits/stl_deque.h:1852:2: error: invalid use of incomplete type 'std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >::value_type {aka class std::tuple<int, int, int>}'
  if (!__has_trivial_destructor(value_type))
  ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from cub1.cpp:2:
/usr/include/c++/4.8/bits/stl_pair.h:83:11: error: declaration of 'std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >::value_type {aka class std::tuple<int, int, int>}'
     class tuple;
           ^
In file included from /usr/include/c++/4.8/deque:64:0,
                 from /usr/include/c++/4.8/queue:60,
                 from cub1.cpp:4:
/usr/include/c++/4.8/bits/stl_deque.h: In instantiation of 'void std::deque<_Tp, _Alloc>::pop_front() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]':
/usr/include/c++/4.8/bits/stl_queue.h:241:2:   required from 'void std::queue<_Tp, _Sequence>::pop() [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >]'
cub1.cpp:51:14:   required from here
/usr/include/c++/4.8/bits/stl_deque.h:1424:40: error: invalid use of incomplete type 'class std::tuple<int, int, int>'
      != this->_M_impl._M_start._M_last - 1)
                                        ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from cub1.cpp:2:
/usr/include/c++/4.8/bits/stl_pair.h:83:11: error: declaration of 'class std::tuple<int, int, int>'
     class tuple;
           ^
In file included from /usr/include/c++/4.8/deque:64:0,
                 from /usr/include/c++/4.8/queue:60,
                 from cub1.cpp:4:
/usr/include/c++/4.8/bits/stl_deque.h:1427:6: error: cannot increment a pointer to incomplete type 'std::tuple<int, int, int>'
      ++this->_M_impl._M_start._M_cur;
      ^
/usr/include/c++/4.8/bits/stl_deque.h: In instantiation of 'void std::_Deque_base<_Tp, _Alloc>::_M_initialize_map(std::size_t) [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; std::size_t = unsigned int]':
/usr/include/c++/4.8/bits/stl_deque.h:453:28:   required from 'std::_Deque_base<_Tp, _Alloc>::_Deque_base() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
/usr/include/c++/4.8/bits/stl_deque.h:783:15:   required from 'std::deque<_Tp, _Alloc>::deque() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
cub1.cpp:6:26:   required from here
/usr/include/c++/4.8/bits/stl_deque.h:584:74: error: invalid application of 'sizeof' to incomplete type 'std::tuple<int, int, int>'
       const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp))
                                                                          ^
/usr/include/c++/4.8/bits/stl_deque.h:615:31: error: invalid application of 'sizeof' to incomplete type 'std::tuple<int, int, int>'
      % __deque_buf_size(sizeof(_Tp)));
                               ^
/usr/include/c++/4.8/bits/stl_deque.h: In instantiation of 'void std::_Deque_base<_Tp, _Alloc>::_M_deallocate_node(_Tp*) [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]':
/usr/include/c++/4.8/bits/stl_deque.h:642:25:   required from 'void std::_Deque_base<_Tp, _Alloc>::_M_destroy_nodes(_Tp**, _Tp**) [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
/usr/include/c++/4.8/bits/stl_deque.h:566:42:   required from 'std::_Deque_base<_Tp, _Alloc>::~_Deque_base() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
/usr/include/c++/4.8/bits/stl_deque.h:783:15:   required from 'std::deque<_Tp, _Alloc>::deque() [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >]'
cub1.cpp:6:26:   required from here
/usr/include/c++/4.8/bits/stl_deque.h:539:65: error: invalid application of 'sizeof' to incomplete type 'std::tuple<int, int, int>'
  _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
                                                                 ^

Cum funcționează evaluarea?