急速ac板子
#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N][N],b[N][N];
int main()
{
int n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
while(k--)
{
int x1,x2,y1,y2,c;
cin>>x1>>y1>>x2>>y2>>c;
b[x1][y1]+=c;
b[x2+1][y1]-=c;
b[x1][y2+1]-=c;
b[x2+1][y2+1]+=c;
}
for(int i=1;i<=n;i++,puts(""))
for(int j=1;j<=m;j++)
{
b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1];
cout<<a[i][j]+b[i][j]<<' ';
}
return 0;
}
#include <iostream>
using namespace std;
const int N=1005;
int a[N][N],b[N][N],n,m,x,y,u,v,c;
int main()
{
cin>>n>>m>>c;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
while(cin>>u>>v>>x>>y>>c)x++,y++,b[x][y]+=c,b[x][v]-=c,b[u][y]-=c,b[u][v]+=c;
for(int i=1;i<=n;i++,puts(""))
for(int j=1;j<=m;j++)
b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1],cout<<a[i][j]+b[i][j]<<' ';
}