oj.uz

답안 #503851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503851 2022-01-09T04:42:54 Z tabr Pyramid Base (IOI08_pyramid_base) C++17
70 / 100
 5000 ms 55016 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

struct segtree {
    using T = long long;
    using F = long long;

    T e() {
        return (long long) 1e18;
    }

    F id() {
        return 0;
    }

    T op(T a, T b) {
        return min(a, b);
    }

    T mapping(F f, T x) {
        return f + x;
    }

    F composition(F f, F g) {
        return f + g;
    }

    int n;
    vector<T> node;
    vector<F> lazy;

    segtree() : segtree(0) {}
    segtree(int _n) {
        if (_n <= 1) {
            n = _n;
        } else {
            n = 1 << (32 - __builtin_clz(_n - 1));
        }
        node.resize(2 * n, e());
        lazy.resize(n, id());
    }
    segtree(vector<T> v) {
        if ((int) v.size() <= 1) {
            n = (int) v.size();
        } else {
            n = 1 << (32 - __builtin_clz((int) v.size() - 1));
        }
        node.resize(2 * n, e());
        lazy.resize(n, id());
        for (int i = 0; i < (int) v.size(); i++) {
            node[i + n] = v[i];
        }
        for (int i = n - 1; i > 0; i--) {
            node[i] = op(node[i * 2], node[i * 2 + 1]);
        }
    }

    void eval(int k) {
        node[2 * k] = mapping(lazy[k], node[2 * k]);
        node[2 * k + 1] = mapping(lazy[k], node[2 * k + 1]);
        if (2 * k < n) {
            lazy[2 * k] = composition(lazy[k], lazy[2 * k]);
            lazy[2 * k + 1] = composition(lazy[k], lazy[2 * k + 1]);
        }
        lazy[k] = id();
    }

    void update(int x, int y, F v, int k, int l, int r) {
        if (y <= l || r <= x) {
            return;
        }
        if (x <= l && r <= y) {
            node[k] = mapping(v, node[k]);
            if (k < n) {
                lazy[k] = composition(v, lazy[k]);
            }
        } else {
            eval(k);
            update(x, y, v, 2 * k, l, (l + r) / 2);
            update(x, y, v, 2 * k + 1, (l + r) / 2, r);
            node[k] = op(node[2 * k], node[2 * k + 1]);
        }
    }

    T get(int x, int y, int k, int l, int r) {
        if (y <= l || r <= x) {
            return e();
        }
        if (x <= l && r <= y) {
            return node[k];
        }
        eval(k);
        T vl = get(x, y, 2 * k, l, (l + r) / 2);
        T vr = get(x, y, 2 * k + 1, (l + r) / 2, r);
        return op(vl, vr);
    }

    void update(int x, int y, F v) {
        update(x, y, v, 1, 0, n);
    }

    T get(int x, int y) {
        return get(x, y, 1, 0, n);
    }

    T get(int x) {
        return get(x, x + 1, 1, 0, n);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h, w;
    cin >> h >> w;
    int d;
    cin >> d;
    int n;
    cin >> n;
    vector<tuple<int, int, int, int>> a(n), b(n);
    for (int i = 0; i < n; i++) {
        int x1, y1, x2, y2, c;
        cin >> x1 >> y1 >> x2 >> y2 >> c;
        x1--, y1--;
        a[i] = make_tuple(x1, y1, y2, c);
        b[i] = make_tuple(x2, y1, y2, c);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int hi = min(w, h) + 1;
    int lo = 0;
    vector<int> mp(w, -1);
    while (hi - lo > 1) {
        int mid = (hi + lo) / 2;
        int aid = 0;
        int bid = 0;
        int ok = 0;
        vector<int> xs(2 * n + 2), ys(4 * n + 2);
        for (int i = 0; i < n; i++) {
            auto [x2, y1, y2, c] = b[i];
            y1 = max(0, y1 - mid + 1);
            y2 = min(w - mid + 1, y2);
            ys[2 * i] = y1;
            ys[2 * i + 1] = y2;
            xs[i] = min(h - mid, x2);
        }
        for (int i = 0; i < n; i++) {
            auto [x1, y1, y2, c] = a[i];
            y1 = max(0, y1 - mid + 1);
            y2 = min(w - mid + 1, y2);
            ys[2 * n + 2 * i] = y1;
            ys[2 * n + 2 * i + 1] = y2;
            xs[i + n] = max(0, x1 - mid + 1);
        }
        xs[2 * n + 1] = h - mid;
        sort(xs.begin(), xs.end());
        xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
        ys[4 * n + 1] = w - mid + 1;
        sort(ys.begin(), ys.end());
        ys.resize(unique(ys.begin(), ys.end()) - ys.begin());
        int sz = (int) ys.size();
        for (int i = 0; i < sz; i++) {
            mp[ys[i]] = i;
        }
        segtree seg = segtree(vector<long long>(sz - 1));
        for (int i : xs) {
            while (bid < n && get<0>(b[bid]) <= i) {
                auto [x2, y1, y2, c] = b[bid];
                y1 = max(0, y1 - mid + 1);
                y2 = min(w - mid + 1, y2);
                y1 = mp[y1];
                y2 = mp[y2];
                seg.update(y1, y2, -c);
                bid++;
            }
            while (aid < n && get<0>(a[aid]) - mid + 1 <= i) {
                auto [x1, y1, y2, c] = a[aid];
                y1 = max(0, y1 - mid + 1);
                y2 = min(w - mid + 1, y2);
                y1 = mp[y1];
                y2 = mp[y2];
                seg.update(y1, y2, c);
                aid++;
            }
            if (seg.node[1] <= d) {
                ok = 1;
                break;
            }
        }
        if (ok) {
            lo = mid;
        } else {
            hi = mid;
        }
    }
    cout << lo << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 332 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 332 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 716 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4300 KB Output is correct
2 Correct 16 ms 4300 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4292 KB Output is correct
2 Correct 9 ms 4300 KB Output is correct

Subtask #8
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 720 KB Output is correct
2 Correct 70 ms 836 KB Output is correct
3 Correct 54 ms 848 KB Output is correct

Subtask #9
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 2428 KB Output is correct
2 Correct 347 ms 2492 KB Output is correct
3 Correct 264 ms 2436 KB Output is correct

Subtask #10
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 6212 KB Output is correct
2 Correct 31 ms 1376 KB Output is correct
3 Correct 127 ms 7168 KB Output is correct
4 Correct 348 ms 7048 KB Output is correct

Subtask #11
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 7472 KB Output is correct
2 Correct 610 ms 7528 KB Output is correct
3 Correct 185 ms 5956 KB Output is correct

Subtask #12
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 365 ms 6800 KB Output is correct
2 Correct 786 ms 7984 KB Output is correct
3 Correct 793 ms 7820 KB Output is correct
4 Correct 853 ms 7884 KB Output is correct
5 Correct 811 ms 7920 KB Output is correct
6 Correct 143 ms 6348 KB Output is correct

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5078 ms 30184 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5084 ms 36476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5094 ms 55016 KB Time limit exceeded
2 Halted 0 ms 0 KB -