oj.uz

답안 #849180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849180 2023-09-14T08:36:26 Z fanwen Zemljište (COCI22_zemljiste) C++17
0 / 70
 1 ms 348 KB 
#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, 1, r, i);
        int ja = 0, jb = 0;
        FOR(i, 1, M) {
            minimize(ans, abs(F[i] - A) + abs(F[i] - B));
            while(ja < i && F[i] - F[ja] > A) ja++;
            while(jb < i && F[i] - F[jb] > B) jb++;
            if(jb && F[i] - F[jb] >= B) minimize(ans, 2 * (F[i] - F[jb]) - A - B);
            minimize(ans, A + B - 2 * (F[i] - F[ja]));
            if(ja && F[ja - 1] + B >= F[i]) minimize(ans, B - A);
        }
    }
    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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -