[Algorithm]Baekjoon 17484 :: 진우의 달 여행 (Small)

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

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
#include <functional>
#include <sstream>
#include <memory.h>
#include <deque>
#include <set>
#include <unordered_map>
#include <stack>
#include <numeric>
 
using namespace std;
 
int n, m;
int arr[7][7] = { 0 };
int dp[7][7][3] = { 0 };
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
 
    cin >> n >> m;
 
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            cin >> arr[i][j];
        }
    }
 
    memset(dp, 0x3f, sizeof(dp));
 
    for (int i = 1; i <= m; ++i)
    {
        for (int j = 0; j < 3; ++j)
        {
            dp[1][i][j] = arr[1][i];
        }
    }
 
    for (int i = 2; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            for (int k = 0; k < 3; ++k)
            {
                if (k == 0)
                {
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][1]);
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][2]);
                }
                else if (k == 1)
                {
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][0]);
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][2]);
                }
                else
                {
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j + 1][0]);
                    dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j + 1][1]);
                }
 
                dp[i][j][k] += arr[i][j];
            }
            
        }
    }
 
    int answer = 0x3f3f3f3f;
    for (int i = 1; i <= m; ++i)
    {
        for (int j = 0; j < 3; ++j)
        {
            answer = min(answer, dp[n][i][j]);
        }
    }
 
    cout << answer;
}
 
 
 

 

dp문제중 꽤나 접하기 쉬운 유형. 이동방향이 두번연속이면 안된다는 조건만 잘 체크해주면 된다.