Submission #3445287

---

Source Code Expand

import sys
sys.setrecursionlimit(10**7)
P=10**9+7
H,W=map(int,input().split())
a=[list(map(int,input().split())) for i in range(H)]
dp=[[0 for i in range(W)] for j in range(H)]
used=[[False for i in range(W)] for i in range(H)]
def f(x,y):
    if used[x][y]:
        return dp[x][y]
    dx=[0,0,-1,1]
    dy=[1,-1,0,0]
    result=1
    for k in range(4):
        nx=x+dx[k]
        ny=y+dy[k]
        if (0<=nx<H and 0<=ny<W):
            if (a[nx][ny]>a[x][y]):
                result=(result+f(nx,ny))%P
    used[x][y]=True
    dp[x][y]=result
    return result
ans=0
for i in range(H):
    for j in range(W):
        ans=(ans+f(i,j))%P
print(ans)

Submission Info

Judge Result