This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 505;
ll n, m, a, b, mat[N][N];
ll f(ll i, ll j, ll x, ll y){
return mat[x][y] - mat[x][j - 1] - mat[i - 1][y] + mat[i - 1][j - 1];
}
int main(){
cin >> n >> m >> a >> b;
ll mn = 1e18;
for (ll i = 1; i <= n; i ++){
for (ll j = 1; j <= m; j ++){
cin >> mat[i][j];
if (mat[i][j] > b)
mn = min(mn, mat[i][j]);
mat[i][j] += mat[i - 1][j];
mat[i][j] += mat[i][j - 1];
mat[i][j] -= mat[i - 1][j - 1];
}
}
ll ans = abs(mn - b) + abs(mn - a);
for (ll i = 1; i <= n; i ++){
for (ll j = 1; j <= m; j ++){
for (ll x = i; x <= n; x ++){
if (f(i, j, x, j) > b) break;
ll l = j;
ll r = m + 1;
while (r - l > 1){
ll mid = (l + r) / 2;
if (f(i, j, x, mid) > b)
r = mid;
else
l = mid;
}
ll sm = f(i, j, x, l);
ans = min(ans, abs(a - sm) + abs(b - sm));
}
}
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |