You are given a 0-indexed m x n integer matrix grid and an integer k. You are currently at position (0, 0) and you want to reach position (m - 1, n - 1) moving only down or right.
Return the number of paths where the sum of the elements on the path is divisible by k. Since the answer may be very large, return it modulo 109 + 7.
Example 1:
Input: grid = [[5,2,4],[3,0,5],[0,7,2]], k = 3 Output: 2 Explanation: There are two paths where the sum of the elements on the path is divisible by k. The first path highlighted in red has a sum of 5 + 2 + 4 + 5 + 2 = 18 which is divisible by 3. The second path highlighted in blue has a sum of 5 + 3 + 0 + 5 + 2 = 15 which is divisible by 3.
Example 2:
Input: grid = [[0,0]], k = 5 Output: 1 Explanation: The path highlighted in red has a sum of 0 + 0 = 0 which is divisible by 5.
Example 3:
Input: grid = [[7,3,4,9],[2,3,6,2],[2,3,7,0]], k = 1 Output: 10 Explanation: Every integer is divisible by 1 so the sum of the elements on every possible path is divisible by k.
Constraints:
m == grid.lengthn == grid[i].length1 <= m, n <= 5 * 1041 <= m * n <= 5 * 1040 <= grid[i][j] <= 1001 <= k <= 50
Solution: DP
Let dp[i][j][r] := # of paths from (0,0) to (i,j) with path sum % k == r.
init: dp[0][0][grid[0][0] % k] = 1
dp[i][j][(r + grid[i][j]) % k] = dp[i-1][j][r] + dp[i][j-1][r]
ans = dp[m-1][n-1][0]
Time complexity: O(m*n*k)
Space complexity: O(m*n*k) -> O(n*k)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
// Author: Huahua class Solution { public: int numberOfPaths(vector<vector<int>>& grid, int k) { const int kMod = 1e9 + 7; const int m = grid.size(); const int n = grid[0].size(); vector<vector<vector<int>>> dp(m, vector<vector<int>>(n, vector<int>(k))); dp[0][0][grid[0][0] % k] = 1; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) { if (i == 0 && j == 0) continue; for (int r = 0; r < k; ++r) dp[i][j][(r + grid[i][j]) % k] = ((j ? dp[i][j - 1][r] : 0) + (i ? dp[i - 1][j][r] : 0)) % kMod; } return dp[m - 1][n - 1][0]; } }; |
Related Problems:
