-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlocalizedSummingForBlurring_UVA983.cpp
86 lines (73 loc) · 2.3 KB
/
localizedSummingForBlurring_UVA983.cpp
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
77
78
79
80
81
82
83
84
85
86
#include <bits/stdc++.h>
using namespace std;
ifstream fin("localizedSummingForBlurring_UVA983.in");
ofstream fout("localizedSummingForBlurring_UVA983.out");
int main()
{
bool first = false;
while (true)
{
int n = 0, m = 0; fin >> n >> m;
if (n == 0) break;
if (first == true) fout << '\n';
first = true;
vector<vector<long long>> a(n + 1, vector<long long>(n + 1, 0)),
dpY(n + 1, vector<long long>(n + 1, 0)),
dpX(n + 1, vector<long long>(n + 1, 0));
for (int y = n; y >= 1; --y)
{
for (int x = 1; x <= n; ++x)
{
fin >> a[y][x];
dpY[y][x] = dpY[y][x - 1] + a[y][x];
}
}
for (int x = 1; x <= n; ++x)
{
for (int y = 1; y <= n; ++y)
{
dpX[x][y] = dpX[x][y - 1] + a[y][x];
}
}
int k = n - m + 1;
vector<vector<long long>> ans(k + 1, vector<long long>(k + 1, 0));
for (int y = 1; y <= k; ++y)
{
for (int x = 1; x <= k; ++x)
{
if (y == 1 && x == 1)
{
for (int _y = 1; _y <= m; ++_y)
{
for (int _x = 1; _x <= m; ++_x)
{
ans[y][x] += a[_y][_x];
}
}
}
else
{
if (x == 1)
{
ans[y][x] = ans[y - 1][x] - dpY[y - 1][x + m - 1] + dpY[m + y - 1][x + m - 1];
}
else
{
ans[y][x] = ans[y][x - 1] - (dpX[x - 1][m + y - 1] - dpX[x - 1][y - 1]) + (dpX[x + m - 1][m + y - 1] - dpX[x + m - 1][y - 1]);
}
}
}
}
int total = 0;
for (int y = k; y >= 1; --y)
{
for (int x = 1; x <= k; ++x)
{
fout << ans[y][x] << '\n';
total += ans[y][x];
}
}
fout << total << '\n';
}
return 0;
}