#include #include #include using namespace std; typedef pair pairInt; int trace(string); void step(int, int, char[][5], char); int main() { string input; getline(cin, input); cout << trace(input) << endl; return 0; } int trace(string str) { char maze[5][5]; pairInt moveRight(0, 1); pairInt moveLeft(0, -1); pairInt moveUp(-1, 0); pairInt moveDown(1, 0); int count = 0; bool flag = true;//instead of goto:D char mark = '1';//variable to mark up the array step by step int posX, posY;//starting point //maze construct for (int i = 0; i < 5; ++i) { for (int j = 0; j < 5; ++j) { maze[i][j] = str[count++]; } ++count; } //looking for Start point for (int i = 0; i < 5; ++i) { for (int j = 0; j < 5; ++j) { if (maze[i][j] == 'P') { maze[i][j] = 'S'; posX = i; posY = j; flag = false; break; } } if (!flag) break; } //starting markup if (maze[posX + moveDown.first][posY + moveDown.second] == 'P') return 1;//if the second P from the bottom else step(posX + moveDown.first, posY + moveDown.second, maze, mark); if (maze[posX + moveUp.first][posY + moveUp.second] == 'P') return 1;//if the second P from the top else step(posX + moveUp.first, posY + moveUp.second, maze, mark); if (maze[posX + moveRight.first][posY + moveRight.second] == 'P') return 1;//if the second P from the right else step(posX + moveRight.first, posY + moveRight.second, maze, mark); if (maze[posX + moveLeft.first][posY + moveLeft.second] == 'P') return 1; // if the second P from the left else step(posX + moveLeft.first, posY + moveLeft.second, maze, mark); int st = 1;//step-increment for (int i = 0; i < 25; ++i) { for (int j = 0; j < 5; ++j) { for (int t = 0; t < 5; ++t) { if (maze[j][t] == mark + i) { step(j + moveDown.first, t + moveDown.second, maze, mark + st);//marking a step down step(j + moveUp.first, t + moveUp.second, maze, mark + st);//marking a step up step(j + moveRight.first, t + moveRight.second, maze, mark + st);//marking step to the right step(j + moveLeft.first, t + moveLeft.second, maze, mark + st);//marking step to the left if (maze[j + moveDown.first][t + moveDown.second] == 'P' && (j + moveDown.first >= 0 && j + moveDown.first < 5) && (t + moveDown.second >= 0 && t + moveDown.second < 5)) return ++st;//return the number of steps if(maze[j + moveUp.first][t + moveUp.second] == 'P' && (j + moveUp.first >= 0 && j + moveUp.first < 5) && (t + moveUp.second >= 0 && t + moveUp.second < 5)) return ++st; if ((maze[j + moveRight.first][t + moveRight.second] == 'P') && (j + moveRight.first >= 0 && j + moveRight.first < 5) && (t + moveRight.second >= 0 && t + moveRight.second < 5)) return ++st; if ((maze[j + moveLeft.first][t + moveLeft.second] == 'P') && (j + moveLeft.first >= 0 && j + moveLeft.first < 5) && (t + moveLeft.second >= 0 && t + moveLeft.second < 5)) return ++st;//if the second P is found ) } } } ++st; } return 0; } void step(int x, int y, char maze[][5], char ch) { if ((x >= 0 && x < 5) && (y >= 0 && y < 5)) { if (maze[x][y] == 'X') maze[x][y] = ch; } }

2d