Submission #13161666

---

Source Code Expand

//GRID-H_dp
#include<bits/stdc++.h>
#define  modulu 1000000007
using namespace std;
char grid[1001][1001];
int dp[1001][1001];

int NoOFPaths(char grid[1001][1001],int r,int c)
{

    if(dp[r][c]!=0)
    return (dp[r][c] % modulu);

    for(int i=1;i<=c;i++){ //for 1st row
       
      if(grid[1][i]!='#')
      {
          dp[1][i]=1;
      }
      else
       break;
      
      
      }


      for(int i=1;i<=c;i++) { //for 1st column
      if(grid[1][i]!='#')
      {
          dp[i][1]=1;
      }
      else
      break;
      
      }

    for(int i=2;i<=r;i++)
    {
        for(int j=2;j<=c;j++)
        {
            if(grid[i][j]!='#')
            {
            dp[i][j]=((dp[i-1][j] % modulu) +(dp[i][j-1] % modulu))%modulu;
            }
            else
            dp[i][j]=0;
        }


}

     return (dp[r][c] % modulu) ;


} 
int main()
{
    int r,c;
    cin>>r>>c;
    memset(dp,0,sizeof dp);
    for(int i=1;i<=r;i++)
    {
        for(int j=1;j<=c;j++)
        {
            cin>>grid[i][j];
        }
        cout<<endl;
        
    }
    cout<<NoOFPaths(grid,r,c);
    return 0;

}

Submission Info

Judge Result