#3265
Harta jocului PacMan este sub forma unui dreptunghi împărțit în camere organizate pe linii și coloane. Din fiecare cameră se poate merge în camera situate pe coloana următoare și pe aceeași linie, sau in camera de pe coloana următoare și linia următoare, dar fără a ieși din hartă. Astfel din camera (i,j) se poate merge în camerele (i,j+1) și (i+1,j+1). PacMan se află în camera situată pe prima linie și pe prima coloana (1,1) și trebuie să ajungă în camera de pe ultima linie și ultima coloană (n,m). Calculați și afișați numărul de trasee pe care poate PacMan să parcurgă harta.
| Problema | PacMan_XI | Operații I/O |
pacman_xi.in/pacman_xi.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64690717 | Utilizator | |
| Fișier | pacman_xi.cpp | Dimensiune | 392 B |
| Data încărcării | 23 Mai 2026, 14:27 | Scor/rezultat | Eroare de compilare |
pacman_xi.cpp:7:53: error: no matching function for call to ‘std::vector<std::vector<long long int> >::vector(int, std::vector<int>)’ 7 | vector<vector<long long>> dp(101, vector<int>(101,0));int n,m; | ^ In file included from /usr/include/c++/13/vector:66, from /usr/include/c++/13/queue:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157, from pacman_xi.cpp:1: /usr/include/c++/13/bits/stl_vector.h:707:9: note: candidate: ‘template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with <template-parameter-2-2> = _InputIterator; _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >]’ 707 | vector(_InputIterator __first, _InputIterator __last, | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:707:9: note: template argument deduction/substitution failed: pacman_xi.cpp:7:53: note: deduced conflicting types for parameter ‘_InputIterator’ (‘int’ and ‘std::vector<int>’) 7 | vector<vector<long long>> dp(101, vector<int>(101,0));int n,m; | ^ /usr/include/c++/13/bits/stl_vector.h:678:7: note: candidate: ‘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> >; allocator_type = std::allocator<std::vector<long long int> >]’ 678 | vector(initializer_list<value_type> __l, | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:678:43: note: no known conversion for argument 1 from ‘int’ to ‘std::initializer_list<std::vector<long long int> >’ 678 | vector(initializer_list<value_type> __l, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_vector.h:659:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, std::__type_identity_t<_Alloc>&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::__type_identity_t<_Alloc> = std::allocator<std::vector<long long int> >]’ 659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m) | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:659:23: note: no known conversion for argument 1 from ‘int’ to ‘std::vector<std::vector<long long int> >&&’ 659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m) | ~~~~~~~~~^~~~ /usr/include/c++/13/bits/stl_vector.h:640:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::false_type) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; allocator_type = std::allocator<std::vector<long long int> >; std::false_type = std::integral_constant<bool, false>]’ 640 | vector(vector&& __rv, const allocator_type& __m, false_type) | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:640:7: note: candidate expects 3 arguments, 2 provided /usr/include/c++/13/bits/stl_vector.h:635:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::true_type) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; allocator_type = std::allocator<std::vector<long long int> >; std::true_type = std::integral_constant<bool, true>]’ 635 | vector(vector&& __rv, const allocator_type& __m, true_type) noexcept | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:635:7: note: candidate expects 3 arguments, 2 provided /usr/include/c++/13/bits/stl_vector.h:624:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&, std::__type_identity_t<_Alloc>&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; std::__type_identity_t<_Alloc> = std::allocator<std::vector<long long int> >]’ 624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a) | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:624:28: note: no known conversion for argument 1 from ‘int’ to ‘const std::vector<std::vector<long long int> >&’ 624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a) | ~~~~~~~~~~~~~~^~~ /usr/include/c++/13/bits/stl_vector.h:620:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >]’ 620 | vector(vector&&) noexcept = default; | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:620:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/13/bits/stl_vector.h:601:7: note: candidate: ‘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> >]’ 601 | vector(const vector& __x) | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:601:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/13/bits/stl_vector.h:569:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(size_type, const value_type&, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; size_type = long unsigned int; value_type = std::vector<long long int>; allocator_type = std::allocator<std::vector<long long int> >]’ 569 | vector(size_type __n, const value_type& __value, | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:569:47: note: no known conversion for argument 2 from ‘std::vector<int>’ to ‘const std::vector<std::vector<long long int> >::value_type&’ {aka ‘const std::vector<long long int>&’} 569 | vector(size_type __n, const value_type& __value, | ~~~~~~~~~~~~~~~~~~^~~~~~~ /usr/include/c++/13/bits/stl_vector.h:556:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(size_type, const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; size_type = long unsigned int; allocator_type = std::allocator<std::vector<long long int> >]’ 556 | vector(size_type __n, const allocator_type& __a = allocator_type()) | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:556:51: note: no known conversion for argument 2 from ‘std::vector<int>’ to ‘const std::vector<std::vector<long long int> >::allocator_type&’ {aka ‘const std::allocator<std::vector<long long int> >&’} 556 | vector(size_type __n, const allocator_type& __a = allocator_type()) | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_vector.h:542:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector(const allocator_type&) [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >; allocator_type = std::allocator<std::vector<long long int> >]’ 542 | vector(const allocator_type& __a) _GLIBCXX_NOEXCEPT | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:542:7: note: candidate expects 1 argument, 2 provided /usr/include/c++/13/bits/stl_vector.h:531:7: note: candidate: ‘std::vector<_Tp, _Alloc>::vector() [with _Tp = std::vector<long long int>; _Alloc = std::allocator<std::vector<long long int> >]’ 531 | vector() = default; | ^~~~~~ /usr/include/c++/13/bits/stl_vector.h:531:7: note: candidate expects 0 arguments, 2 provided
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema PacMan_XI 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ă.