Rezumat problemă

Suprasolicitare

#952

Hackerul Gigel e pus pe șotii. El încearcă să suprasolicite o rețea de calculatoare cu un pachet de date corupt. Ajutați-l să paseze la inifinit pachetul între calculatoare!

Fișiere Văran Tudor (tudorvaran) Tudor Văran dificilă

Clasa 10 Structuri de date liniare Coada Coada Algoritmul lui Lee

Rezolvă

Detalii

Problema	Suprasolicitare	Operații I/O	suprasolicitare.in/suprasolicitare.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#58154310	Utilizator	Vina Andreea Madalina (AndreeaVina)
Fișier	suprasolicitare.cpp	Dimensiune	2.73 KB
Data încărcării	16 Mai 2025, 20:37	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

suprasolicitare.cpp: In function 'bool BFS(std::vector<std::basic_string<char> >&)':
suprasolicitare.cpp:57:14: error: expected unqualified-id before '[' token
         auto [x, y] = q.front(); q.pop();

              ^
suprasolicitare.cpp:59:22: error: 'x' was not declared in this scope
         if (linie_ok[x]) {

                      ^
suprasolicitare.cpp:61:30: error: 'y' was not declared in this scope
             int cx = x, cy = y;

                              ^
suprasolicitare.cpp:73:24: error: 'y' was not declared in this scope
         if (coloana_ok[y]) {

                        ^
suprasolicitare.cpp:75:22: error: 'x' was not declared in this scope
             int cx = x, cy = y;

                      ^
suprasolicitare.cpp:76:34: error: 'cy' was not declared in this scope
             while (!(cx == xs && cy == ys)) {

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

                      ^
suprasolicitare.cpp:89:33: error: 'ny' was not declared in this scope
             while (inBounds(nx, ny) && mt[nx][ny] == 0 && parent[nx][ny] == -1) {

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

                                ^
suprasolicitare.cpp:90:32: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from suprasolicitare.cpp:2:
/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>&&}'

Cum funcționează evaluarea?