forked from PoeLoren/hackerrank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCoin on the Table.cpp
75 lines (71 loc) · 1.88 KB
/
Coin on the Table.cpp
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
//http://www.cnblogs.com/sunshineatnoon/p/3919423.html
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define INT_MAX 10000000
int dp[52][52][1002];
char a[52][52];
int n, m, K;
int fourMin(int i, int j, int k){
int minNum = INT_MAX;
if(i - 1 >= 0){
if(a[i - 1][j] == 'D')
minNum = min(dp[i - 1][j][k - 1], minNum);
else
minNum = min(dp[i - 1][j][k - 1] + 1, minNum);
}
if(j - 1 >= 0){
if(a[i][j - 1] == 'R')
minNum = min(dp[i][j - 1][k - 1], minNum);
else
minNum = min(dp[i][j - 1][k - 1] + 1, minNum);
}
if(i + 1 < n){
if(a[i + 1][j] == 'U')
minNum = min(dp[i + 1][j][k - 1], minNum);
else
minNum = min(dp[i + 1][j][k - 1] + 1, minNum);
}
if(j + 1 < m){
if(a[i][j + 1] == 'L')
minNum = min(dp[i][j + 1][k - 1], minNum);
else
minNum = min(dp[i][j + 1][k - 1] + 1, minNum);
}
return minNum;
}
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
cin >> n >> m >> K;
int istar = 0, jstar = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
cin >> a[i][j];
if(a[i][j] == '*'){
istar = i;
jstar = j;
}
}
}
for(int k = 0; k <= K; ++k){
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j ){
if(k == 0)
dp[i][j][k] = (i == 0 && j == 0) ? 0 : INT_MAX;
else
dp[i][j][k] = fourMin(i, j, k);
}
}
}
int res = INT_MAX;
for(int i = 0; i <= K; ++i)
res = min(res, dp[istar][jstar][i]);
if(res == INT_MAX)
cout << -1;
else
cout << res;
return 0;
}