백준 - 파이프 옮기기 2 [17069]

#include <iostream>

using namespace std;


int map[34][34];
long long road[3][34][34];
int result;
void func(int n) {
	road[0][1][2] = 1;
	for (int i = 1; i < n + 1; i++) {
		for (int j = 2; j < n + 1; j++) {
			if (map[i][j + 1] != 1) {
				road[0][i][j + 1] = road[0][i][j] + road[1][i][j];
			}
			if (map[i + 1][j] != 1) {
				road[2][i + 1][j] = road[1][i][j] + road[2][i][j];
			}
			if (map[i + 1][j + 1] != 1 && map[i + 1][j] != 1 && map[i][j + 1] != 1) {
				road[1][i + 1][j + 1] = road[0][i][j] + road[1][i][j] + road[2][i][j];
			}
		}
	}
	return;
}

int main() {
	int n;
	cin >> n;
	for (int i = 1; i < n+1; i++)
		for (int j = 1; j < n+1; j++)
			cin >> map[i][j];
	func(n);

	cout << road[0][n][n] + road[1][n][n] + road[2][n][n] << endl;
	return 0;
}