파이프 옮기기 C++

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

17069번: 파이프 옮기기 2

#include <iostream>
#include <vector>
#include <cstring>

using namespace std;
const int MAX = 35;
long long answer = 0;
int n;
int map[MAX][MAX];
vector<pair<int, int>> pipe;
//int shape = 0; //0:가로, 1:세로, 2:대각선
struct MOVE { int x, y; };
MOVE mv[3] = { {0,1}, {1,1}, {1,0} };
long long dp[3][MAX][MAX];

int main(void) {
	cin >> n;

	memset(dp, 0, sizeof(dp));

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> map[i][j];
		}
	}

	dp[0][0][1] = 1;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (map[i][j + 1] == 0)	dp[0][i][j + 1] += (dp[0][i][j] + dp[2][i][j]);
			if (map[i + 1][j] == 0)	dp[1][i + 1][j] += (dp[1][i][j] + dp[2][i][j]);
			if (map[i + 1][j + 1] == 0 && map[i][j + 1] == 0 && map[i + 1][j] == 0)	dp[2][i + 1][j + 1] += (dp[0][i][j] + dp[1][i][j] + dp[2][i][j]);
		}
	}

	answer = dp[0][n - 1][n - 1] + dp[1][n - 1][n - 1] + dp[2][n - 1][n - 1];
	cout << answer << endl;
}