#2637
ZOO
Intr-o gradina zoologica reprezentata printr-o matrice A
cu n
linii si m
coloane. Fiecare cusca se afla intr-o pozitie din matrice si contine x
animale. De exemplu daca A[2][6] = 5
inseamna ca in cusca de pe linia 2
si coloana 6
se afla 5
animale. Sa se raspunda la Q
intrebari de forma i1, j1, i2, j2
unde raspunsul va fi numarul de animale din dreptunghiul din matrice cu cordonatele coltului din stanga sus i1 si j1
si cordonatele coltului din dreapta jos i2 si j2
, unde i
reprezinta linia si j
coloana.
-
Problema | ZOO | Operații I/O |
zoo.in /zoo.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #35876083 | Utilizator | |
Fișier | zoo.cpp | Dimensiune | 887 B |
Data încărcării | 25 Martie 2022, 15:23 | Scor / rezultat | Eroare de compilare |
zoo.cpp: In function 'int main()': zoo.cpp:13:60: error: no matching function for call to 'std::vector<std::vector<long long int> >::vector(int, std::vector<int>)' vector<vector<long long> > sp(n + 1, vector<int>(m + 1)); ^ zoo.cpp:13:60: note: candidates are: In file included from /usr/include/c++/4.8/vector:64:0, from zoo.cpp:2: /usr/include/c++/4.8/bits/stl_vector.h:392:9: note: template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) vector(_InputIterator __first, _InputIterator __last, ^ /usr/include/c++/4.8/bits/stl_vector.h:392:9: note: template argument deduction/substitution failed: zoo.cpp:13:60: note: deduced conflicting types for parameter '_InputIterator' ('int' and 'std::vector<int>') vector<vector<long long> > sp(n + 1, vector<int>(m + 1)); ^ In file included from /usr/include/c++/4.8/vector:64:0, from zoo.cpp:2: /usr/include/c++/4.8/bits/stl_vector.h:364:7: note: std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(initializer_list<value_type> __l, ^ /usr/include/c++/4.8/bits/stl_vector.h:364:7: note: no known conversion for argument 1 from 'int' to 'std::initializer_list<std::vector<long long int> >' /usr/include/c++/4.8/bits/stl_vector.h:340:7: note: std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(vector&& __rv, const allocator_type& __m) ^ /usr/include/c++/4.8/bits/stl_vector.h:340:7: note: no known conversion for argument 1 from 'int' to 'std::vector<std::vector<long long int> >&&' /usr/include/c++/4.8/bits/stl_vector.h:331:7: note: std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(const vector& __x, const allocator_type& __a) ^ /usr/include/c++/4.8/bits/stl_vector.h:331:7: note: no known conversion for argument 1 from 'int' to 'const std::vector<std::vector<long long int> >&' /usr/include/c++/4.8/bits/stl_vector.h:327:7: note: std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >] vector(vector&& __x) noexcept ^ /usr/include/c++/4.8/bits/stl_vector.h:327:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/4.8/bits/stl_vector.h:310:7: note: std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >] vector(const vector& __x) ^ /usr/include/c++/4.8/bits/stl_vector.h:310:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/4.8/bits/stl_vector.h:281:7: note: std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>::size_type, const value_type&, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::size_type = unsigned int; std::vector<_Tp, _Alloc>::value_type = std::vector<long long int>; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(size_type __n, const value_type& __value, ^ /usr/include/c++/4.8/bits/stl_vector.h:281:7: note: no known conversion for argument 2 from 'std::vector<int>' to 'const value_type& {aka const std::vector<long long int>&}' /usr/include/c++/4.8/bits/stl_vector.h:269:7: note: std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>::size_type, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::size_type = unsigned int; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(size_type __n, const allocator_type& __a = allocator_type()) ^ /usr/include/c++/4.8/bits/stl_vector.h:269:7: note: no known conversion for argument 2 from 'std::vector<int>' to 'const allocator_type& {aka const std::allocator<std::vector<long long int> >&}' /usr/include/c++/4.8/bits/stl_vector.h:256:7: note: std::vector<_Tp, _Alloc>::vector(const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::vector<long long int> >] vector(const allocator_type& __a) ^ /usr/include/c++/4.8/bits/stl_vector.h:256:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/4.8/bits/stl_vector.h:248:7: note: std::vector<_Tp, _Alloc>::vector() [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >] vector() ^ /usr/include/c++/4.8/bits/stl_vector.h:248:7: note: candidate expects 0 arguments, 2 provided
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema ZOO 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ă.