#include <iostream>
#include "quality.h"
using namespace std;
int rectangle(int n, int m, int h, int w, int q[3001][3001]) {
int l=0, r=1e9, ans=0, pref[3001][3001];
while(l <= r) {
int mid = (l + r) / 2;
bool ok = 0;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
pref[i][j] = (q[i-1][j-1] <= mid) + pref[i-1][j] + pref[i][j-1] - pref[i-1][j-1];
for(int i=1; i+h-1<=n; i++)
for(int j=1; j+w-1<=m; 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) ok = 1;
if(ok) ans = mid, r = mid - 1;
else l = mid + 1;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
37724 KB |
Output is correct |
2 |
Correct |
16 ms |
37724 KB |
Output is correct |
3 |
Correct |
17 ms |
37716 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
37724 KB |
Output is correct |
2 |
Correct |
16 ms |
37724 KB |
Output is correct |
3 |
Correct |
17 ms |
37716 KB |
Output is correct |
4 |
Correct |
18 ms |
37724 KB |
Output is correct |
5 |
Correct |
18 ms |
37724 KB |
Output is correct |
6 |
Correct |
17 ms |
37668 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
37724 KB |
Output is correct |
2 |
Correct |
16 ms |
37724 KB |
Output is correct |
3 |
Correct |
17 ms |
37716 KB |
Output is correct |
4 |
Correct |
18 ms |
37724 KB |
Output is correct |
5 |
Correct |
18 ms |
37724 KB |
Output is correct |
6 |
Correct |
17 ms |
37668 KB |
Output is correct |
7 |
Correct |
28 ms |
39772 KB |
Output is correct |
8 |
Correct |
29 ms |
39768 KB |
Output is correct |
9 |
Correct |
29 ms |
39748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
37724 KB |
Output is correct |
2 |
Correct |
16 ms |
37724 KB |
Output is correct |
3 |
Correct |
17 ms |
37716 KB |
Output is correct |
4 |
Correct |
18 ms |
37724 KB |
Output is correct |
5 |
Correct |
18 ms |
37724 KB |
Output is correct |
6 |
Correct |
17 ms |
37668 KB |
Output is correct |
7 |
Correct |
28 ms |
39772 KB |
Output is correct |
8 |
Correct |
29 ms |
39768 KB |
Output is correct |
9 |
Correct |
29 ms |
39748 KB |
Output is correct |
10 |
Correct |
175 ms |
47904 KB |
Output is correct |
11 |
Correct |
143 ms |
47952 KB |
Output is correct |
12 |
Correct |
87 ms |
48068 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
37724 KB |
Output is correct |
2 |
Correct |
16 ms |
37724 KB |
Output is correct |
3 |
Correct |
17 ms |
37716 KB |
Output is correct |
4 |
Correct |
18 ms |
37724 KB |
Output is correct |
5 |
Correct |
18 ms |
37724 KB |
Output is correct |
6 |
Correct |
17 ms |
37668 KB |
Output is correct |
7 |
Correct |
28 ms |
39772 KB |
Output is correct |
8 |
Correct |
29 ms |
39768 KB |
Output is correct |
9 |
Correct |
29 ms |
39748 KB |
Output is correct |
10 |
Correct |
175 ms |
47904 KB |
Output is correct |
11 |
Correct |
143 ms |
47952 KB |
Output is correct |
12 |
Correct |
87 ms |
48068 KB |
Output is correct |
13 |
Correct |
1261 ms |
71004 KB |
Output is correct |
14 |
Correct |
1174 ms |
71044 KB |
Output is correct |
15 |
Correct |
1178 ms |
71028 KB |
Output is correct |