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 "quality.h"
#include <iostream>
using namespace std;
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
int l=0,r=R*C;
auto f=[&](int x){
int a[3001][3001];
for(int i=0;i<=R;i++) for(int j=0;j<=C;j++) a[i][j]=0;
for(int i=0;i<R;i++) for(int j=0;j<C;j++){
a[i+1][j+1]=a[i][j+1]+a[i+1][j]-a[i][j]+(Q[i][j]<=x?1:0);
}
/* for(int i=0;i<=R;i++){
for(int j=0;j<=C;j++) cout<<a[i][j]<<' ';
cout<<endl;
}
cout<<endl;
cout<<x<<' '<<H<<' '<<R<<' '<<W<<' '<<C<<endl;*/
for(int i=H;i<=R;i++) for(int j=W;j<=C;j++){
// cout<<i<<' '<<j<<' '<<a[i][j]-a[i-H][j]-a[i][j-W]+a[i-H][j-W]<<endl;
if(a[i][j]-a[i-H][j]-a[i][j-W]+a[i-H][j-W]>H*W/2) return 1;
}
return 0;
};
while(r-l>1){
int m=(l+r)/2;
if(f(m)) r=m;
else l=m;
}
return r;
}
# | 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... |