#include "bits/stdc++.h"
#define st first
#define nd second
using lint = int64_t;
constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;
int r, s;
lint a, b;
vector<vector<lint>> prefix;
lint getSum(int l, int r, int sr, int er){
if(r < l || er < sr) return 0;
lint ans = prefix[r][er];
ans -= prefix[l-1][er] + prefix[r][sr-1];
ans += prefix[l-1][sr-1];
return ans;
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin>>r>>s>>a>>b;
if(a > b) swap(a, b);
lint ans = LINF;
prefix = vector<vector<lint>>(r+2, vector<lint>(s+2));
for(int i=1; i<=r; i++)
for(int j=1; j<=s; j++){
cin>>prefix[i][j];
prefix[i][j] += prefix[i-1][j] + prefix[i][j-1];
prefix[i][j] -= prefix[i-1][j-1];
}
//cout<<"\ta "<<a<<" b "<<b<<"\n"; return 0;
for(int sr=1; sr<=s; sr++)
for(int er=sr; er<=s; er++){
int left=1;
lint cur = 0;
for(int right = 1; right <= r; right++){
cur = getSum(left,right,sr,er);
ans = min(ans, abs(a-cur) + abs(b-cur));
while(cur > b){
left++;
cur = getSum(left,right,sr,er);
ans = min(ans, abs(a-cur) + abs(b-cur));
}
cur = getSum(left,right,sr,er);
ans = min(ans, abs(a-cur) + abs(b-cur));
}
}
cout<<ans<<"\n";
return 0;
}
/*
[ ]Leu o problema certo???
[ ]Ver se precisa de long long
[ ]Viu o limite dos fors (é n? é m?)
[ ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[ ]Testar sample
[ ]Testar casos de borda
[ ]1LL no 1LL << i
[ ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
348 KB |
Output is correct |
| 11 |
Correct |
4 ms |
604 KB |
Output is correct |
| 12 |
Correct |
6 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
856 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
4 ms |
604 KB |
Output is correct |
| 16 |
Correct |
5 ms |
604 KB |
Output is correct |
| 17 |
Correct |
4 ms |
604 KB |
Output is correct |
| 18 |
Correct |
3 ms |
348 KB |
Output is correct |
| 19 |
Correct |
4 ms |
348 KB |
Output is correct |
| 20 |
Correct |
4 ms |
596 KB |
Output is correct |
| 21 |
Correct |
4 ms |
344 KB |
Output is correct |
| 22 |
Correct |
4 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
348 KB |
Output is correct |
| 11 |
Correct |
4 ms |
604 KB |
Output is correct |
| 12 |
Correct |
6 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
856 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
4 ms |
604 KB |
Output is correct |
| 16 |
Correct |
5 ms |
604 KB |
Output is correct |
| 17 |
Correct |
4 ms |
604 KB |
Output is correct |
| 18 |
Correct |
3 ms |
348 KB |
Output is correct |
| 19 |
Correct |
4 ms |
348 KB |
Output is correct |
| 20 |
Correct |
4 ms |
596 KB |
Output is correct |
| 21 |
Correct |
4 ms |
344 KB |
Output is correct |
| 22 |
Correct |
4 ms |
348 KB |
Output is correct |
| 23 |
Correct |
378 ms |
4948 KB |
Output is correct |
| 24 |
Correct |
383 ms |
4852 KB |
Output is correct |
| 25 |
Correct |
443 ms |
4700 KB |
Output is correct |
| 26 |
Correct |
377 ms |
4944 KB |
Output is correct |
| 27 |
Correct |
170 ms |
3380 KB |
Output is correct |
| 28 |
Correct |
365 ms |
4984 KB |
Output is correct |
| 29 |
Correct |
359 ms |
4692 KB |
Output is correct |
| 30 |
Correct |
363 ms |
4852 KB |
Output is correct |
| 31 |
Correct |
11 ms |
860 KB |
Output is correct |
| 32 |
Correct |
374 ms |
4736 KB |
Output is correct |
| 33 |
Correct |
403 ms |
4848 KB |
Output is correct |
| 34 |
Correct |
371 ms |
4848 KB |
Output is correct |
| 35 |
Correct |
412 ms |
4848 KB |
Output is correct |
| 36 |
Correct |
354 ms |
4848 KB |
Output is correct |
| 37 |
Correct |
360 ms |
4848 KB |
Output is correct |
| 38 |
Correct |
356 ms |
4692 KB |
Output is correct |
| 39 |
Correct |
418 ms |
4944 KB |
Output is correct |
| 40 |
Correct |
358 ms |
4848 KB |
Output is correct |
| 41 |
Correct |
262 ms |
3416 KB |
Output is correct |
| 42 |
Correct |
235 ms |
3420 KB |
Output is correct |
| 43 |
Correct |
284 ms |
3588 KB |
Output is correct |
| 44 |
Correct |
239 ms |
3588 KB |
Output is correct |
