-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path2번.cpp
More file actions
56 lines (48 loc) · 1.18 KB
/
Copy path2번.cpp
File metadata and controls
56 lines (48 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <vector>
#include<iostream>
using namespace std;
int MOD = 20170805;
// 전역 변수를 정의할 경우 함수 내에 초기화 코드를 꼭 작성해주세요.
int solution(int m, int n, vector<vector<int>> city_map) {
int answer = 0;
struct node {
int left, up;
};
node** d;
d = new node*[m];
for (int i = 0; i < m; i++)
d[i]= new node[n];
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (i == 0 && j == 0) {
d[0][0] = {0,0};
continue;
}
int left = 0, up = 0;
if (j - 1 >= 0) {
if (city_map[i][j - 1] == 2)left = d[i][j - 1].left;
if (i == 0 && j - 1 == 0)left = 1;
else if (city_map[i][j - 1] == 0)left = (d[i][j - 1].left + d[i][j - 1].up) % MOD;
}
if (i - 1 >= 0) {
if (city_map[i - 1][j] == 2)up = d[i - 1][j].up;
if (i-1 == 0 && j== 0)up = 1;
else if (city_map[i-1][j] == 0)up = (d[i-1][j].left + d[i-1][j].up) % MOD;
}
d[i][j] = { left,up };
}
}
answer = (d[m - 1][n - 1].left + d[m - 1][n - 1].up) % MOD;
for (int i = 0; i < m; i++)
delete d[i];
delete d;
return answer;
}
int main()
{
int a = solution(3, 3, { {0,0,0},{ 0,0,0 },{ 0,0,0 } });
cout << a << endl;
return 0;
}