# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519594 | drkarlicio2107 | Quality Of Living (IOI10_quality) | C++14 | 0 ms | 0 KiB |
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>
int pref [3010][3010]; int l [3010][3010];
int rectangle(int R, int C, int H, int W, int Q[N][M]){
int lo=0, hi=R*C;
for (int i=0; i<R; i++){
for (int j=0; j<C; j++) l [i+1][j+1]=Q[i][j];
}
while(lo<hi){
int mid=(lo+hi+1)/2;
long long int ans=1e9;
int da=0;
for (int i=1; i<R+1; i++){
for (int j=1; j<C+1; j++){
if(l[i][j]<mid) l[i][j]=-1;
if(l[i][j]>mid) l[i][j]=1;
pref[i][j]=pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1]+l[i][j];
if(i>=H && j>=W) if (pref[i][j]-pref[i-H][j]-pref[i][j-W]+pref[i-H][j-W]<0) da=1;
}
}
if(da) hi=mid-1
else lo=mid;
}
return lo;
}