Submission #1005089

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005089		vjudge1	Zemljište (COCI22_zemljiste)	C++17	70 / 70	488 ms	7000 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX     505
int numRow, numCol, a, b;
int A[MAX][MAX], sum[MAX][MAX];

int col(int i, int l, int r){
    return sum[r][i] - sum[l - 1][i];
}
int solve(int lim){
    int ans = LINF;
    FOR(l, 1, numRow) FOR(r, l, numRow){
        int j = 0, s = 0;
        for (int i = 1; i <= numCol; ++i){
            s += col(i, l, r);
            while (s > lim && j < i){
                s -= col(j, l, r); ++j;
            }
            minimize(ans, abs(s - a) + abs(s - b));
        }
    }
    return ans;
}


void process(void){
    cin >> numRow >> numCol >> a >> b;
    if (a > b) swap(a, b);
    int ans = LINF;
    FOR(i, 1, numRow) FOR(j, 1, numCol) {
        cin >> A[i][j];
        minimize(ans, abs(A[i][j] - a) + abs(A[i][j] - b));
        sum[i][j] = sum[i - 1][j] + A[i][j];
    }
    minimize(ans, solve(a)); //value <= l
    minimize(ans, solve(b)); //inside (l, r)

    //value >= r
    FOR(l, 1, numRow) FOR(r, l, numRow){
        int j = 0, s = 0;
        for (int i = 1; i <= numCol; ++i){
            s += col(i, l, r);
            while (s - col(j, l, r) >= b && j < i){
                s -= col(j, l, r); ++j;
            }
            minimize(ans, abs(s - a) + abs(s - b));
        }
    }
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
}

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