#1337
Susan
C++
Eroul nostru Susan se află într-un turn de formă cubică, de latură n
. El dorește să ajungă la comoara ascunsă în interiorul turnului. Din fericire, Susan a făcut rost de o hartă care îi indică cu exactitate coordonatele locului în care se află comoara din turn. Eroul nostru vrea să știe care este distanța minimă pe care o poate parcurge pentru a ajunge la comoară.
Problema | Susan | Operații I/O |
![]() turn.in /turn.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 32 MB
/
Stivă 8 MB
|
Id soluție | #56173793 | Utilizator | |
Fișier | susan.cpp | Dimensiune | 1.68 KB |
Data încărcării | 09 Februarie 2025, 09:57 | Scor / rezultat | Eroare de compilare |
susan.cpp: In function 'void citire()': susan.cpp:32:12: error: 'x1' was not declared in this scope cin >> x1 >> y1 >> z1; ^ susan.cpp:32:24: error: 'z1' was not declared in this scope cin >> x1 >> y1 >> z1; ^ susan.cpp:33:12: error: 'xf' was not declared in this scope cin >> xf >> yf >> zf; ^ susan.cpp:33:18: error: 'yf' was not declared in this scope cin >> xf >> yf >> zf; ^ susan.cpp:33:24: error: 'zf' was not declared in this scope cin >> xf >> yf >> zf; ^ susan.cpp: In function 'void lee(int, int, int)': susan.cpp:49:21: error: converting to 'std::queue<std::tuple<int, int, int> >::value_type {aka std::tuple<int, int, int>}' from initializer list would use explicit constructor 'constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {int, int, int}]' q.push({x, y, z}); ^ susan.cpp:52:14: error: expected unqualified-id before '[' token auto [cx, cy, cz] = q.front(); ^ susan.cpp:56:22: error: 'cx' was not declared in this scope int nx = cx + dx[i], ny = cy + dy[i], nz = cz + dz[i]; ^ susan.cpp:58:23: error: 'ny' was not declared in this scope if (a[nx][ny][nz] != -1 && d[nx][ny][nz] == -1) { ^ susan.cpp:58:27: error: 'nz' was not declared in this scope if (a[nx][ny][nz] != -1 && d[nx][ny][nz] == -1) { ^ susan.cpp:59:39: error: 'cy' was not declared in this scope d[nx][ny][nz] = d[cx][cy][cz] + 1; ^ susan.cpp:59:43: error: 'cz' was not declared in this scope d[nx][ny][nz] = d[cx][cy][cz] + 1; ^ susan.cpp:60:36: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(<brace-enclosed initializer list>)' q.push({nx, ny, nz}); ^ susan.cpp:60:36: 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 susan.cpp:1: /usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, 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::tuple<int, 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::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, 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::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}' susan.cpp: In function 'int main()': susan.cpp:69:9: error: 'x1' was not declared in this scope lee(x1, y1, z1); ^ susan.cpp:69:17: error: 'z1' was not declared in this scope lee(x1, y1, z1); ^ susan.cpp:70:15: error: 'xf' was not declared in this scope cout << d[xf][yf][zf]; ^ susan.cpp:70:19: error: 'yf' was not declared in this scope cout << d[xf][yf][zf]; ^ susan.cpp:70:23: error: 'zf' was not declared in this scope cout << d[xf][yf][zf]; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Susan 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ă.