11:I[34462,["/_next/static/chunks/4d67e03695a9fca6.js","/_next/static/chunks/212203783a8d1b19.js","/_next/static/chunks/f659821a3349b0fe.js"],"PostDetailClient"] 12:T487,#include #include #include #define MAX 25 using namespace std; vector alphabet; // 0 - A, 25 - Z char Graph[MAX][MAX]; struct Point{ int x; int y; int dist; }; int R, C, answer = 0; int D[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void fastio(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void solve(Point curr){ if (answer < curr.dist) answer = curr.dist; for (int i = 0 ; i < 4 ; ++i){ int nx = curr.x + D[i][0]; int ny = curr.y + D[i][1]; cout << "nx: " << nx << ", ny : " << ny << endl; if (nx >= 1 && nx <= R && ny >= 1 && ny <= C && !alphabet[Graph[nx][ny]]){ alphabet[Graph[nx][ny]] = true; solve({nx, ny, curr.dist + 1}); } alphabet[Graph[curr.x][curr.y]] = false; } } int main(){ fastio(); string str; cin >> R >> C; for (int r = 1 ; r <= R ; ++r){ cin >> str; for (int c = 1 ; c <= C ; ++c){ Graph[r][c] = str[c - 1]; } } alphabet[Graph[1][1]] = true; solve({1, 1, 0}); cout << answer; return 0; }13:T487,#include #include #include #define MAX 25 using namespace std; vector alphabet; // 0 - A, 25 - Z char Graph[MAX][MAX]; struct Point{ int x; int y; int dist; }; int R, C, answer = 0; int D[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void fastio(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void solve(Point curr){ if (answer < curr.dist) answer = curr.dist; for (int i = 0 ; i < 4 ; ++i){ int nx = curr.x + D[i][0]; int ny = curr.y + D[i][1]; cout << "nx: " << nx << ", ny : " << ny << endl; if (nx >= 1 && nx <= R && ny >= 1 && ny <= C && !alphabet[Graph[nx][ny]]){ alphabet[Graph[nx][ny]] = true; solve({nx, ny, curr.dist + 1}); } alphabet[Graph[curr.x][curr.y]] = false; } } int main(){ fastio(); string str; cin >> R >> C; for (int r = 1 ; r <= R ; ++r){ cin >> str; for (int c = 1 ; c <= C ; ++c){ Graph[r][c] = str[c - 1]; } } alphabet[Graph[1][1]] = true; solve({1, 1, 0}); cout << answer; return 0; }14:T57c,#include #include #include #include #define MAX 25 using namespace std; bool alphabet[26]; // 0 - A, 25 - Z char Graph[MAX][MAX]; struct Point{ int x; int y; int dist; }; int R, C, answer = 0; int D[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; void fastio(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void solve(Point curr){ if (answer < curr.dist) answer = curr.dist; for (int i = 0 ; i < 4 ; ++i){ int nx = curr.x + D[i][0]; int ny = curr.y + D[i][1]; int next_char_idx = Graph[nx][ny] - 'A'; if (nx >= 1 && nx <= R && ny >= 1 && ny <= C && !alphabet[next_char_idx]){ // 1. 다음 위치 방문 표시 alphabet[next_char_idx] = true; // 2. 재귀 호출 solve({nx, ny, curr.dist + 1}); // 3. 재귀 끝나고 나오면, 다음 위치 방문 해제 alphabet[next_char_idx] = false; } } } int main(){ fastio(); cin >> R >> C; for (int r = 1 ; r <= R ; ++r){ string str; cin >> str; for (int c = 1 ; c <= C ; ++c){ Graph[r][c] = str[c - 1]; } } alphabet[Graph[1][1] - 'A'] = true; // 시작 칸도 거리에 포함되므로, dist는 1부터 시작. solve({1, 1, 1}); cout << answer; return 0; }15:T57c,#include #include #include #include #define MAX 25 using namespace std; bool alphabet[26]; // 0 - A, 25 - Z char Graph[MAX][MAX]; struct