Submission #1036082

#TimeUsernameProblemLanguageResultExecution timeMemory
1036082vjudge1Zemljište (COCI22_zemljiste)C++17
30 / 70
2021 ms4776 KiB
#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; for (ll i = 1; i <= n; i ++){ for (ll j = 1; j <= m; j ++){ cin >> 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]; } } if (b < a) swap(a, b); ll ans = 1e18; for (ll i = 1; i <= n; i ++){ for (ll j = 1; j <= m; j ++){ for (ll x = i; x <= n; x ++){ ll sm = f(i, j, x, j); ans = min(ans, abs(a - sm) + abs(b - sm)); if (sm > 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; } sm = f(i, j, x, l); ans = min(ans, abs(a - sm) + abs(b - sm)); if (l < m) sm = f(i, j, x, l + 1); ans = min(ans, abs(a - sm) + abs(b - sm)); } } } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...