///~~~LOTA~~~///
#include "quality.h"
#include <bits/stdc++.h>
using namespace std;
int x[3001][3001];
bool check(int r,int c,int h,int w){
for(int i=h;i<=r;i++)
for(int j=w;j<=c;j++)
if((x[i][j]-x[i-h][j]-x[i][j-w]+x[i-h][j-w])>=(h*w+1)/2)
return 1;
return 0;
}
int rectangle(int r,int c,int h,int w,int q[3001][3001]){
int o=log2(r*c);
o=pow(2,o);
int ans=0;
for(o=o;o>0;o/=2){
if(ans+o>r*c) continue;
for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++)
x[i][j]=(q[i-1][j-1]<=ans+o)+x[i-1][j]+x[i][j-1]-x[i-1][j-1];
if(!check(r,c,h,w)) ans+=o;
}
return ans+1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
2 ms |
2908 KB |
Output is correct |
5 |
Correct |
2 ms |
2908 KB |
Output is correct |
6 |
Correct |
1 ms |
2908 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
2 ms |
2908 KB |
Output is correct |
5 |
Correct |
2 ms |
2908 KB |
Output is correct |
6 |
Correct |
1 ms |
2908 KB |
Output is correct |
7 |
Correct |
10 ms |
5980 KB |
Output is correct |
8 |
Correct |
10 ms |
5980 KB |
Output is correct |
9 |
Correct |
9 ms |
5980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
2 ms |
2908 KB |
Output is correct |
5 |
Correct |
2 ms |
2908 KB |
Output is correct |
6 |
Correct |
1 ms |
2908 KB |
Output is correct |
7 |
Correct |
10 ms |
5980 KB |
Output is correct |
8 |
Correct |
10 ms |
5980 KB |
Output is correct |
9 |
Correct |
9 ms |
5980 KB |
Output is correct |
10 |
Correct |
108 ms |
22608 KB |
Output is correct |
11 |
Correct |
107 ms |
29268 KB |
Output is correct |
12 |
Correct |
56 ms |
22824 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
2 ms |
2908 KB |
Output is correct |
5 |
Correct |
2 ms |
2908 KB |
Output is correct |
6 |
Correct |
1 ms |
2908 KB |
Output is correct |
7 |
Correct |
10 ms |
5980 KB |
Output is correct |
8 |
Correct |
10 ms |
5980 KB |
Output is correct |
9 |
Correct |
9 ms |
5980 KB |
Output is correct |
10 |
Correct |
108 ms |
22608 KB |
Output is correct |
11 |
Correct |
107 ms |
29268 KB |
Output is correct |
12 |
Correct |
56 ms |
22824 KB |
Output is correct |
13 |
Correct |
1044 ms |
140276 KB |
Output is correct |
14 |
Correct |
1029 ms |
140284 KB |
Output is correct |
15 |
Correct |
967 ms |
133384 KB |
Output is correct |