solved 보행자천국- 24.78ms 7.59mb

Programmers/보행자천국/보행자천국_조은영.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <cstring>
+using namespace std;
+
+int MOD = 20170805;
+int dp[501][501][2];
+
+// ���� ������ ������ ��� �Լ� ���� �ʱ�ȭ �ڵ带 �� �ۼ����ּ���.
+int solution(int m, int n, vector<vector<int>> city_map) {
+    int answer = 0;
+
+    memset(dp, 0, sizeof(dp));
+
+    dp[1][1][0] = 1;
+    dp[1][1][1] = 1;
+
+    for (int i = 1; i <= m; i++) {
+        for (int j = 1; j <= n; j++) {
+            int num = city_map[i - 1][j - 1];
+            if (num == 0) {
+                dp[i][j][0] += (dp[i - 1][j][0] + dp[i][j - 1][1]) % MOD;
+                dp[i][j][1] += (dp[i - 1][j][0] + dp[i][j - 1][1]) % MOD;
+            }
+            else if (num == 1) continue;
+            else {
+                dp[i][j][0] = dp[i - 1][j][0] % MOD;
+                dp[i][j][1] = dp[i][j - 1][1] % MOD;
+            }
+        }
+    }
+
+    answer = (dp[m][n][0]) % MOD;
+
+    cout << answer << "\n";
+
+    return answer;
+}