1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
| #include<bits/stdc++.h> using namespace std;
int n,m,q; const int N=1005; int diff[N][N],sum[N][N];
void insert(int x1,int y1,int x2,int y2,int c){ diff[x1][y1]+=c; diff[x1][y2+1]-=c; diff[x2+1][y1]-=c; diff[x2+1][y2+1]+=c; }
void work(){ cin>>n>>m>>q; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){ int a; cin>>a; insert(i,j,i,j,a); }
while(q--){ int x1,y1,x2,y2,c; cin>>x1>>y1>>x2>>y2>>c;
insert(x1,y1,x2,y2,c); }
for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ sum[i][j]=diff[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]; cout<<sum[i][j]<<" "; } cout<<endl; } }
int main(){ work(); return 0; }
|