Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #56174341
Rezumat problemă
Susan C++
#1337
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ă.
Constantinescu Eduard (edim98) Detalii
| 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 | #56174341 | Utilizator |
pop raul (ady_papushika12456)
|
| Fișier | susan.cpp | Dimensiune | 2.01 KB |
| Data încărcării | 09 Februarie 2025, 10:39 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
susan.cpp:2:21: error: stray '#' in program using namespace std;#include <bits/stdc++.h> ^ susan.cpp:2:22: error: 'include' does not name a type using namespace std;#include <bits/stdc++.h> ^ susan.cpp: In function 'void lee(int, int, int, int (*)[105][105])': susan.cpp:35:25: 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:43:24: error: 'dx' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==0) ^ susan.cpp:43:32: error: 'dy' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==0) ^ susan.cpp:43:40: error: 'dz' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==0) ^ susan.cpp:43:48: error: expected ']' before ')' token if(a[x+dx[i][y+dy[i][z+dz[i]==0) ^ susan.cpp:43:48: error: expected ']' before ')' token susan.cpp:43:48: error: expected ']' before ')' token susan.cpp:44:89: error: expected ']' before ')' token d[x+dx[i][y+dy[i][z+dz[i]=d[x][y][z]+1,q.push( d[x+dx[i][y+dy[i][z+dz[i]); ^ susan.cpp:44:89: error: expected ']' before ')' token susan.cpp:44:89: error: expected ']' before ')' token susan.cpp:44:90: error: expected ']' before ';' token d[x+dx[i][y+dy[i][z+dz[i]=d[x][y][z]+1,q.push( d[x+dx[i][y+dy[i][z+dz[i]); ^ susan.cpp:44:90: error: expected ']' before ';' token susan.cpp:44:90: error: expected ']' before ';' token susan.cpp:45:24: error: 'dx' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==1 && a[x+dx[5][y+dy[5][z+dz[5]!=-1) ^ susan.cpp:45:32: error: 'dy' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==1 && a[x+dx[5][y+dy[5][z+dz[5]!=-1) ^ susan.cpp:45:40: error: 'dz' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==1 && a[x+dx[5][y+dy[5][z+dz[5]!=-1) ^ susan.cpp:45:81: error: expected ']' before ')' token if(a[x+dx[i][y+dy[i][z+dz[i]==1 && a[x+dx[5][y+dy[5][z+dz[5]!=-1) ^ susan.cpp:45:81: error: expected ']' before ')' token susan.cpp:45:81: error: expected ']' before ')' token susan.cpp:45:81: error: expected ']' before ')' token susan.cpp:45:81: error: expected ']' before ')' token susan.cpp:45:81: error: expected ']' before ')' token susan.cpp:46:104: error: expected ']' before ')' token d[x+dx[5][y+dy[5][z+dz[5]=d[x+dx[i][y+dy[i][z+dz[i]+1,q.push( d[x+dx[5][y+dy[5][z+dz[5]); ^ susan.cpp:46:104: error: expected ']' before ')' token susan.cpp:46:104: error: expected ']' before ')' token susan.cpp:46:105: error: expected ']' before ';' token d[x+dx[5][y+dy[5][z+dz[5]=d[x+dx[i][y+dy[i][z+dz[i]+1,q.push( d[x+dx[5][y+dy[5][z+dz[5]); ^ susan.cpp:46:105: error: expected ']' before ';' token susan.cpp:46:105: error: expected ']' before ';' token susan.cpp:46:105: error: expected ']' before ';' token susan.cpp:46:105: error: expected ']' before ';' token susan.cpp:46:105: error: expected ']' before ';' token susan.cpp:47:24: error: 'dx' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==2 && a[x+dx[6][y+dy[6][z+dz[6]!=-1) ^ susan.cpp:47:32: error: 'dy' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==2 && a[x+dx[6][y+dy[6][z+dz[6]!=-1) ^ susan.cpp:47:40: error: 'dz' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==2 && a[x+dx[6][y+dy[6][z+dz[6]!=-1) ^ susan.cpp:47:81: error: expected ']' before ')' token if(a[x+dx[i][y+dy[i][z+dz[i]==2 && a[x+dx[6][y+dy[6][z+dz[6]!=-1) ^ susan.cpp:47:81: error: expected ']' before ')' token susan.cpp:47:81: error: expected ']' before ')' token susan.cpp:47:81: error: expected ']' before ')' token susan.cpp:47:81: error: expected ']' before ')' token susan.cpp:47:81: error: expected ']' before ')' token susan.cpp:48:104: error: expected ']' before ')' token d[x+dx[5][y+dy[5][z+dz[5]=d[x+dx[i][y+dy[i][z+dz[i]+1,q.push( d[x+dx[5][y+dy[5][z+dz[5]); ^ susan.cpp:48:104: error: expected ']' before ')' token susan.cpp:48:104: error: expected ']' before ')' token susan.cpp:48:105: error: expected ']' before ';' token d[x+dx[5][y+dy[5][z+dz[5]=d[x+dx[i][y+dy[i][z+dz[i]+1,q.push( d[x+dx[5][y+dy[5][z+dz[5]); ^ susan.cpp:48:105: error: expected ']' before ';' token susan.cpp:48:105: error: expected ']' before ';' token susan.cpp:48:105: error: expected ']' before ';' token susan.cpp:48:105: error: expected ']' before ';' token susan.cpp:48:105: error: expected ']' before ';' token susan.cpp:49:25: error: 'dx' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==3) ^ susan.cpp:49:33: error: 'dy' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==3) ^ susan.cpp:49:41: error: 'dz' was not declared in this scope if(a[x+dx[i][y+dy[i][z+dz[i]==3) ^ susan.cpp:49:49: error: expected ']' before ')' token if(a[x+dx[i][y+dy[i][z+dz[i]==3) ^ susan.cpp:49:49: error: expected ']' before ')' token susan.cpp:49:49: error: expected ']' before ')' token susan.cpp:52:29: error: expected primary-expression before ';' token cop-; ^ susan.cpp:53:42: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(int&)' q.push(a[x][y][cop]); ^ susan.cpp:53:42: 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 'int' 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 'int' to 'std::queue<std::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}' susan.cpp:58:8: error: a function-definition is not allowed here before '{' token { ^ susan.cpp:33:15: warning: unused variable 'j' [-Wunused-variable] int i,j,k; ^ susan.cpp:33:17: warning: unused variable 'k' [-Wunused-variable] int i,j,k; ^ susan.cpp:63:8: error: expected '}' at end of input } ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema Susan face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
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ă.