Submission #723051

---

Source Code Expand

#include <stdio.h>

#define MAX 1002
#define MOD ((unsigned long long)(1e9+7))

unsigned int a[MAX][MAX];
unsigned long long point[MAX][MAX];

unsigned long long search(int x,int y){
     unsigned long long pointsum=1;
     if(point[x][y]>0)return point[x][y];
     if(a[x][y] < a[x+1][y] ){
          pointsum += search(x+1,y);
     }
     if(a[x][y] < a[x-1][y] ){
          pointsum += search(x-1,y);
     }
     if(a[x][y] < a[x][y+1] ){
          pointsum += search(x,y+1);
     }
     if(a[x][y] < a[x][y-1] ){
          pointsum += search(x,y-1);
     }
     point[x][y]=pointsum % MOD;
     return pointsum;
}

int main(){
     int ret;
     int H,W;
     int i,j,k;
     unsigned long long int llret=0;

     for(i=0;i<MAX;i++){
          for(j=0;j<MAX;j++){
               a[i][j]=0;
               point[i][j]=0;
          }
     }
     ret=scanf("%d %d",&H,&W);
     for(i=1;i<=H;i++){
          for(j=1;j<=W;j++){
               ret=scanf("%d",&a[i][j]);
          }
     }

     for(i=1;i<=H;i++){
          for(j=1;j<=W;j++){
               search(i,j);
          }
     }

     for(i=1;i<=H;i++){
          for(j=1;j<=W;j++){
               llret += point[i][j];
               llret = llret % MOD;
          }
     }

     printf("%lld\n",llret);
}

Submission Info

Judge Result