#4652
Scrieţi un program care, cunoscând n şi m (dimensiunile picturii), respectiv înălţimile pixelilor 3D, rezolvă următoarele trei cerinţe:
1. determină numărul maxim de culori pure care se combină pe un pixel 3D;
2. determină numărul de culori distincte care apar în pictura creată conform algoritmului aplicat de robotul Vasile;
3. determină dimensiunea maximă a unei zone formată din pixeli 3D de aceeaşi culoare, diferită de alb.
ONI 2024, clasa a 7-a
| Problema | pictura | Operații I/O |
pictura.in/pictura.out
|
|---|---|---|---|
| Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #63835736 | Utilizator | |
| Fișier | pictura.cpp | Dimensiune | 4.09 KB |
| Data încărcării | 20 Martie 2026, 18:59 | Scor/rezultat | Eroare de compilare |
pictura.cpp:17:25: error: expected identifier before numeric constant vector<int> culoare(1, 0); ^ pictura.cpp:17:25: error: expected ',' or '...' before numeric constant pictura.cpp: In function 'void coloreaza2(int, int, int)': pictura.cpp:60:52: error: 'v[ln][col].patratel::culoare' does not have class type && !binary_search(v[ln][col].culoare.begin(), v[ln][col].culoare.end(), color)) ^ pictura.cpp:60:80: error: 'v[ln][col].patratel::culoare' does not have class type && !binary_search(v[ln][col].culoare.begin(), v[ln][col].culoare.end(), color)) ^ pictura.cpp:63:35: error: 'v[ln][col].patratel::culoare' does not have class type v[ln][col].culoare. push_back(color); ^ pictura.cpp: In function 'int main()': pictura.cpp:161:41: error: no matching function for call to 'std::set<std::vector<int> >::insert(<unresolved overloaded function type>)' s.insert(v[i][j].culoare); ^ pictura.cpp:161:41: note: candidates are: In file included from /usr/include/c++/4.8/set:61:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:86, from pictura.cpp:1: /usr/include/c++/4.8/bits/stl_set.h:460:7: note: std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename _Alloc::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename _Alloc::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>] insert(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_set.h:460:7: note: no known conversion for argument 1 from '<unresolved overloaded function type>' to 'const value_type& {aka const std::vector<int>&}' /usr/include/c++/4.8/bits/stl_set.h:469:7: note: std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename _Alloc::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Key>, _Compare, typename _Alloc::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>] insert(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_set.h:469:7: note: no known conversion for argument 1 from '<unresolved overloaded function type>' to 'std::set<std::vector<int> >::value_type&& {aka std::vector<int>&&}' /usr/include/c++/4.8/bits/stl_set.h:497:7: note: std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>] insert(const_iterator __position, const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_set.h:497:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/4.8/bits/stl_set.h:502:7: note: std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::vector<int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::vector<int>] insert(const_iterator __position, value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_set.h:502:7: note: candidate expects 2 arguments, 1 provided /usr/include/c++/4.8/bits/stl_set.h:517:2: note: template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >] insert(_InputIterator __first, _InputIterator __last) ^ /usr/include/c++/4.8/bits/stl_set.h:517:2: note: template argument deduction/substitution failed: pictura.cpp:161:41: note: candidate expects 2 arguments, 1 provided s.insert(v[i][j].culoare); ^ In file included from /usr/include/c++/4.8/set:61:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:86, from pictura.cpp:1: /usr/include/c++/4.8/bits/stl_set.h:529:7: note: void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::vector<int>; _Compare = std::less<std::vector<int> >; _Alloc = std::allocator<std::vector<int> >] insert(initializer_list<value_type> __l) ^ /usr/include/c++/4.8/bits/stl_set.h:529:7: note: no known conversion for argument 1 from '<unresolved overloaded function type>' to 'std::initializer_list<std::vector<int> >'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema pictura 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ă.