-
Notifications
You must be signed in to change notification settings - Fork 0
/
p1832.java
102 lines (92 loc) · 3.48 KB
/
p1832.java
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
//미해결
class Solution {
int MOD = 20170805;
int count = 0;
public int solution(int m, int n, int[][] cityMap) {
int answer = 0;
int [][]memo = new int[m][n];
for(int i =0;i<m;i++){
for(int j=0;j<n;j++){
memo[i][j] = 0;
}
}
dfs(m, n, cityMap, 0, 0, 0, memo);
return count%MOD;
}
public int dfs(int m, int n, int[][] cityMap, int indexR, int indexC, int head, int[][]memo){
//System.out.println(indexR + "/" + indexC);
//DP
if(memo[indexR][indexC] != 0){
if(cityMap[indexR][indexC]==0){
//System.out.println("Memo hit! " + memo[indexR][indexC]);
//다른 방향 칸에 2 있고 같은 방향은 1 있을 경우
if(head == 0){
if(indexR < m-1 && indexC < n-1){
if(cityMap[indexR+1][indexC] == 2 && cityMap[indexR][indexC+1] == 1){
return 0;
}
}
}else{
if(indexR < m-1 && indexC < n-1){
if(cityMap[indexR+1][indexC] == 1 && cityMap[indexR][indexC+1] == 2){
return 0;
}
}
}
count += memo[indexR][indexC];
return memo[indexR][indexC];
}
else if(cityMap[indexR][indexC] == 2){
if(head == 0)//위쪽에서 오고 있는 경우
{
if(indexR < m-1){
//System.out.println("Memo hit! " + memo[indexR][indexC]);
count += memo[indexR][indexC];
return memo[indexR][indexC];
}
}else if(head == 1){
if(indexC < n-1){
//System.out.println("Memo hit! " + memo[indexR][indexC]);
count += memo[indexR][indexC];
return memo[indexR][indexC];
}
}
}else{
return 0;
}
}
if(indexR == m-1 && indexC == n-1){
//도착
memo[indexR][indexC] = 1;
count ++;
return 1;
}
if(cityMap[indexR][indexC] == 0){
//자유
if(indexR < m-1){
if(cityMap[indexR+1][indexC] != 1)
memo[indexR][indexC] += dfs(m, n, cityMap, indexR +1, indexC, 0, memo)%MOD;
}
if(indexC <n-1)
if(cityMap[indexR][indexC+1] != 1)
memo[indexR][indexC] += dfs(m, n, cityMap, indexR, indexC+1, 1, memo)%MOD;
}else if(cityMap[indexR][indexC] == 2){
//회전 금지
if(head == 0)//위쪽에서 오고 있는 경우
{
if(indexR < m-1)
if(cityMap[indexR+1][indexC] != 1)
memo[indexR][indexC] += dfs(m, n, cityMap, indexR +1, indexC, 0, memo)%MOD;
}
else if(head == 1){
if(indexC < n-1)
if(cityMap[indexR][indexC+1] != 1)
memo[indexR][indexC] += dfs(m, n, cityMap, indexR, indexC+1, 1, memo)%MOD;
}
}else{
//금지
return 0;
}
return memo[indexR][indexC];
}
}