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<bits/stdc++.h>
using namespace std;
typedef long long ll;
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
ll col[R][C];
for(int i=0;i<R;i++){
for(int j=0;j<C;j++){
if(j!=0)col[i][j]=col[i][j-1]+(long long) Q[i][j];
else col[i][j]=(long long) Q[i][j];
}
}
ll ans=1e18;
for(int i=0;i<R-H+1;i++){
ll cur=0;
for(int j=0;j<C;j++){
cur+=col[i+H-1][j];
if(i>0)cur-=col[i-1][j];
if(j-W>=0){
cur-=col[i+H-1][j-W];
if(i>0)cur+=col[i][j-W];
}
if(j>=W-1)ans=min(ans,cur);
}
}
return ans/H/W;
}
# | 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... |