leetcode/Problems/3070.cpp at master · DimitrijeDobrota/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
static const auto _ = []() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0;
}();

class Solution {
  public:
    int countSubmatrices(vector<vector<int>> &grid, int k) const {
        int n = size(grid), m = size(grid[0]), res = grid[0][0] <= k;

        for (int i = 1, acc = grid[0][0]; i < n; i++) {
            grid[i][0] = acc += grid[i][0];
            if (grid[i][0] <= k)
                res++;
            else {
                n = i;
                break;
            }
        }

        for (int j = 1, acc = grid[0][0]; j < m; j++) {
            grid[0][j] = acc += grid[0][j];
            if (grid[0][j] <= k)
                res++;
            else {
                m = j;
                break;
            }
        }

        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                grid[i][j] += grid[i - 1][j] + grid[i][j - 1] - grid[i - 1][j - 1];
                if (grid[i][j] <= k)
                    res++;
                else {
                    m = j;
                    break;
                }
            }
        }

        return res;
    }
};