oj.uz

Submission #1042772

# Submission time Handle Problem Language Result Execution time Memory
1042772 2024-08-03T11:16:23 Z gyg Pyramid Base (IOI08_pyramid_base) C++17
70 / 100
 5000 ms 178828 KB 
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#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;
 
struct Node { int min, lazy; }; 
array<Node, 4 * MAX_R> st;
void propogate(int u) {
    st[2 * u].min += st[u].lazy, st[2 * u].lazy += st[u].lazy;
    st[2 * u + 1].min += st[u].lazy, st[2 * u + 1].lazy += st[u].lazy;
    st[u].lazy = 0;
}
void update(int l, int _r, int x, int u = 1, int lo = 1, int hi = r) {
    if (l <= lo && hi <= _r) { 
        st[u].min += x, st[u].lazy += x;
        return;
    }
    propogate(u);
    int mid = (lo + hi) / 2;
    if (l <= mid) update(l, _r, x, 2 * u, lo, mid);
    if (mid < _r) update(l, _r, x, 2 * u + 1, mid + 1, hi);
    st[u].min = min(st[2 * u].min, st[2 * u + 1].min);
}
int query(int l, int _r, int u = 1, int lo = 1, int hi = r) {
    if (_r < lo || hi < l) return INF;
    if (l <= lo && hi <= _r) return st[u].min;
    propogate(u);
    int mid = (lo + hi) / 2, ans = INF;
    if (l <= mid) ans = min(ans, query(l, _r, 2 * u, lo, mid));
    if (mid < _r) ans = min(ans, query(l, _r, 2 * u + 1, mid + 1, hi));
    return ans;
}
 
array<vector<int>, MAX_R> ins, del;   
bool check(int s) {
    Node zero = {0, 0};
    fill(st.begin(), st.end(), zero);
    for (int i = 1; i <= c; i++) ins[i].clear(), del[i].clear();
     
    for (int i = 1; i <= n; i++) {
        ins[max(col1[i] - s + 1, 1ll)].push_back(i);
        del[col2[i]].push_back(i);
    }
    
    bool prev = true;
    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 (prev && query(1, r - s + 1) <= k) return true;
        
        prev = del[col].size();
        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);
        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.sync_with_stdio(false), cin.tie(0);
    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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 109904 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 109908 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 109904 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 110160 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 110416 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 110204 KB Output is correct
2 Correct 305 ms 110516 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 110672 KB Output is correct
2 Correct 224 ms 110160 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 110552 KB Output is correct
2 Correct 120 ms 110672 KB Output is correct
3 Correct 129 ms 110660 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 113340 KB Output is correct
2 Correct 334 ms 113880 KB Output is correct
3 Correct 321 ms 114088 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 116192 KB Output is correct
2 Correct 185 ms 111700 KB Output is correct
3 Correct 135 ms 115792 KB Output is correct
4 Correct 829 ms 119948 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 119120 KB Output is correct
2 Correct 998 ms 121808 KB Output is correct
3 Correct 478 ms 114128 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 117712 KB Output is correct
2 Correct 1291 ms 124496 KB Output is correct
3 Correct 1183 ms 124676 KB Output is correct
4 Correct 1271 ms 124568 KB Output is correct
5 Correct 1225 ms 124380 KB Output is correct
6 Correct 448 ms 113728 KB Output is correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5047 ms 160332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5025 ms 170428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5108 ms 178828 KB Time limit exceeded
2 Halted 0 ms 0 KB -