oj.uz

답안 #1090680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090680 2024-09-18T15:23:02 Z Kuzeuy54_ Zemljište (COCI22_zemljiste) C++17
0 / 70
 4 ms 4184 KB 
#include <bits/stdc++.h>
using namespace std;
#define fast cin.tie(0)->sync_with_stdio(0);
#define inf 1e18
#define int long long
const int mod=1e9+7;
const int MAXN=501;

vector<vector<int>>dp(MAXN,vector<int>(MAXN,0)),mat(MAXN,vector<int>(MAXN,0));
inline int sum(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(){
	fast
    int n,m,a,b;
	cin>>n>>m>>a>>b;
	if(a>b) swap(a,b);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>mat[i][j];
			dp[i][j]=mat[i][j]+dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
		}
	}
	int ans=inf;
	for(int rowst = 1; rowst <= n; rowst++){
		for(int rownd = 1; rownd <= n; rownd++){
			int l=1,r=1;
			while(r<=m){
				int now=sum(rowst,l,rownd,r);
				ans=min(ans, abs(a-now)+abs(b-now));
				if(now>b){
					l++;
					if(l>r){
						r++;
					}
				}
				else if(now>=a){
					cout<<b-a<<"\n";
					return 0;
				}
				else{
					r++;
				}
			}
		}
	}
	cout<<ans<<"\n";
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -