class Solution {

public:

    int surfaceArea(vector<vector<int>>& grid) {

        int x=;

        int sum=;

        for(int i=;i<grid.size();i++)

            for(int j=;j<grid[].size();j++){

                if(grid[i][j]!=) x+=;

            }

        for(int i=;i<grid.size();i++)

            for(int j=;j<grid[].size();j++){

                 sum+=(grid[i][j]*-*cal(grid,i,j));

            }

        sum+=*x;

        return sum;

    }

    int cal(vector<vector<int>>a,int i,int j){

        if(i==&&j==) return ;

        else if(i==&&j!=) return min(a[i][j-],a[i][j]);

        else if(i!=&&j==) return min(a[i-][j],a[i][j]);

        else return min(a[i][j-],a[i][j])+min(a[i-][j],a[i][j]);

    }

};