-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathchocolate_pickup_3d_dp.cpp
69 lines (59 loc) · 2.26 KB
/
chocolate_pickup_3d_dp.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
#include <bits/stdc++.h>
using namespace std;
int solve(int i, int j1, int j2, int r, int c, vector<vector<int>> &grid, vector<vector<vector<int>>> &dp){
if(j1 < 0 || j2 < 0 || j1 >= c || j2 >= c) return -1e8;
if(dp[i][j1][j2] != -1) return dp[i][j1][j2];
if(i == r-1){
if(j1 == j2) return grid[i][j1];
else{
return grid[i][j1] + grid[i][j2];
}
}
int maxi = -1e8;
for(int dj1 = -1; dj1 <= 1;dj1++){
for(int dj2 = -1;dj2 <= 1;dj2++){
int value = 0;
if(j1==j2) value = grid[i][j1];
else value = grid[i][j1] + grid[i][j2];
value += solve(i+1, dj1+j1, dj2+j2, r, c, grid, dp);
maxi = max(maxi, value);
}
}
return dp[i][j1][j2] = maxi;
}
int maximumChocolates(int r, int c, vector<vector<int>> &grid) {
vector<vector<vector<int>>> dp(r, vector<vector<int>>(c, vector<int>(c, -1)));
return solve(0, 0, c-1, r, c, grid, dp);
}
// Tabulation Code
// int maximumChocolates(int n, int m, vector<vector<int>> &grid) {
// vector<vector<vector<int>>> dp(n, vector<vector<int>>(m, vector<int>(m, -1)));
// for(int j1 = 0;j1<m;j1++){
// for(int j2 = 0;j2<m;j2++){
// if(j1==j2) dp[n-1][j1][j2] = grid[n-1][j1];
// else dp[n-1][j1][j2] = grid[n-1][j1] + grid[n-1][j2];
// }
// }
// for(int i = n-2;i>=0;i--){
// for(int j1 = 0;j1< m;j1++){
// for(int j2 = 0;j2 < m;j2++){
// int maxi = -1e8;
// for(int dj1 = -1; dj1 <= 1;dj1++){
// for(int dj2 = -1;dj2 <= 1;dj2++){
// int value = 0;
// if(j1==j2) value = grid[i][j1];
// else value = grid[i][j1] + grid[i][j2];
// if(j1+dj1 >= 0 && j1+dj1 < m && dj2+j2 > 0 && dj2+j2 < m){
// value += dp[i+1][dj1+j1][dj2+j2];
// }else{
// value += -1e8;
// }
// maxi = max(maxi, value);
// }
// }
// dp[i][j1][j2] = maxi;
// }
// }
// }
// return dp[0][0][m-1];
// }