제출 #849181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
849181		fanwen	Zemljište (COCI22_zemljiste)	C++17	70 / 70	426 ms	4944 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

const int MAXN = 505;

int N, M, A, B;
long long a[MAXN][MAXN], F[MAXN];

long long get(int x, int y, int u, int v) {
    return a[u][v] - a[x - 1][v] - a[u][y - 1] + a[x - 1][y - 1];
}

void you_make_it(void) {
    cin >> N >> M >> A >> B; if(A > B) swap(A, B);
    FOR(i, 1, N) FOR(j, 1, M) {
        cin >> a[i][j]; 
        a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
    }
    long long ans = 1e18;
    FOR(l, 1, N) FOR(r, l, N) {
        FOR(i, 1, M) F[i] = get(l, i, r, i);
        int j = 0;
        long long sum = 0;
        FOR(i, 1, M) {
            while(j < M && abs(sum - A) + abs(sum - B) > abs(sum - A + F[j + 1]) + abs(sum - B + F[j + 1])) {
                sum += F[++j];
            }
            minimize(ans, abs(sum - A) + abs(sum - B));
            sum -= F[i];
        }
    }
    cout << ans;
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

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