How do I solve this code friends

Input:
N = 3, M = 3, K = 2
Volcano = {{2, 1},
           {2, 3}}
Output: 
2
Explanation: 
at time = 0, only cell (2, 1) and (2, 3) 
are filled with lava
at time = 1, cell (1, 1), (2, 1), (3, 1), 
(2, 2), (1, 3), (2, 3), (3, 3) are filled 
with lava
at time = 2, all cells are filled with lava

// { Driver Code Starts
//Initial Template for C++

#include <bits/stdc++.h>
using namespace std;


 // } Driver Code Ends
//User function Template for C++


class Solution {
public:
    int solve(int N, int M, int K, vector<vector<int> > Volcano) {
        // code here
  int dp[R][C]=;
    int m = R, n = C;
 
    // Base case
    dp[m - 1][n - 1] = points[m - 1][n - 1] > 0
                           ? 1
                           : abs(points[m - 1][n - 1]) + 1;
 
    // Fill last row and last column as base to fill
    // entire table
    for (int i = m - 2; i >= 0; i--)
        dp[i][n - 1]
            = max(dp[i + 1][n - 1] - points[i][n - 1], 1);
    for (int j = n - 2; j >= 0; j--)
        dp[m - 1][j]
            = max(dp[m - 1][j + 1] - points[m - 1][j], 1);
 
    // fill the table in bottom-up fashion
    for (int i = m - 2; i >= 0; i--) {
        for (int j = n - 2; j >= 0; j--) {
            int min_points_on_exit
                = min(dp[i + 1][j], dp[i][j + 1]);
            dp[i][j]
                = max(min_points_on_exit - points[i][j], 1);
        }
    }
 
    return Volcano[0][0]=dp[0][0];
    }
};