Submission #926557

#	Time	Username	Problem	Language	Result	Execution time	Memory
926557		math_rabbit_1028	Pyramid Base (IOI08_pyramid_base)	C++14	70 / 100	5091 ms	134188 KiB

pyramid_base

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;

int M, N, P;
array<int, 5> arr[404040];
ll B;

struct segtree {
    ll tree[1<<21], lazy[1<<21];
    void prop(int v, int st, int ed) {
        tree[v] += lazy[v];
        if (st != ed) {
            lazy[2*v] += lazy[v];
            lazy[2*v+1] += lazy[v];
        }
        lazy[v] = 0;
    }
    void update(int v, int st, int ed, int lt, int rt, int val) {
        prop(v, st, ed);
        if (lt > ed || st > rt) return;
        if (lt <= st && ed <= rt) {
            lazy[v] = val;
            prop(v, st, ed);
            return;
        }
        int mid = (st+ed)/2;
        update(2*v, st, mid, lt, rt, val);
        update(2*v+1, mid+1, ed, lt, rt, val);
        tree[v] = min(tree[2*v], tree[2*v+1]);
    }
    ll get(int v, int st, int ed, int lt, int rt) {
        prop(v, st, ed);
        if (lt > ed || st > rt) return 1e9;
        if (lt <= st && ed <= rt) return tree[v];
        int mid = (st+ed)/2;
        return min(get(2*v, st, mid, lt, rt), get(2*v+1, mid+1, ed, lt, rt));
    }
} seg;

vector<array<int, 3>> add[1010101], rem[1010101];
bool solve(int L) {
    for (int i = 0; i <= M-L; i++) add[i].clear();
    for (int i = 0; i <= M-L; i++) rem[i].clear();
    for (int i = 0; i < (1<<21); i++) seg.tree[i] = seg.lazy[i] = 0;
    
    for (int i = 1; i <= P; i++) {
        if (arr[i][0]-L < 0) seg.update(1, 0, N-L, arr[i][1]-L, arr[i][3]-1, +arr[i][4]);
        else add[arr[i][0]-L].push_back({arr[i][1]-L, arr[i][3]-1, +arr[i][4]});
        rem[arr[i][2]].push_back({arr[i][1]-L, arr[i][3]-1, -arr[i][4]});
    }
    
    for (int i = 0; i <= M-L; i++) {
        for (auto &[l, r, w] : add[i]) seg.update(1, 0, N-L, l, r, w);
        for (auto &[l, r, w] : rem[i]) seg.update(1, 0, N-L, l, r, w);
        if (seg.get(1, 0, N-L, 0, N-L) <= B) return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> M >> N;
    cin >> B >> P;
    for (int i = 1; i <= P; i++) {
        cin >> arr[i][0] >> arr[i][1] >> arr[i][2] >> arr[i][3] >> arr[i][4];
    }

    int st = 0, ed = min(M, N);
    while (st < ed) {
        int mid = (st+ed+1)/2;
        if (solve(mid)) st = mid;
        else ed = mid-1;
    }
    cout << st << "\n";

    return 0;
}

Compilation message (stderr)

pyramid_base.cpp: In function 'bool solve(int)':
pyramid_base.cpp:57:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for (auto &[l, r, w] : add[i]) seg.update(1, 0, N-L, l, r, w);
      |                    ^
pyramid_base.cpp:58:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for (auto &[l, r, w] : rem[i]) seg.update(1, 0, N-L, l, r, w);
      |                    ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7
• Subtask 11: 7 / 7
• Subtask 12: 7 / 7
• Subtask 13: 0 / 10
• Subtask 14: 0 / 10
• Subtask 15: 0 / 10