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;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#include "quality.h"
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
auto check = [&](int m) {
vector<vector<int>> pref(R + 1, vector<int>(C + 1));
FOR(i, 0, R - 1) FOR(j, 0, C - 1) {
int v = (Q[i][j] <= m ? +1 : -1);
pref[i + 1][j + 1] = pref[i + 1][j] + pref[i][j + 1] - pref[i][j] + v;
}
FOR(i, H, R) FOR(j, W, C) {
if(pref[i][j] - pref[i - H][j] - pref[i][j - W] + pref[i - H][j - W] >= 1)
return true;
}
return false;
};
int l = 1, r = R * C;
while(l < r) {
int m = (l + r) / 2;
if(check(m))
r = m;
else
l = m + 1;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |