제출 #1272685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272685		ayhamzaidd	Zemljište (COCI22_zemljiste)	C++20	70 / 70	243 ms	4400 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define fi first
#define se second
#define made '\n'

const ll N=505,MOD=1e9+7,INF=1e18;

ll pref[N][N],a[N][N];

ll f(int x,int y,int xx,int yy){
    ll cnt=pref[xx][yy];
    cnt-=pref[x-1][yy];
    cnt-=pref[xx][y-1];
    cnt+=pref[x-1][y-1];
    return cnt;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n,m,x,y;cin>>n>>m>>x>>y;
    if(x>y)swap(x,y);

    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            cin>>a[i][j];
            pref[i][j]=pref[i][j-1]+a[i][j]+pref[i-1][j]-pref[i-1][j-1];
        }
    }
    ll mn=INF;
    for(int i=1; i<=n; i++){
        for(int k=i; k<=n; k++){
            for(int j=1,l=1; j<=m; j++){
                ll cnt=f(i,l,k,j);
                mn=min(mn,abs(x-cnt)+abs(y-cnt));
                while(cnt>y){
                    l++;
                    cnt=f(i,l,k,j);
                    mn=min(mn,abs(x-cnt)+abs(y-cnt)); 
                }
            }
        }
    }
    cout<<mn;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 40 / 40