Submission #1036099

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036099		vjudge1	Zemljište (COCI22_zemljiste)	C++17	30 / 70	2041 ms	4812 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 505;
int n, m, a, b, i, j, x, l, r, mid;
ll mat[N][N], sm, tmp, ans;

ll f(int y){
    return mat[x][y] - mat[x][j - 1] - mat[i - 1][y] + mat[i - 1][j - 1];
}

int main(){
    cin >> n >> m >> a >> b;
    for (i = 1; i <= n; i ++){
        for (j = 1; j <= m; j ++){
            cin >> mat[i][j];

            mat[i][j] += mat[i - 1][j];
            mat[i][j] += mat[i][j - 1];
            mat[i][j] -= mat[i - 1][j - 1];
        }
    }

    if (b < a) swap(a, b);

    ans = 1e18;
    for (i = 1; i <= n; i ++){
        for (j = 1; j <= m; j ++){
            for (x = i; x <= n; x ++){
                sm = f(j);
                tmp = abs(a - sm) + abs(b - sm);
                ans = min(ans, tmp);
                if (sm > b) break;
                
                l = j;
                r = m + 1;
                while (r - l > 1){
                    mid = (l + r) / 2;
                    if (f(mid) > b)
                        r = mid;
                    else
                        l = mid;
                }

                sm = f(l);
                ans = min(ans, abs(a - sm) + abs(b - sm));

                if (l < m) sm = f(l + 1);
                ans = min(ans, abs(a - sm) + abs(b - sm));
            }
        }
    }

    cout << ans << endl;
}

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