Submission #3005852


Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int h,w;
ll dp[1001][1001];
ll a[1001][1001];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};

ll dfs(int i,int j){
  if(dp[i][j]!=0) return dp[i][j];
  ll sum=1;
  for(int k=0;k<4;k++){
    int y=i+dy[k];
    int x=j+dx[k];
    if(x<0||x>=w||y<0||y>=h) continue;
    if(a[i][j]>=a[y][x]) continue;
    //cout<<x<<" "<<y<<endl;
    sum=(sum+dfs(y,x))%MOD;
  }
  dp[i][j]=sum;
  return dp[i][j];
}

int main(){
  //int h,w;
  cin>>h>>w;
  //ll a[h][w];
  for(int i=0;i<h;i++) for(int j=0;j<w;j++) cin>>a[i][j];
  //ll dp[h][w];
  ll ans=0;
  for(int i=0;i<h;i++) for(int j=0;j<w;j++) dp[i][j]=0;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      ans=(ans+dfs(i,j))%MOD;
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task D - 経路
User snow39
Language C++14 (GCC 5.4.1)
Score 100
Code Size 920 Byte
Status AC
Exec Time 425 ms
Memory 16128 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 24
Set Name Test Cases
sample sample01.txt, sample02.txt
All 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample01.txt, sample02.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
00.txt AC 254 ms 16000 KB
01.txt AC 324 ms 16128 KB
02.txt AC 171 ms 15872 KB
03.txt AC 2 ms 2304 KB
04.txt AC 1 ms 2304 KB
05.txt AC 2 ms 2304 KB
06.txt AC 2 ms 2304 KB
07.txt AC 2 ms 2304 KB
08.txt AC 2 ms 2432 KB
09.txt AC 2 ms 2304 KB
10.txt AC 3 ms 4608 KB
11.txt AC 424 ms 15872 KB
12.txt AC 425 ms 15872 KB
13.txt AC 425 ms 15872 KB
14.txt AC 424 ms 15872 KB
15.txt AC 373 ms 16000 KB
16.txt AC 423 ms 15872 KB
17.txt AC 423 ms 15872 KB
18.txt AC 182 ms 15872 KB
19.txt AC 166 ms 15872 KB
sample01.txt AC 2 ms 2304 KB
sample02.txt AC 2 ms 2304 KB