oj.uz

Submission #1104491

# Submission time Handle Problem Language Result Execution time Memory
1104491 2024-10-24T00:35:08 Z Whisper Zemljište (COCI22_zemljiste) C++17
70 / 70
 486 ms 6992 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 3 ms 2640 KB Output is correct
11 Correct 5 ms 2896 KB Output is correct
12 Correct 6 ms 2896 KB Output is correct
13 Correct 5 ms 2896 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 6 ms 2896 KB Output is correct
16 Correct 5 ms 2972 KB Output is correct
17 Correct 5 ms 3064 KB Output is correct
18 Correct 4 ms 2896 KB Output is correct
19 Correct 5 ms 2896 KB Output is correct
20 Correct 5 ms 2896 KB Output is correct
21 Correct 7 ms 2896 KB Output is correct
22 Correct 5 ms 2896 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 3 ms 2640 KB Output is correct
11 Correct 5 ms 2896 KB Output is correct
12 Correct 6 ms 2896 KB Output is correct
13 Correct 5 ms 2896 KB Output is correct
14 Correct 1 ms 2640 KB Output is correct
15 Correct 6 ms 2896 KB Output is correct
16 Correct 5 ms 2972 KB Output is correct
17 Correct 5 ms 3064 KB Output is correct
18 Correct 4 ms 2896 KB Output is correct
19 Correct 5 ms 2896 KB Output is correct
20 Correct 5 ms 2896 KB Output is correct
21 Correct 7 ms 2896 KB Output is correct
22 Correct 5 ms 2896 KB Output is correct
23 Correct 453 ms 6748 KB Output is correct
24 Correct 463 ms 6736 KB Output is correct
25 Correct 457 ms 6736 KB Output is correct
26 Correct 460 ms 6856 KB Output is correct
27 Correct 301 ms 6028 KB Output is correct
28 Correct 454 ms 6728 KB Output is correct
29 Correct 454 ms 6992 KB Output is correct
30 Correct 457 ms 6736 KB Output is correct
31 Correct 67 ms 4432 KB Output is correct
32 Correct 462 ms 6728 KB Output is correct
33 Correct 477 ms 6736 KB Output is correct
34 Correct 465 ms 6736 KB Output is correct
35 Correct 456 ms 6748 KB Output is correct
36 Correct 453 ms 6736 KB Output is correct
37 Correct 442 ms 6736 KB Output is correct
38 Correct 459 ms 6736 KB Output is correct
39 Correct 486 ms 6860 KB Output is correct
40 Correct 443 ms 6736 KB Output is correct
41 Correct 347 ms 5456 KB Output is correct
42 Correct 341 ms 5456 KB Output is correct
43 Correct 342 ms 5444 KB Output is correct
44 Correct 341 ms 5456 KB Output is correct