| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 871358 | 2023-11-10T16:14:34 Z | vjudge1 | Quality Of Living (IOI10_quality) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
using namespace std;
using lli = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e3 + 1000;
const int mod = 1e9 + 7;
lli m, n, h, w, q[maxn][maxn], a[maxn][maxn], pre[maxn][maxn];
bool check(lli x)
{
for (lli i = 1; i <= m; i ++)
{
for (lli j = 1; j <= n; j ++)
{
a[i][j] = 0;
}
}
for (lli i = 1; i <= m; i ++)
{
for (lli j = 1; j <= n; j ++)
{
if (q[i][j] <= x)
{
a[i][j] = 1;
}
}
}
for (lli i = 1; i <= m; i ++)
{
for (lli j = 1; j <= n; j ++)
{
pre[i][j] = a[i][j] + pre[i][j - 1] + pre[i - 1][j] - pre[i - 1][j - 1];
//cout << pre[i][j] << endl;
}
}
//cout << endl;
for (lli i = 1; i <= m - h + 1; i ++)
{
for (lli j = 1; j <= n - w + 1; j ++)
{
lli sum = pre[i + h - 1][j + w - 1] - pre[i + h - 1][j - 1] - pre[i - 1][j + w - 1] + pre[i - 1][j - 1];
//cout << sum << endl;
if (sum > (h * w - 1) / 2)
{
//cout << " " << 1;
return true;
}
}
}
return false;
}
void rectangle()
{
cin >> m >> n >> h >> w;
for (lli i = 1; i <= m; i ++)
{
for (lli j = 1; j <= n; j ++)
{
cin >> q[i][j];
}
}
lli l = 1, r = m * n, res = 0;
while (l <= r)
{
lli mid = (l + r) / 2;
if (check(mid))
{
res = mid;
r = mid - 1;
} else l = mid + 1;
//cout << mid << endl;
}
cout << res;
}