#include<bits/stdc++.h>
using namespace std;
long long n, m, x, a, b, pre[501][501], mini = INT_MAX;
int main()
{
cin >> n >> m >> a >> b;
pre[0][0] = 0;
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
{
cin >> x;
if(i == 1) pre[i][j] = pre[i][j - 1] + x;
else if(j == 1) pre[i][j] = pre[i - 1][j] + x;
else pre[i][j] = pre[i][j - 1] + pre[i - 1][j] - pre[i - 1][j - 1] + x;
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
{
for(int ii = 1; ii <= i; ++ii)
{
for(int jj = 1; jj <= j; ++jj)
{
long long temp = pre[i][j] - pre[i][jj - 1] - pre[ii - 1][j] + pre[ii - 1][jj - 1];
mini = min(mini, abs(temp - a) + abs(temp - b));
}
}
}
}
cout << mini;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
304 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
304 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
304 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
304 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
16 ms |
620 KB |
Output is correct |
11 |
Correct |
55 ms |
724 KB |
Output is correct |
12 |
Correct |
54 ms |
776 KB |
Output is correct |
13 |
Correct |
54 ms |
724 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
55 ms |
724 KB |
Output is correct |
16 |
Correct |
53 ms |
724 KB |
Output is correct |
17 |
Correct |
54 ms |
724 KB |
Output is correct |
18 |
Correct |
52 ms |
708 KB |
Output is correct |
19 |
Correct |
52 ms |
740 KB |
Output is correct |
20 |
Correct |
52 ms |
708 KB |
Output is correct |
21 |
Correct |
57 ms |
724 KB |
Output is correct |
22 |
Correct |
53 ms |
728 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
304 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
304 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
16 ms |
620 KB |
Output is correct |
11 |
Correct |
55 ms |
724 KB |
Output is correct |
12 |
Correct |
54 ms |
776 KB |
Output is correct |
13 |
Correct |
54 ms |
724 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
55 ms |
724 KB |
Output is correct |
16 |
Correct |
53 ms |
724 KB |
Output is correct |
17 |
Correct |
54 ms |
724 KB |
Output is correct |
18 |
Correct |
52 ms |
708 KB |
Output is correct |
19 |
Correct |
52 ms |
740 KB |
Output is correct |
20 |
Correct |
52 ms |
708 KB |
Output is correct |
21 |
Correct |
57 ms |
724 KB |
Output is correct |
22 |
Correct |
53 ms |
728 KB |
Output is correct |
23 |
Execution timed out |
2063 ms |
4616 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |