14.antisun2.cpp

#include<iostream>
using namespace std;
const int N = 1010;
int a[N][N], b[N][N];

int main()
{
	int n, m, q;	cin >> n >> m >> q;
	a[0][0] = 0, b[0][0] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++)
			cin >> a[i][j];
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++)
			b[i][j] = a[i][j] - a[i][j - 1] - a[i - 1][j] + a[i - 1][j - 1];
	}
	while(q--){
		int x1, y1, x2, y2, c;	cin >> x1 >> y1 >> x2 >> y2 >> c;
		b[x1][y1] += c;
		b[x1][y2 + 1] -= c;
		b[x2 + 1][y1] -= c;
		b[x2 + 1][y2 + 1] += c;
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++)
			a[i][j] = a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1] + b[i][j]; 
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}