[Algorithm] Baekjoon 14890번 : 경사로

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

14890번: 경사로

int n, l;
int arr[100][100] = { 0 };
bool isInstalled[100][100] = { false };
 
bool checkInRange(int y, int x)
{
    if (y < 0 || y >= n || x < 0 || x >= n) return false;
    return true;
}
 
int move(int y, int x, bool isRow)
{
    memset(isInstalled, false, sizeof(isInstalled));
    int offsetY = isRow ? 0 : 1;
    int offsetX = isRow ? 1 : 0;
    int curY = y;
    int curX = x;
    int targetY = isRow ? curY : n - 1;
    int targetX = !isRow ? curX : n - 1;
 
    while (!(curY == targetY && curX == targetX))
    {
        int nextY = curY + offsetY;
        int nextX = curX + offsetX;
        int heightGap = arr[curY][curX] - arr[nextY][nextX];
 
        if (heightGap == 0)
        {
            curY = nextY;
            curX = nextX;
        }
        else if (heightGap == 1) // 한칸 낮으면
        {
            int count = 1;
            int targetHeight = arr[nextY][nextX];
 
            while (count != l)
            {
                nextY += offsetY;
                nextX += offsetX;
                if (!checkInRange(nextY, nextX)) break;
                if (arr[nextY][nextX] != targetHeight) break;
                ++count;
            }
 
            if (count < l) return 0;
 
            curY = nextY;
            curX = nextX;
            isInstalled[curY][curX] = true;
        }
        else if (heightGap == -1) // 한칸 높으면
        {
            int count = 1;
            int prevY = curY;
            int prevX = curX;
            int targetHeight = arr[curY][curX];
            if (isInstalled[prevY][prevX]) return 0;
 
            while (count != l)
            {
                prevY -= offsetY;
                prevX -= offsetX;
 
                if (isInstalled[prevY][prevX]) return 0;
                if (!checkInRange(prevY, prevX)) break;
                if (arr[prevY][prevX] != targetHeight) break;
                ++count;
            }
 
            if (count < l) return 0;
 
            curY = nextY;
            curX = nextX;
        }
        else return 0;
    }
 
    return 1;
}
 
int main(void)
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cin >> n >> l;
 
    int result = 0;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            cin >> arr[i][j];
        }
    }
 
    for (int i = 0; i < n; ++i)
    {
        result += move(i, 0, true) + move(0, i, false);
    } 
 
    cout << result;
}

복잡한 논리를 요구하지 않는 구현문제이다.

현재칸과 앞의 칸의 높이차에 따라 어떻게 동작할지 잘 구현해주면 된다.