#1337
Eroul nostru Susan se află într-un turn de formă cubică, de latură n. El dorește să ajungă la comoara ascunsă în interiorul turnului. Din fericire, Susan a făcut rost de o hartă care îi indică cu exactitate coordonatele locului în care se află comoara din turn. Eroul nostru vrea să știe care este distanța minimă pe care o poate parcurge pentru a ajunge la comoară.
| Problema | Susan | Operații I/O |
turn.in/turn.out
|
|---|---|---|---|
| Limita timp | 0.2 secunde | Limita memorie |
Total: 32 MB
/
Stivă 8 MB
|
| Id soluție | #59850324 | Utilizator | |
| Fișier | susan.cpp | Dimensiune | 3.87 KB |
| Data încărcării | 10 Octombrie 2025, 18:25 | Scor/rezultat | Eroare de compilare |
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/c++allocator.h:33:0, from /usr/include/c++/4.8/bits/allocator.h:46, from /usr/include/c++/4.8/string:41, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from susan.cpp:1: /usr/include/c++/4.8/ext/new_allocator.h: In instantiation of 'void __gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = Cell; _Args = {int&, int&, int&}; _Tp = Cell]': /usr/include/c++/4.8/bits/deque.tcc:137:6: required from 'void std::deque<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {int&, int&, int&}; _Tp = Cell; _Alloc = std::allocator<Cell>]' /usr/include/c++/4.8/bits/stl_queue.h:223:4: required from 'void std::queue<_Tp, _Sequence>::emplace(_Args&& ...) [with _Args = {int&, int&, int&}; _Tp = Cell; _Sequence = std::deque<Cell, std::allocator<Cell> >]' susan.cpp:98:31: required from here /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: new initializer expression list treated as compound expression [-fpermissive] { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } ^ /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: no matching function for call to 'Cell::Cell(int&)' /usr/include/c++/4.8/ext/new_allocator.h:120:4: note: candidates are: susan.cpp:11:8: note: Cell::Cell() struct Cell { ^ susan.cpp:11:8: note: candidate expects 0 arguments, 1 provided susan.cpp:11:8: note: constexpr Cell::Cell(const Cell&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'const Cell&' susan.cpp:11:8: note: constexpr Cell::Cell(Cell&&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'Cell&&' In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/c++allocator.h:33:0, from /usr/include/c++/4.8/bits/allocator.h:46, from /usr/include/c++/4.8/string:41, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from susan.cpp:1: /usr/include/c++/4.8/ext/new_allocator.h: In instantiation of 'void __gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = Cell; _Args = {int, int&, int&}; _Tp = Cell]': /usr/include/c++/4.8/bits/deque.tcc:137:6: required from 'void std::deque<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {int, int&, int&}; _Tp = Cell; _Alloc = std::allocator<Cell>]' /usr/include/c++/4.8/bits/stl_queue.h:223:4: required from 'void std::queue<_Tp, _Sequence>::emplace(_Args&& ...) [with _Args = {int, int&, int&}; _Tp = Cell; _Sequence = std::deque<Cell, std::allocator<Cell> >]' susan.cpp:112:34: required from here /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: new initializer expression list treated as compound expression [-fpermissive] { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } ^ /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: no matching function for call to 'Cell::Cell(int&)' /usr/include/c++/4.8/ext/new_allocator.h:120:4: note: candidates are: susan.cpp:11:8: note: Cell::Cell() struct Cell { ^ susan.cpp:11:8: note: candidate expects 0 arguments, 1 provided susan.cpp:11:8: note: constexpr Cell::Cell(const Cell&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'const Cell&' susan.cpp:11:8: note: constexpr Cell::Cell(Cell&&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'Cell&&' In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/c++allocator.h:33:0, from /usr/include/c++/4.8/bits/allocator.h:46, from /usr/include/c++/4.8/string:41, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from susan.cpp:1: /usr/include/c++/4.8/ext/new_allocator.h: In instantiation of 'void __gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = Cell; _Args = {int&, int, int}; _Tp = Cell]': /usr/include/c++/4.8/bits/deque.tcc:137:6: required from 'void std::deque<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {int&, int, int}; _Tp = Cell; _Alloc = std::allocator<Cell>]' /usr/include/c++/4.8/bits/stl_queue.h:223:4: required from 'void std::queue<_Tp, _Sequence>::emplace(_Args&& ...) [with _Args = {int&, int, int}; _Tp = Cell; _Sequence = std::deque<Cell, std::allocator<Cell> >]' susan.cpp:135:36: required from here /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: new initializer expression list treated as compound expression [-fpermissive] { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } ^ /usr/include/c++/4.8/ext/new_allocator.h:120:4: error: no matching function for call to 'Cell::Cell(int)' /usr/include/c++/4.8/ext/new_allocator.h:120:4: note: candidates are: susan.cpp:11:8: note: Cell::Cell() struct Cell { ^ susan.cpp:11:8: note: candidate expects 0 arguments, 1 provided susan.cpp:11:8: note: constexpr Cell::Cell(const Cell&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'const Cell&' susan.cpp:11:8: note: constexpr Cell::Cell(Cell&&) susan.cpp:11:8: note: no known conversion for argument 1 from 'int' to 'Cell&&'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Susan face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.