14503 로봇 청소기

BOJ::14503 로봇 청소기

https://www.acmicpc.net/problem/14503

주어진 조건대로 구현하면 끝.

#include <iostream>
using namespace std;
 
int n, m, r, c, d, res;
int map[50][50];
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
int back_dx[] = { 1,0,-1,0 };
int back_dy[] = { 0,-1,0,1 };
 
 
//0북 1동 2남 3서
void f(int x,int y,int d) {
    res++;
    map[x][y] = 2;
    
    int ax, ay;
    for (int i = 1; i <= 4; i++) {
        int dd = (d - i < 0) ? d - i + 4 : d - i;
 
        ax = x + dx[dd];
        ay = y + dy[dd];
 
        if (map[ax][ay] == 0) {
            f(ax, ay, dd);
            return;
        }
    }
 
    ax = x + back_dx[d];
    ay = y + back_dy[d];
    if (map[ax][ay] != 1) {
        f(ax, ay, d);
    }
}
 
int get_result() {
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (map[i][j] == 2)ans++;
        }
    }
    return ans;
}
 
int main() {
    cin >> n >> m >> r >> c >> d;
 
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> map[i][j];
        }
    }
 
    f(r, c, d);
 
    cout << get_result() << endl;
}