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)),mat(MAXN,vector<int>(MAXN,0));
inline int toplam(int x1,int y1,int x2,int y2){
return dp[y2][x2]-dp[y1-1][x2]-dp[y2][x1-1]+dp[y1-1][x1-1];
}
int32_t main(){
int x,y,a,b,ans=inf;
cin>>x>>y>>a>>b;
if(a>b)
swap(a,b);
for(int i=1;i<=x;i++)
for(int j=1;j<=y;j++){
cin>>mat[i][j];
dp[i][j]=mat[i][j]+dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
}
for(int i=1;i<=y;i++)
for(int j=1;j<=y;j++){
int l=1,r=1;
while(r<=y){
int suan=toplam(i,l,j,r);
ans=min(ans,abs(a-suan)+abs(b-suan));
if(suan>b){
l++;
if(l>r)
r++;
}
else
r++;
}
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |