oj.uz

Submission #564384

# Submission time Handle Problem Language Result Execution time Memory
564384 2022-05-19T05:26:48 Z piOOE Nuclearia (CEOI15_nuclearia) C++17
30 / 100
 853 ms 285112 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)
#define sz(x) ((int)size(x))
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

const int N = 200000;

int x[N], y[N], a[N], b[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int nn, mm, n;
    cin >> nn >> mm >> n;
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i] >> a[i] >> b[i];
        --x[i], --y[i];
    }
    vector<vector<ll>> v(nn, vector<ll>(mm)), pref(nn, vector<ll>(mm));
    if (n * nn * 1LL * mm <= 100000000) {
        for (int k = 0; k < n; ++k) {
            for (int i = 0; i < nn; ++i) {
                for (int j = 0; j < mm; ++j) {
                    v[i][j] += max(0ll, a[k] - b[k] * (ll) max(abs(i - x[k]), abs(j - y[k])));
                }
            }
        }
    } else if (nn == 1){
        vector<ll> added(mm + 1), bb(mm + 1);
        auto add = [&](int l, int r, int x, int y) {
            if (l > r) return;
            added[l] += x;
            bb[l + 1] += y;
            bb[r + 1] -= y * 1LL * (r - l);
            added[r + 1] -= x;
        };
        for (int i = 0; i < n; ++i) {
            int u = a[i] / b[i];
            int L = max(0, y[i] - u);
            add(L, y[i], a[i] - b[i] * u, b[i]);
            int R = min(mm - 1, y[i] + u);
            add(y[i] + 1, R, a[i] - b[i], -b[i]);
        }
        ll ad = 0;
        ll sum = 0;
        for (int i = 0; i < mm; ++i) {
            sum += added[i];
            ad += bb[i];
            sum += ad;
            v[0][i] = sum;
        }
    }
    for (int i = 0; i < nn; ++i) {
        for (int j = 0; j < mm; ++j) {
            pref[i][j] = v[i][j];
            if (i) pref[i][j] += pref[i - 1][j];
            if (j) pref[i][j] += pref[i][j - 1];
            if (i && j) pref[i][j] -= pref[i - 1][j - 1];
        }
    }
    auto get = [&pref](int x1, int y1, int x2, int y2) {
        ll ans = pref[x2][y2];
        if (x1) ans -= pref[x1 - 1][y2];
        if (y1) ans -= pref[x2][y1 - 1];
        if (x1 && y1) ans += pref[x1 - 1][y1 - 1];
        return ans;
    };
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        --x1, --y1, --x2, --y2;
        ll sum = get(x1, y1, x2, y2);
        ll S = (x2 - x1 + 1) * (ll) (y2 - y1 + 1);
        cout << (sum * 2 / S + 1) / 2 << '\n';
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 853 ms 274300 KB Output is correct
2 Correct 68 ms 4564 KB Output is correct
3 Correct 57 ms 3784 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 815 ms 274328 KB Output is correct
2 Correct 68 ms 4660 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 39864 KB Output is correct
2 Correct 56 ms 4384 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 40448 KB Output is correct
2 Correct 60 ms 4660 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 543 ms 280248 KB Output is correct
2 Correct 75 ms 5324 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 791 ms 115736 KB Output is correct
2 Correct 66 ms 4684 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 45496 KB Output is correct
2 Correct 70 ms 5008 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 523 ms 60916 KB Output is correct
2 Correct 59 ms 4300 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 469 ms 285112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 466 ms 285084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 187 ms 50836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 204 ms 50396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 187 ms 50572 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 50384 KB Output isn't correct
2 Halted 0 ms 0 KB -