题解 | 【模板】二维差分

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
#define int long long
#define db double
#define itn int
#define vi vector<int>
#define vs vector<string>
#define vvi vector<vector<int>>
#define vb vector<bool>
#define PII pair<int, int>
#define all(a) a.begin(), a.end()
#define ull unsigned long long
const int M = 2e3 + 7;
const int mod = 1e9 + 7;
const double pi = acos(-1.0);
int inf = -1e8;
int n, m, k, x, y;
string s;
int q;
int a[1010][1010];
int pre[1010][1010];
void solve()
{
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
            pre[i][j]=a[i][j]-a[i][j-1];
        }
    }
    while(q--)
    {
        int d,f,g,h;
        cin>>d>>f>>g>>h>>k;
        for(int i=d;i<=g;i++)
        {
            pre[i][f]+=k;
            pre[i][h+1]-=k;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            a[i][j]=pre[i][j]+pre[i][j-1];
            pre[i][j]+=pre[i][j-1];
            cout<<a[i][j]<<' ';
        }
        cout<<endl;
    }
    

}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int qwq = 1;
    // cin >> qwq;
    /*
    while (cin >> ws && cin.good())
    {
         solve();
    }
    */
    while (qwq--)
    {
        solve();
    }
    return 0;
}