oj.uz

Submission #564397

# Submission time Handle Problem Language Result Execution time Memory
564397 2022-05-19T05:55:38 Z piOOE Nuclearia (CEOI15_nuclearia) C++17
55 / 100
 1000 ms 84164 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 >> mm >> nn >> n;
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i] >> a[i] >> b[i];
        swap(x[i], y[i]);
        --x[i], --y[i];
    }
    vector<vector<ll>> v(nn, vector<ll>(mm)), pref(nn, vector<ll>(mm));
    if (nn == 1) {
        vector<ll> added(mm + 1), bb(mm + 1);
        auto add = [&](int l, int r, ll x, ll y) {
            if (l > r) return;
            added[l] += x;
            bb[l + 1] += y;
            bb[r + 1] -= y;
            added[r + 1] -= x + y * (r - l);
        };
        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] * 1LL * (y[i] - L), 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;
        ll gg = 0;
        for (int i = 0; i < mm; ++i) {
            sum += added[i];
            ad += bb[i];
            gg += ad;
            v[0][i] = gg + sum;
        }
    } else 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])));
                }
            }
        }
    }
    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;
        swap(x1, y1);
        swap(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 62 ms 78552 KB Output is correct
2 Correct 72 ms 2652 KB Output is correct
3 Correct 53 ms 2244 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 78648 KB Output is correct
2 Correct 55 ms 2636 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 39508 KB Output is correct
2 Correct 56 ms 2728 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 49268 KB Output is correct
2 Correct 79 ms 2680 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 80716 KB Output is correct
2 Correct 58 ms 2892 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 33992 KB Output is correct
2 Correct 76 ms 2652 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 42168 KB Output is correct
2 Correct 59 ms 2984 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 22216 KB Output is correct
2 Correct 81 ms 2668 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 84164 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 84056 KB Output is correct

Subtask #11
0 / 15.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 12.0

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

Subtask #14
0 / 8.0

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