Submission #3940259

Source Code Expand

H, W = map(int, input().split())
S = [input() for i in range(H)]

MOD = 10**9 + 7

dp = [[0]*(W+1) for i in range(H+1)]
dp[1][0] = 1
for i in range(H):
    s = S[i]
    for j in range(W):
        if s[j] == '#':
            continue
        dp[i+1][j+1] = (dp[i][j+1] + dp[i+1][j]) % MOD
print(dp[H][W])

Submission Info

Submission Time
Task H - Grid 1
User yaketake08
Language PyPy3 (2.4.0)
Score 100
Code Size 316 Byte
Status AC
Exec Time 274 ms
Memory 53232 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 16
Set Name Test Cases
All 0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11
Case Name Status Exec Time Memory
0_00 AC 184 ms 38384 KiB
0_01 AC 178 ms 38256 KiB
0_02 AC 177 ms 38256 KiB
0_03 AC 178 ms 38256 KiB
1_00 AC 170 ms 38256 KiB
1_01 AC 171 ms 38256 KiB
1_02 AC 267 ms 53232 KiB
1_03 AC 228 ms 51184 KiB
1_04 AC 231 ms 51056 KiB
1_05 AC 256 ms 51312 KiB
1_06 AC 274 ms 51568 KiB
1_07 AC 263 ms 51184 KiB
1_08 AC 264 ms 51184 KiB
1_09 AC 254 ms 51312 KiB
1_10 AC 266 ms 51056 KiB
1_11 AC 255 ms 51184 KiB