Submission #1071239


Source Code Expand

H, W = gets.split.map(&:to_i)
As = [[0] * (W + 2)] + readlines.map{|l| [0] + l.split.map(&:to_i) + [0]} + [[0] * (W + 2)]
MOD = 1_000_000_007

def dp(i, j)
  return @dp[i][j] if @dp[i][j]
  ret, a = 1, As[i][j]
  ret += dp(i + 1, j) if As[i + 1][j] > a
  ret += dp(i - 1, j) if As[i - 1][j] > a
  ret += dp(i, j + 1) if As[i][j + 1] > a
  ret += dp(i, j - 1) if As[i][j - 1] > a
  @dp[i][j] = ret
end

@dp = Array.new(H + 2){Array.new(W + 2, nil)}
ans = 0
(1 .. H).each do |i|
  (1 .. W).each do |j|
    ans = (ans + dp(i, j)) % MOD
  end
end
puts ans

Submission Info

Submission Time
Task D - 経路
User noriakiokubo
Language Ruby (2.3.3)
Score 0
Code Size 552 Byte
Status TLE
Exec Time 2132 ms
Memory 530812 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 19
TLE × 3
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
Case Name Status Exec Time Memory
00.txt TLE 2117 ms 253948 KB
01.txt TLE 2132 ms 530812 KB
02.txt AC 1069 ms 20476 KB
03.txt AC 11 ms 1788 KB
04.txt AC 11 ms 1788 KB
05.txt AC 11 ms 1788 KB
06.txt AC 12 ms 1916 KB
07.txt AC 12 ms 1788 KB
08.txt AC 11 ms 1788 KB
09.txt AC 11 ms 1788 KB
10.txt AC 14 ms 1916 KB
11.txt AC 1116 ms 28284 KB
12.txt AC 1113 ms 28284 KB
13.txt AC 1124 ms 28284 KB
14.txt AC 1119 ms 28156 KB
15.txt TLE 2115 ms 209276 KB
16.txt AC 1119 ms 28156 KB
17.txt AC 1138 ms 28284 KB
18.txt AC 883 ms 20604 KB
19.txt AC 732 ms 20604 KB
sample01.txt AC 11 ms 1788 KB
sample02.txt AC 11 ms 1788 KB