Skip to content

260120 : [BOJ 1103] 게임 #2322

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
alirz-pixel merged 1 commit into from
Jan 25, 2026
Merged

260120 : [BOJ 1103] 게임 #2322

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
64 changes: 64 additions & 0 deletions _munhyeong/1103.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,64 @@
#include <iostream>
#include <vector>
#include <deque>

using namespace std;

struct Info {
int cnt;
int y;
int x;
};

int visited[51][51] = { 0, };

int dy[4] = { 1, -1, 0, 0 };
int dx[4] = { 0, 0, 1, -1 };
int dfs(vector<string>& board, int& r, int& c, int y, int x) {
int &ret = visited[y][x];
if (ret) return ret;
ret = -1;

int step = 1;
int move = board[y][x] - '0';
for (int dir = 0; dir < 4; dir++) {
int ny = y + (move * dy[dir]);
int nx = x + (move * dx[dir]);

if (ny < 0 || nx < 0 || ny >= r || nx >= c)
continue;

if (board[ny][nx] == 'H')
continue;

// visited 검사
int cur = dfs(board, r, c, ny, nx);
if (cur == -1)
return -1;
step = max(step, cur + 1);
}

return ret = step;
}

int main() {
int r, c;
cin >> r >> c;

vector<string> board(r);
for (int y = 0; y < r; y++)
cin >> board[y];

cout << dfs(board, r, c, 0, 0) << "\n";

/*
for (int y = 0; y < r; y++) {
for (int x = 0; x < c; x++) {
cout << visited[y][x] << " ";
}
cout << "\n";
}
*/

return 0;
}