Submission #445934

#	Time	Username	Problem	Language	Result	Execution time	Memory
445934		snasibov05	Nuclearia (CEOI15_nuclearia)	C++14	0 / 100	1109 ms	276796 KiB

nuclearia

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>

using namespace std;

#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define oo 1000000000

int main() {
    int w, h; cin >> w >> h;
    int n; cin >> n;
    vector<vector<ll>> rad(w+1, vector<ll>(h+1));
    for (int i = 0; i < n; ++i) {
        int x, y, a, b; cin >> x >> y >> a >> b;

        for (int j = 1; j <= w; ++j) {
            for (int k = 1; k <= h; ++k) {
                rad[j][k] += 1ll * max(0ll, 1ll * a - 1ll * b * max(abs(j - x), abs(k - y)));
            }
        }
    }

    vector<vector<ll>> pref(w+1, vector<ll>(h+1));
    for (int i = 1; i <= w; ++i) {
        for (int j = 1; j <= h; ++j) {
            pref[i][j] = pref[i-1][j] + pref[i][j-1] - pref[i-1][j-1] + rad[i][j];
        }
    }

    int q; cin >> q;
    for (int i = 0; i < q; ++i) {
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        ll cur = pref[x2][y2] - pref[x2][y1 - 1] - pref[x1 - 1][y2] + pref[x1 - 1][y1 - 1];
        ll cnt = (x2 - x1 + 1) * (y2 - y1 + 1);
        cerr << cur << " " << cnt << "\n";
        ll res = cur / cnt;

        if (cur % cnt >= (ll)ceil(cnt / 2)) res++;

        cout << res << "\n";
    }

    return 0;
}

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