# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519477 | fabijan_cikac | Quality Of Living (IOI10_quality) | C++17 | 0 ms | 0 KiB |
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;
const int MAXN = 3 * 1e3 + 100;
int pref[MAXN][MAXN];
bool check(int x, int n, int m, int h, int w, int a[MAXN][MAXN]){
int px, py;
for (int i = 0; i <= max(n, m); ++i){
pref[0][i] = 0; pref[i][0] = 0;
}
for (int i = 1; i <= n; ++i){
for (int j = 1; j <= m; ++j){
pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
if (a[i - 1][j - 1] < x)
--pref[i][j];
else if (a[i - 1][j - 1] > x)
++pref[i][j];
else{
px = i; py = j;
}
}
}
for (int i = 1; i <= n - h + 1; ++i){
for (int j = 1; j <= m - w + 1; ++j){
if (pref[i + h - 1][j + w - 1] - pref[i - 1][j + w - 1] - pref[i + h - 1][j - 1] + pref[i - 1][j - 1] <= 0 && (px >= i && px <= i + h - 1 && py >= j && py <= j + w - 1))
return 1;
}
}
return 0;
}
int bins(int l, int r, int n, int m, int h, int w, int a[MAXN][MAXN]){
int mid = (l + r - 1) / 2;
if (l == r)
return l;
else if (check(mid, n, m, h, w, a))
return bins(l, mid, n, m, h, w, a);
return bins(mid + 1, r, n, m, h, w, a);
}
int rectangle(int R, int C, int H, int W, int Q[MAXN][MAXN]){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return bins(1, R * C, R, C, H, W, Q);
}