Submission #1071256


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)]).flatten
MOD = 1_000_000_007

def dp(k)
  return @dp[k] if @dp[k]
  ret = 1
  a = As[k]
  t = k + W + 2; ret += dp(t) if As[t] > a
  t = k - W - 2; ret += dp(t) if As[t] > a
  t = k + 1; ret += dp(t) if As[t] > a
  t = k - 1; ret += dp(t) if As[t] > a
  @dp[k] = ret
end

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

Submission Info

Submission Time
Task D - 経路
User noriakiokubo
Language Ruby (2.3.3)
Score 0
Code Size 556 Byte
Status TLE
Exec Time 2132 ms
Memory 437576 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 2115 ms 239624 KB
01.txt TLE 2132 ms 437576 KB
02.txt AC 937 ms 28916 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 13 ms 1916 KB
07.txt AC 12 ms 1916 KB
08.txt AC 12 ms 1788 KB
09.txt AC 11 ms 1788 KB
10.txt AC 15 ms 1916 KB
11.txt AC 1070 ms 36220 KB
12.txt AC 1049 ms 36220 KB
13.txt AC 1075 ms 36220 KB
14.txt AC 1060 ms 36084 KB
15.txt TLE 2121 ms 208244 KB
16.txt AC 1075 ms 36220 KB
17.txt AC 1045 ms 36276 KB
18.txt AC 867 ms 28592 KB
19.txt AC 759 ms 28540 KB
sample01.txt AC 11 ms 1788 KB
sample02.txt AC 12 ms 1788 KB