#4410
Turcane
Pe un câmp asemănător cu o tablă de şah cu M
linii şi N
coloane, o ţurcană se află în pătrăţelul de coordonate (1,1)
aflat în colţul din stânga-sus al tablei şi vrea să ajungă în pătrăţelul de coordonate (M,N)
aflat în colţul din dreapta-jos al tablei. Ea poate efectua sărituri de lungime cel mult P
la dreapta, de lungime cel mult Q
în jos, de lungime cel mult R
pe diagonală spre dreapta-jos, precum şi săritura calului, adică două pătrăţele la dreapta şi unul în jos sau două în jos şi unul la dreapta. Orice săritură trebuie să schimbe poziţia ţurcanei. Se dă un număr întreg C
.
- Dacă C=1
, să se determine numărul minim de sărituri necesare pentru a ajunge în pătrăţelul de coordonate (M,N)
.
- Dacă C=2
, să se determine numărul de moduri în care poate să ajungă în pătrăţelul de coordonate (M,N)
, nu neapărat cu număr minim de sărituri.
OJI 2023, clasele XI-XII
Problema | Turcane | Operații I/O |
turcane.in /turcane.out
|
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 256 MB
/
Stivă 64 MB
|
Id soluție | #48326947 | Utilizator | |
Fișier | turcane.cpp | Dimensiune | 2.27 KB |
Data încărcării | 22 Ianuarie 2024, 11:38 | Scor / rezultat | Eroare de compilare |
turcane.cpp: In function 'int cerinta1()': turcane.cpp:26:14: error: missing template arguments before 'c' pair c = Q.front(); ^ turcane.cpp:26:14: error: expected ';' before 'c' turcane.cpp:28:22: error: 'c' was not declared in this scope if ( viz[min(c.first + q, n)][c.second] == 0 || viz[min(c.first + q, n)][c.second] > viz[c.first][c.second] + 1 ) { ^ turcane.cpp:30:56: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)' Q.push ( { min(c.first + q, n), c.second } ); ^ turcane.cpp:30:56: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from turcane.cpp:3: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}' turcane.cpp:33:18: error: 'c' was not declared in this scope if ( viz[c.first][min(c.second + p, m)] == 0 || viz[c.first][min(c.second + p, m)] > viz[c.first][c.second] + 1 ) { ^ turcane.cpp:35:56: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)' Q.push ( { c.first, min(c.second + p, m) } ); ^ turcane.cpp:35:56: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from turcane.cpp:3: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}' turcane.cpp:38:15: error: 'c' was not declared in this scope if ( (c.first + 2 <= n && c.second + 1 <= m ) && ( viz[c.first + 2][c.second + 1] == 0 || viz[c.first + 2][c.second + 1] > viz[c.first][c.second] + 1 ) ) { ^ turcane.cpp:40:49: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)' Q.push ( {c.first + 2, c.second + 1}); ^ turcane.cpp:40:49: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from turcane.cpp:3: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}' turcane.cpp:43:15: error: 'c' was not declared in this scope if ( (c.first + 1 <= n && c.second + 2 <= m ) && ( viz[c.first + 1][c.second + 2] == 0 || viz[c.first + 1][c.second + 2] > viz[c.first][c.second] + 1 ) ) { ^ turcane.cpp:45:50: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)' Q.push ( {c.first + 1, c.second + 2} ); ^ turcane.cpp:45:50: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from turcane.cpp:3: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}' turcane.cpp:49:14: error: 'c' was not declared in this scope if ( c.first + r1 > n ) ^ turcane.cpp:52:14: error: 'c' was not declared in this scope if ( c.second + r1 > m ) ^ turcane.cpp:55:18: error: 'c' was not declared in this scope if ( viz[c.first + r1][c.second + r1] == 0 || viz[c.first + r1][c.second + r1] > viz[c.first][c.second] + 1 ) { ^ turcane.cpp:57:52: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)' Q.push ( {c.first + r1, c.second + r1} ); ^ turcane.cpp:57:52: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from turcane.cpp:3: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:217:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Turcane 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ă.