Rezumat problemă

pestelee

#3346

În arhipelagul X, ajunge un peşte de aur. După drumul obositor parcurs de peşte, el vrea să se relaxeze într-o anumită zonă din acest arhipelag (cu coordonatele x2, y2). Totodată, acest peşte este curios să afle câte modalităţi sunt ca să ajungă în acea zonă.

Fișiere Pinzaru Liviu (liviu0101) Ispir Alexandru medie

Clasa 11 Programare dinamică Probleme diverse de programare dinamică Algoritmul lui Lee

Rezolvă

Detalii

Problema	pestelee	Operații I/O	pestelee.in/pestelee.out
Limita timp	0.2 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64001473	Utilizator	Andrei Bancescu (Andreiban)
Fișier	pestelee.cpp	Dimensiune	1.33 KB
Data încărcării	03 Aprilie 2026, 15:15	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

pestelee.cpp: In function 'int main()':
pestelee.cpp:28:14: error: expected unqualified-id before '[' token
         auto [x,y]=q.front(); q.pop();

              ^
pestelee.cpp:30:20: error: 'x' was not declared in this scope
             int nx=x+dx[d], ny=y+dy[d];

                    ^
pestelee.cpp:31:28: error: 'ny' was not declared in this scope
             if(nx<1||nx>m||ny<1||ny>n) continue;

                            ^
pestelee.cpp:32:22: error: 'ny' was not declared in this scope
             if(a[nx][ny]==1) continue;

                      ^
pestelee.cpp:33:25: error: 'ny' was not declared in this scope
             if(dist[nx][ny]==-1){

                         ^
pestelee.cpp:34:38: error: 'y' was not declared in this scope
                 dist[nx][ny]=dist[x][y]+1;

                                      ^
pestelee.cpp:36:31: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)'
                 q.push({nx,ny});

                               ^
pestelee.cpp:36:31: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85,
                 from pestelee.cpp:4:
/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>&&}'
pestelee.cpp:37:45: error: 'y' was not declared in this scope
             } else if(dist[nx][ny]==dist[x][y]+1){

                                             ^

Cum funcționează evaluarea?