#4505
Ash este un antrenor Pokemon ambițios, setându-și scopul să devină cel mai bun. Din păcate, rivalul său, Gary, a furat startul și are Pokemoni mai puternici decât cei ai lui Ash.
Totuși, Ash nu se va da bătut chiar așa ușor! Are un plan de bătaie: în aventurile sale a găsit o clădire misterioasă care poate fi reprezentată ca o matrice de N x M
, fiecare celulă reprezentând conținutul unei camere. În această clădire se află:
A
): Ash se află inițial în această camerăM
): cel mai puternic Pokemon cunoscut de om. Ash are deja un Master Ball, așa că îl va poate prinde pe Mewtwo cu ușurință.G
): a fost provocat de Ash la o bătălie de Pokemoni și îl așteaptă într-o anumită cameră_
): Ash poate accesa această cameră#
): Ash nu poate accesa această camerăPlanul său constă în a-l prinde pe Mewtwo, după aceea în a-l confrunta pe Gary. Ash se poate deplasa în cele patru direcții cardinale (N
, E
, S
, V
). Știind că o deplasare se face într-o secundă, determinați numărul minim de secunde în care Ash poate ajunge la Mewtwo, apoi la Gary.
Problema | Mewtwo | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.15 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57454310 | Utilizator | |
Fișier | mewtwo.cpp | Dimensiune | 1.15 KB |
Data încărcării | 01 Aprilie 2025, 08:21 | Scor / rezultat | Eroare de compilare |
mewtwo.cpp:15:1: error: stray '\342' in program void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\230' in program mewtwo.cpp:15:295: error: stray '#' in program void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:1: error: stray '\342' in program void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\231' in program mewtwo.cpp:15:1: error: stray '\342' in program mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\230' in program mewtwo.cpp:15:1: error: stray '\342' in program mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\231' in program mewtwo.cpp:15:1: error: stray '\342' in program mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\230' in program mewtwo.cpp:15:1: error: stray '\342' in program mewtwo.cpp:15:1: error: stray '\200' in program mewtwo.cpp:15:1: error: stray '\231' in program mewtwo.cpp:20:1: error: stray '\342' in program int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^ mewtwo.cpp:20:1: error: stray '\200' in program mewtwo.cpp:20:1: error: stray '\230' in program mewtwo.cpp:20:1: error: stray '\342' in program mewtwo.cpp:20:1: error: stray '\200' in program mewtwo.cpp:20:1: error: stray '\231' in program mewtwo.cpp:20:1: error: stray '\342' in program mewtwo.cpp:20:1: error: stray '\200' in program mewtwo.cpp:20:1: error: stray '\223' in program mewtwo.cpp:20:1: error: stray '\342' in program mewtwo.cpp:20:1: error: stray '\200' in program mewtwo.cpp:20:1: error: stray '\223' in program mewtwo.cpp: In function 'void lee(int, int)': mewtwo.cpp:15:82: error: 'b' was not declared in this scope void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:275: error: 'a' was not declared in this scope void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:304: error: expected ')' before '[' token void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:371: error: expected ')' before 'G' void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:424: error: 'M' was not declared in this scope void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp:15:303: error: label 'b' used but not defined void lee(int is, int js) { queue< pair<int, int> > Q; Q.push(make_pair(is, js)); b[is][js] = 1; while(!Q.empty()) { int x = Q.front().first; int y = Q.front().second; Q.pop(); for(int d = 0; d <= 3; ++d) { int inou = dx[d] + x; int jnou = dy[d] + y; if(inmat(inou, jnou) && a[inou][jnou] != ‘#’ && b[inou][jnou] 0) { b[inou][jnou] = b[x][y] + 1; if(a[inou][jnou] ‘G’) {ig = inou; jg = jnou;} if(a[inou][jnou] == ‘M’) {im = inou; jm = jnou;} Q.push(make_pair(inou, jnou)); } } } ^ mewtwo.cpp: In function 'int main()': mewtwo.cpp:18:120: error: 'a' was not declared in this scope int main() { cin >> n >> m; cin.ignore(); for(int i = 1; i <= n; ++i, cin.ignore()) for(int j = 1; j <= m; ++j) cin >> a[i][j]; ^ mewtwo.cpp:20:76: error: 'a' was not declared in this scope int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^ mewtwo.cpp:20:90: error: 'A' was not declared in this scope int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^ mewtwo.cpp:20:116: error: 'b' was not declared in this scope int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^ mewtwo.cpp:20:130: error: expected ';' before numeric constant int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^ mewtwo.cpp:20:249: error: expected ';' before numeric constant int suma = 0; for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) { if(a[i][j] == ‘A’) { lee(i, j); suma = b[im][jm] – 1; for (int i = 0; i < 1001; i++) for (int j = 0; j < 1001; j++) b[i][j] = 0; lee(im, jm); suma = suma + b[ig][jg] – 1; break; } } cout << suma; } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Mewtwo 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ă.