#329
Bila
Se consideră o tablă de joc de formă dreptunghiulară, împărţită în n
linii şi m
coloane. Se obţin astfel n*m
zone şi se cunoaște înălțimea fiecărei zone. La o poziție cunoscută – linia istart
, coloana jstart
se află o bilă care se poate deplasa pe o poziție vecină (sus, jos, stânga, dreapta) doar dacă înălțimea poziției vecine este strict mai mică decât înălțimea poziției curente.
Determinați numărul maxim de zone prin care poate să treacă bila pentru a ajunge pe una dintre marginile tablei de joc.
Problema | Bila | Operații I/O |
bila.in /bila.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #54827854 | Utilizator | |
Fișier | bila.cpp | Dimensiune | 1020 B |
Data încărcării | 09 Decembrie 2024, 19:32 | Scor / rezultat | Eroare de compilare |
bila.cpp:12:18: warning: left operand of comma operator has no effect [-Wunused-value] pozitie d[5]={(2,2),(3,2),(3,3),(3,4),(3,5)}; ^ bila.cpp:12:24: warning: left operand of comma operator has no effect [-Wunused-value] pozitie d[5]={(2,2),(3,2),(3,3),(3,4),(3,5)}; ^ bila.cpp:12:30: warning: left operand of comma operator has no effect [-Wunused-value] pozitie d[5]={(2,2),(3,2),(3,3),(3,4),(3,5)}; ^ bila.cpp:12:36: warning: left operand of comma operator has no effect [-Wunused-value] pozitie d[5]={(2,2),(3,2),(3,3),(3,4),(3,5)}; ^ bila.cpp:12:42: warning: left operand of comma operator has no effect [-Wunused-value] pozitie d[5]={(2,2),(3,2),(3,3),(3,4),(3,5)}; ^ bila.cpp: In function 'bool sol(int)': bila.cpp:17:59: error: no match for 'operator==' (operand types are 'pozitie' and 'int') return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ bila.cpp:17:59: note: candidates are: In file included from /usr/include/c++/4.8/iosfwd:40:0, from /usr/include/c++/4.8/ios:38, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from bila.cpp:1: /usr/include/c++/4.8/bits/postypes.h:216:5: note: template<class _StateT> bool std::operator==(const std::fpos<_StateT>&, const std::fpos<_StateT>&) operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) ^ /usr/include/c++/4.8/bits/postypes.h:216:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::fpos<_StateT>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ 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 bila.cpp:1: /usr/include/c++/4.8/bits/stl_pair.h:214:5: note: template<class _T1, class _T2> constexpr bool std::operator==(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&) operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) ^ /usr/include/c++/4.8/bits/stl_pair.h:214:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::pair<_T1, _T2>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 bila.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:291:5: note: template<class _Iterator> bool std::operator==(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&) operator==(const reverse_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:291:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::reverse_iterator<_Iterator>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 bila.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:341:5: note: template<class _IteratorL, class _IteratorR> bool std::operator==(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&) operator==(const reverse_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:341:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::reverse_iterator<_Iterator>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 bila.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1031:5: note: template<class _IteratorL, class _IteratorR> bool std::operator==(const std::move_iterator<_Iterator>&, const std::move_iterator<_IteratorR>&) operator==(const move_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1031:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::move_iterator<_Iterator>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 bila.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1037:5: note: template<class _Iterator> bool std::operator==(const std::move_iterator<_Iterator>&, const std::move_iterator<_Iterator>&) operator==(const move_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1037:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::move_iterator<_Iterator>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:41:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/allocator.h:128:5: note: template<class _T1, class _T2> bool std::operator==(const std::allocator<_CharT>&, const std::allocator<_T2>&) operator==(const allocator<_T1>&, const allocator<_T2>&) ^ /usr/include/c++/4.8/bits/allocator.h:128:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::allocator<_CharT>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:41:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/allocator.h:133:5: note: template<class _Tp> bool std::operator==(const std::allocator<_CharT>&, const std::allocator<_CharT>&) operator==(const allocator<_Tp>&, const allocator<_Tp>&) ^ /usr/include/c++/4.8/bits/allocator.h:133:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::allocator<_CharT>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:52:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2486:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const std::basic_string<_CharT, _Traits, _Alloc>&, const std::basic_string<_CharT, _Traits, _Alloc>&) operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2486:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:52:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2493:5: note: template<class _CharT> typename __gnu_cxx::__enable_if<std::__is_char<_Tp>::__value, bool>::__type std::operator==(const std::basic_string<_CharT>&, const std::basic_string<_CharT>&) operator==(const basic_string<_CharT>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2493:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::basic_string<_CharT>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:52:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2507:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const _CharT*, const std::basic_string<_CharT, _Traits, _Alloc>&) operator==(const _CharT* __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2507:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: mismatched types 'const _CharT*' and 'pozitie' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/string:52:0, 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 bila.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2519:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const std::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*) operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2519:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ In file included from /usr/include/c++/4.8/bits/locale_facets.h:48:0, from /usr/include/c++/4.8/bits/basic_ios.h:37, from /usr/include/c++/4.8/ios:44, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from bila.cpp:1: /usr/include/c++/4.8/bits/streambuf_iterator.h:204:5: note: template<class _CharT, class _Traits> bool std::operator==(const std::istreambuf_iterator<_CharT, _Traits>&, const std::istreambuf_iterator<_CharT, _Traits>&) operator==(const istreambuf_iterator<_CharT, _Traits>& __a, ^ /usr/include/c++/4.8/bits/streambuf_iterator.h:204:5: note: template argument deduction/substitution failed: bila.cpp:17:61: note: 'pozitie' is not derived from 'const std::istreambuf_iterator<_CharT, _Traits>' return st[k].l==1 || st[k].l==n || st[k].c==1 || st[k]==m; ^ bila.cpp: In function 'void bck(int)': bila.cpp:43:26: error: invalid conversion from 'pozitie*' to 'int' [-fpermissive] st[k].c=st[k-1].c+d][i].c; ^ bila.cpp:43:28: error: expected ';' before ']' token st[k].c=st[k-1].c+d][i].c; ^ bila.cpp:44:11: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses] if(valid(k)) ^ bila.cpp: In function 'bool sol(int)': bila.cpp:18:1: warning: control reaches end of non-void function [-Wreturn-type] } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Bila 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ă.