oj.uz

Submission #1042655

# Submission time Handle Problem Language Result Execution time Memory
1042655 2024-08-03T09:05:07 Z gyg Pyramid Base (IOI08_pyramid_base) C++17
27 / 100
 5000 ms 123068 KB 
#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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 88412 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 88408 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 88400 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 88632 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 88908 KB Output is correct
2 Correct 523 ms 88916 KB Output is correct
3 Correct 999 ms 88916 KB Output is correct

Subtask #9
0 / 7.0

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

Subtask #10
0 / 7.0

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

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5068 ms 107812 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 5053 ms 115492 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 5040 ms 123068 KB Time limit exceeded
2 Halted 0 ms 0 KB -