#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3000005;
typedef long long ll;
vector<vector<ll>> d1, d2;
vector<vector<ll>> offC, slC, offSlC, slSlC;
ll sm[MAXN], sl[MAXN], off[MAXN];
int w, h, n, q;
int get(int y, int x) {
return y * w + x;
}
int main() {
scanf("%d %d %d", &w, &h, &n);
d1.resize(h+3), d2.resize(h+3), offC.resize(h+3), slC.resize(h+3);
offSlC.resize(h+3), slSlC.resize(h+3);
for (int i = 0; i <= h+2; i++) {
d1[i].resize(w+3), d2[i].resize(w+3);
offC[i].resize(w+3), slC[i].resize(w+3);
offSlC[i].resize(w+3), slSlC[i].resize(w+3);
}
for (int i = 0; i < n; i++) {
ll x, y, a, b;
scanf("%lld %lld %lld %lld", &x, &y, &a, &b);
ll l = max(1ll, x - a / b), r = min((ll)w, x + a / b);
ll c = max(1ll, y - a / b), d = min((ll)h, y + a / b);
ll loc = x - abs(y-c), hic = x + abs(y-c);
ll lod = x - abs(y-d), hid = x + abs(y-d);
if (loc < 1ll) {
d1[y-x+1][2] -= b;
offSlC[c][2] -= b;
offSlC[c][l] -= b;
offSlC[c][l+1] += b;
offSlC[y-x+1][2] += b;
offSlC[y-x+1][l] += b;
offSlC[y-x+1][l+1] -= b;
slSlC[y-x+1][l] -= b;
slSlC[y-x+1][l+1] += b;
} else {
d1[c][loc+1] -= b;
slSlC[c][l] -= loc * b;
slSlC[c][l+1] += loc * b;
slSlC[c+1][l] += loc * b - b;
slSlC[c+1][l+1] -= loc * b - b;
}
if (lod < 1ll) {
d2[x+y-1][2] -= b;
offSlC[x+y][2] -= b;
offSlC[x+y][l] -= b;
offSlC[x+y][l+1] += b;
offSlC[d+1][2] += b;
offSlC[d+1][l] += b;
offSlC[d+1][l+1] -= b;
slSlC[x+y+1][l] -= b;
slSlC[x+y+1][l+1] += b;
} else {
d2[d][lod+1] -= b;
slSlC[d+1][l] += lod * b - b;
slSlC[d+1][l+1] -= lod * b - b;
slSlC[d+2][l] -= lod * b;
slSlC[d+2][l+1] += lod * b;
}
if (hid > (ll)w) {
offSlC[w+y-x+1][r+1] -= b * w;
offSlC[w+y-x+1][r+2] += b * w;
offSlC[d+1][r+1] += b * w;
offSlC[d+1][r+2] -= b * w;
slSlC[w+y-x+1][r+1] += (ll)w * b + b;
slSlC[w+y-x+1][r+2] -= (ll)w * b + b;
slSlC[w+y-x+2][r+1] -= (ll)w * b;
slSlC[w+y-x+2][r+2] += (ll)w * b;
} else {
d1[d+1][hid+2] += b;
slSlC[d+1][r+1] += hid * b + b;
slSlC[d+1][r+2] -= hid * b + b;
slSlC[d+2][r+1] -= hid * b;
slSlC[d+2][r+2] += hid * b;
}
if (hic > (ll)w) {
offSlC[c][r+1] -= b * w;
offSlC[c][r+2] += b * w;
offSlC[x+y-w][r+1] += b * w;
offSlC[x+y-w][r+2] -= b * w;
slSlC[x+y-w][r+1] -= (ll)w * b;
slSlC[x+y-w][r+2] += (ll)w * b;
slSlC[x+y-w+1][r+1] += (ll)w*b + b;
slSlC[x+y-w+1][r+2] -= (ll)w*b + b;
} else {
d2[c-1][hic+2] += b;
slSlC[c][r+1] -= hic * b;
slSlC[c][r+2] += hic * b;
slSlC[c+1][r+1] += hic * b + b;
slSlC[c+1][r+2] -= hic * b + b;
}
slSlC[y+1][l] += 2 * b;
slSlC[y+1][l+1] -= 2 * b;
slSlC[y+1][r+1] -= 2 * b;
slSlC[y+1][r+2] += 2 * b;
offC[c][l] += a;
offC[c][r+1] -= a;
offC[d+1][l] -= a;
offC[d+1][r+1] += a;
slC[c][l] -= (hic - x) * b;
slC[c][r+1] += (hic - x) * b;
slC[c+1][l] += (hic - x) * b + b;
slC[c+1][r+1] -= (hic - x) * b + b;
slC[y+1][l] -= 2 * b;
slC[y+1][r+1] += 2 * b;
slC[d+1][l] += (hid - x) * b + b;
slC[d+1][r+1] -= (hid - x) * b + b;
slC[d+2][l] -= (hid - x) * b;
slC[d+2][r+1] += (hid - x) * b;
offSlC[c][l] += b * l;
offSlC[c][l+1] -= b * (l-1);
offSlC[c][r+1] += b * (r+1);
offSlC[c][r+2] -= b * r;
offSlC[d+1][l] -= b * l;
offSlC[d+1][l+1] += b * (l-1);
offSlC[d+1][r+1] -= b * (r+1);
offSlC[d+1][r+2] += b * r;
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
slC[i][j] += slC[i-1][j];
slSlC[i][j] += slSlC[i-1][j];
d1[i][j] += d1[i-1][j-1];
offC[i][j] += offC[i-1][j];
offSlC[i][j] += offSlC[i-1][j];
}
}
for (int i = h-1; i > 0; i--)
for (int j = 1; j <= w; j++)
d2[i][j] += d2[i+1][j-1];
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
slC[i][j] += slC[i-1][j];
slSlC[i][j] += slSlC[i-1][j];
}
for (int j = 1; j <= w; j++) {
sl[j] = d1[i][j] + d2[i][j] + offSlC[i][j] + slSlC[i][j];
sl[j] += sl[j-1];
off[j] = offC[i][j] + slC[i][j];
off[j] += off[j-1];
}
for (int j = 1; j <= w; j++) {
sl[j] += sl[j-1];
sm[get(i,j)] = sm[get(i-1,j)] + sm[get(i,j-1)] - sm[get(i-1,j-1)] + sl[j] + off[j];
}
for (int j = 1; j <= w; j++)
sl[j] = off[j] = 0;
}
scanf("%d", &q);
while (q--) {
ll x1, y1, x2, y2;
scanf("%lld %lld %lld %lld", &x1, &y1, &x2, &y2);
ll ans = sm[get(y2,x2)] - sm[get(y1-1,x2)] - sm[get(y2,x1-1)] + sm[get(y1-1,x1-1)];
x1 = (x2-x1+1) * (y2-y1+1);
if ((ans % x1) * 2 >= x1)
printf("%lld\n", ans / x1 + 1);
else
printf("%lld\n", ans / x1);
}
return 0;
}
Compilation message
nuclearia.cpp: In function 'int main()':
nuclearia.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &w, &h, &n);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
nuclearia.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld %lld", &x, &y, &a, &b);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nuclearia.cpp:154:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
~~~~~^~~~~~~~~~
nuclearia.cpp:157:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld %lld", &x1, &y1, &x2, &y2);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1128 ms |
1006628 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1126 ms |
1010112 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
163 ms |
138252 KB |
Output is correct |
| 2 |
Correct |
96 ms |
4344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
339 ms |
178404 KB |
Output is correct |
| 2 |
Correct |
99 ms |
4728 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1131 ms |
1010128 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
370 ms |
217540 KB |
Output is correct |
| 2 |
Correct |
99 ms |
4728 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
311 ms |
144624 KB |
Output is correct |
| 2 |
Correct |
103 ms |
4984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
282 ms |
139128 KB |
Output is correct |
| 2 |
Correct |
101 ms |
4344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1146 ms |
844436 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1141 ms |
798956 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
570 ms |
144888 KB |
Output is correct |
| 2 |
Correct |
575 ms |
144760 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
569 ms |
147376 KB |
Output is correct |
| 2 |
Correct |
575 ms |
145268 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
598 ms |
152404 KB |
Output is correct |
| 2 |
Correct |
452 ms |
145528 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
456 ms |
147292 KB |
Output is correct |
| 2 |
Execution timed out |
1133 ms |
885368 KB |
Time limit exceeded |
