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>
using namespace std;
#define inf 1e18
#define int long long
const int mod=1e9+7;
const int MAXN=505;
vector<vector<int>>dp(MAXN,vector<int>(MAXN,0));
vector<vector<int>>mat(MAXN,vector<int>(MAXN,0));
int omg(int x1,int x2,int y1,int y2){
return dp[x2][y2]-dp[x1-1][y2]-dp[x2][y1-1]+dp[x1-1][y1-1];
}
int32_t main(){
int x,y,a,b,temp,temp2,ans=inf;
cin>>x>>y>>a>>b;
temp=max(a,b);
temp2=min(a,b);
a=temp;
b=temp2;
for(int i=1;i<=x;i++)
for(int j=1;j<=y;j++)
cin>>mat[i][j];
for(int i=1;i<=x;i++)
for(int j=1;j<=y;j++)
dp[i][j]=mat[i][j]+dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
for(int j=1;j<=x;j++)
for(int i=1;i<=x;i++){
int l=1,r=1;
while(r<=y){
int aq=omg(l,j,r,i);
ans=min(abs(a-aq)+abs(b-aq),ans);
if(aq<a)
r++;
else
l++;
}
}
cout<<ans<<"\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |