| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1330232 | opal_Inwza007x | Quality Of Living (IOI10_quality) | C++20 | 0 ms | 0 KiB |
typedef long long ll;
const ll maxn = 3001;
ll rectangle(ll n, ll m, ll h, ll w, ll arr[maxn][maxn]) {
ll l = 1, r = n * m;
ll rsq[n][m];
while (l < r) {
ll mid = l + (r - l) / 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
rsq[i][j] = (arr[i][j] <= mid ? 1 : -1) + (i == 0 ? 0 : rsq[i - 1][j]) + (j == 0 ? 0 : rsq[i][j - 1]) - (i == 0 || j == 0 ? 0 : rsq[i - 1][j - 1]);
}
}
bool flg = false;
for (int i = h - 1; i < n && !flg; i++) {
for (int j = w - 1; j < m; j++) {
ll val = rsq[i][j] - (i < h ? 0 : rsq[i - h][j]) - (j < w ? 0 : rsq[i][j - w]) + (i < h || j < w ? 0 : rsq[i - h][j - w]);
if (val > 0) {
flg = true;
break;
}
}
}
if (!flg) {
l = mid + 1;
}
else {
r = mid;
}
}
return l;
}