Submission #1022330

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022330		vjudge1	Nuclearia (CEOI15_nuclearia)	C++14	26 / 100	1065 ms	276564 KiB

nuclearia

#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAX_N = 200005;
const int MOD = 998244353;

vector<vector<int>>grid, pref;

void solve() {
    int w, h;
    cin >> w >> h;
    grid.assign(w, vector<int>(h, 0));
    pref.assign(w, vector<int>(h, 0));
    int n;
    cin >> n;
    for(int i=0; i<n; ++i) {
        int x, y, a, b;
        cin >> x >> y >> a >> b;
        --x, --y;
        int cnt = a/b;
        for(int j=max(0LL, x-cnt); j<=min(w-1, x+cnt); ++j) {
            for(int k=max(0LL, y-cnt); k<=min(h-1, y+cnt); ++k) {
                grid[j][k] += max(0LL,a - b * max(abs(k-y), abs(j-x)));
            }
        }
    }
    for(int i=w-1; i>=0; --i) {
        for(int j=h-1; j>=0; --j) {
            pref[i][j] = grid[i][j];
            if(j+1<h) pref[i][j] += pref[i][j+1];
            if(i+1<w) pref[i][j] += pref[i+1][j];
            if(i+1<w && j+1<h) pref[i][j] -= pref[i+1][j+1];
        }
    }
    int q;
    cin >> q;
    while(q--) {
        long double x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        --x1, --y1, --x2, --y2;
        long double sum = pref[x1][y1];
        if(x2+1<w) sum -= pref[x2+1][y1];
        if(y2+1<h) sum -= pref[x1][y2+1];
        if(x2+1<w && y2+1<h) sum += pref[x2+1][y2+1];
        long double x = sum/((x2-x1+1)*(y2-y1+1));
        cout << lround(x) << endl;
    }
}

signed main() {
    int t = 1;
    while(t--) solve();

    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 2 / 2
• Subtask 3: 3 / 3
• Subtask 4: 2 / 2
• Subtask 5: 6 / 6
• Subtask 6: 0 / 4
• Subtask 7: 6 / 6
• Subtask 8: 4 / 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