# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525977 | tkwiatkowski | 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.
/*
Zadanie:
Autor: Tomasz Kwiatkowski
*/
#include <bits/stdc++.h>
#include "quality.h"
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 7;
const int INF = 1e9 + 7;
bool check(int m, int R, int C, int H, int W, int *Q[3001])
{
vector<vector<int>> pref(R + 1, vector<int>(C + 1));
for (int i = 1; i <= R; ++i)
for (int j = 1; j <= C; ++j)
pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + (Q[i - 1][j - 1] >= m);
for (int i = 1; i <= R-H+1; ++i)
for (int j = 1; j <= C-W+1; ++j)
if (2*(pref[i + H - 1][j + W - 1] - pref[i - 1][j + W - 1] - pref[i + H - 1][j - 1] + pref[i - 1][j - 1]) >= H*W)
return true;
return false;
}
int rectangle(int R, int C, int H, int W, int *Q[3001])
{
int lo = 1, hi = R*C;
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
if (check(mid, R, C, H, W, Q))
lo = mid;
else
hi = mid - 1;
}
return lo;
}