Submission #1042655

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042655		gyg	Pyramid Base (IOI08_pyramid_base)	C++17	27 / 100	5101 ms	123068 KiB

pyramid_base

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 4e5 + 5, MAX_R = 1e6 + 5, INF = 1e18;

int r, c, k, n;
array<int, MAX_N> row1, col1, row2, col2, cost;

array<int, 4 * MAX_R> st;
void update(int l, int r, int x) {
    for (int i = l; i <= r; i++) st[i] += x;
}
int query(int l, int r) {
    int ans = INF;
    for (int i = l; i <= r; i++) ans = min(ans, st[i]);
    return ans;
}

bool check(int s) {
    fill(st.begin(), st.end(), 0);

    array<vector<int>, MAX_R> ins, del;    
    for (int i = 1; i <= n; i++) {
        ins[max(col1[i] - s + 1, 1ll)].push_back(i);
        del[col2[i]].push_back(i);
    }
    
    for (int col = 1; col <= c - s + 1; col++) {
        for (int i : ins[col])
            update(max(row1[i] - s + 1, 1ll), row2[i], cost[i]);
        
        if (query(1, r - s + 1) <= k) {
            // cout << s << " " << col << ": " << query(1, r - s + 1) << endl;
            return true;
        }

        for (int i : del[col])
            update(max(row1[i] - s + 1, 1ll), row2[i], -cost[i]);
    }
    return false;
}

int bin_search() {
    int lo = 1, hi = min(r, c);
    while (lo != hi) {
        int mid = ceil((lo + hi) / (double) 2);
        // cout << mid << ": " << check(mid) << endl;
        if (check(mid)) lo = mid;
        else hi = mid - 1;
    }
    if (!check(lo)) return 0;
    return lo;
}

signed main() {
    // freopen("pbs.in", "r", stdin), freopen("pbs.out", "w", stdout);
    cin >> r >> c >> k >> n;
    for (int i = 1; i <= n; i++) cin >> row1[i] >> col1[i] >> row2[i] >> col2[i] >> cost[i];

    int ans = bin_search();
    cout << ans << '\n';
}

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