#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
struct bad {
int W,H;
ll dat[2500000];
void init(int _W, int _H) {
W = _W, H = _H;
memset(dat,0,sizeof dat);
}
ll get(int a, int b) { return dat[H*a+b]; }
void ad(int a, int b, ll val) { dat[H*a+b] += val; }
};
vector<vl> make(int a, int b) {
vector<vl> v(a); F0R(i,a) v[i].resize(b);
return v;
}
struct cum {
bad L, up, down;
int W,H;
void init(int _W, int _H) {
W = _W, H = _H;
L.init(W,H), up.init(W,H), down.init(W,H);
}
void prop() {
F0R(i,W) {
F0R(j,H) {
L.ad(i,j,down.get(i,j)+up.get(i,j));
if (i != W-1) {
up.ad(i+1,min(H-1,j+1),up.get(i,j));
down.ad(i+1,j-1,down.get(i,j));
}
}
}
F0R(i,W) F0Rd(j,H-1) L.ad(i,j,L.get(i,j+1));
}
};
cum c, cX;
int W,H,N;
vector<vl> res, ans;
vector<array<int,4>> todo;
pi trans(pi x) {
return {H-1-x.s,x.f};
}
void rot() {
vector<vl> RES = make(H,W);
F0R(i,W) F0R(j,H) {
pi x = trans({i,j});
RES[x.f][x.s] = res[i][j];
}
F0R(i,sz(todo)) {
pi x = trans({todo[i][0],todo[i][1]});
todo[i][0] = x.f, todo[i][1] = x.s;
}
swap(res,RES); swap(W,H);
}
void prop() {
c.prop(), cX.prop();
F0R(i,W) F0R(j,H) res[i][j] += c.L.get(i,j)+cX.L.get(i,j)*i;
}
void process(array<int,4> a) {
int mul = a[2]/a[3];
if (a[0]+1 < W) {
c.up.ad(a[0]+1,a[1],a[2]+a[0]*a[3]);
cX.up.ad(a[0]+1,a[1],-a[3]);
}
if (a[0]+mul+1 < W) {
c.up.ad(a[0]+1+mul,min(a[1]+mul,H-1),-(a[2]+a[0]*a[3]));
cX.up.ad(a[0]+1+mul,min(a[1]+mul,H-1),a[3]);
}
if (a[0]+1 < W && a[1]-2 >= 0) {
c.down.ad(a[0]+1,a[1]-2,-(a[2]+a[0]*a[3]));
cX.down.ad(a[0]+1,a[1]-2,a[3]);
}
if (a[0]+1+mul < W && a[1]-2-mul >= 0) {
c.down.ad(a[0]+1+mul,a[1]-2-mul,a[2]+a[0]*a[3]);
cX.down.ad(a[0]+1+mul,a[1]-2-mul,-a[3]);
}
}
void solve() {
c.init(W,H), cX.init(W,H);
for (auto a: todo) process(a);
prop();
}
ll query(int x1, int x2, int y1, int y2) {
return ans[x2][y2]-ans[x1-1][y2]-ans[x2][y1-1]+ans[x1-1][y1-1];
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> W >> H >> N;
res = make(W,H);
F0R(i,N) {
int x,y,a,b; // int x = rand() % W+1,y = rand() % H+1,a = rand() % 500+1,b = rand() % 50+1;
cin >> x >> y >> a >> b;
x--, y--;
res[x][y] += a;
todo.pb({x,y,a,b});
}
F0R(i,4) {
solve();
rot();
}
/*F0R(i,W) {
F0R(j,H) cout << res[i][j] << " ";
cout << "\n";
}*/
ans = make(W+1,H+1);
FOR(i,1,W+1) {
FOR(j,1,H+1) {
ans[i][j] = res[i-1][j-1]+ans[i-1][j]+ans[i][j-1]-ans[i-1][j-1];
}
}
int Q; cin >> Q;
F0R(i,Q) {
int x1,y1,x2,y2; cin >> x1 >> y1 >> x2 >> y2;
cout << (ll)round((ld)query(x1,x2,y1,y2)/(x2-x1+1)/(y2-y1+1)) << "\n";
}
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1098 ms |
366828 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1090 ms |
366828 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
573 ms |
366828 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
530 ms |
366828 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1094 ms |
381228 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
908 ms |
381228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
744 ms |
381228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
714 ms |
381228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1100 ms |
381228 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1090 ms |
381228 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1083 ms |
381228 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1046 ms |
381228 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
931 ms |
381228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
939 ms |
381228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
