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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
#include "iostream"
#include "vector"
#include "string"
#include "utility"
#include "queue"
#include "set"
#include "map"
#include "algorithm"
#include "cstring"
#include "stack"
#include "cmath"
#include "numeric"
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9 + 7;
ll cal(int a, int b, int c, int d, vector<vector<ll>> &sum) {
return sum[c][d] - sum[c][b - 1] - sum[a - 1][d] + sum[a - 1][b - 1];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<vector<ll>> mat(min(n, m) + 1, vector<ll>(max(n, m) + 1));
vector<vector<ll>> sum(min(n, m) + 1, vector<ll>(max(n, m) + 1, 0));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (n <= m) cin >> mat[i][j];
else cin >> mat[j][i];
}
if (n > m) swap(n, m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + mat[i][j];
ll ans = 0, k;
cin >> k;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int l = 1, r = 1;
for (int c = 1; c <= m; c++) {
l = max(l, c);
r = max(r, c);
while (r <= m && cal(i, c, j, r, sum) <= k) r++;
while (l <= m && cal(i, c, j, l, sum) < k) l++;
ans += r - l;
}
// // 下面的写法也可
// int l = 0, r = 0;
// for (int c = 1; c <= m; c++) {
// while (r < c && cal(i, r + 1, j, c, sum) >= k) r++;
// while (l < c && cal(i, l + 1, j, c, sum) > k) l++;
// ans += r - l;
// }
}
}
cout << ans << "\n";
}
return 0;
}
|