Submission #5170169


Source Code Expand

import sys
sys.setrecursionlimit(10**6)

MOD = 10**9+7
 
H,W = map(int,input().split())
 
A = []
for h in range(H):
  A.append([int(x) for x in input().split()])
 
memo = [[-1] * W for _ in range(H)]
 
def F(i,j):
  x = memo[i][j]
  if x != -1:
    return x
 
  x = 1
  for ii,jj in [(i-1,j),(i+1,j),(i,j-1),(i,j+1)]:
    if ii < 0 or ii >= H:
      continue
    if jj < 0 or jj >= W:
      continue
    if A[i][j] < A[ii][jj]:
      x += F(ii,jj)
  x %= MOD
  memo[i][j] = x
  return x
 
ans = 0
for i in range(H):
  for j in range(W):
    ans += F(i,j)
ans %= MOD
 
print(ans)

Submission Info

Submission Time
Task D - 経路
User maspy
Language PyPy3 (2.4.0)
Score 100
Code Size 614 Byte
Status AC
Exec Time 1196 ms
Memory 166236 KiB

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 828 ms 163804 KiB
01.txt AC 888 ms 166236 KiB
02.txt AC 637 ms 65756 KiB
03.txt AC 166 ms 38256 KiB
04.txt AC 166 ms 38256 KiB
05.txt AC 167 ms 38256 KiB
06.txt AC 185 ms 40924 KiB
07.txt AC 186 ms 40560 KiB
08.txt AC 170 ms 38768 KiB
09.txt AC 164 ms 38256 KiB
10.txt AC 212 ms 43484 KiB
11.txt AC 920 ms 73308 KiB
12.txt AC 922 ms 73820 KiB
13.txt AC 917 ms 73308 KiB
14.txt AC 904 ms 72668 KiB
15.txt AC 1196 ms 122204 KiB
16.txt AC 910 ms 72668 KiB
17.txt AC 893 ms 72156 KiB
18.txt AC 639 ms 64860 KiB
19.txt AC 557 ms 61916 KiB
sample01.txt AC 163 ms 38256 KiB
sample02.txt AC 164 ms 38256 KiB