小码匠的信息学江湖:【模板】二维树状数组 2：区间修改，单点查询

2 2
1 1 1 3
1 2 2 4
2 1 1 2 2

7

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>

using namespace std;
#define endl '\n';
typedef long long LL;

struct node {
    LL w, d;
};

struct FenwickTree {
    vector<vector<LL>> c;
    int n, m;

    FenwickTree(int l, int m) :
            n(l), c(l + 1, vector<LL>(m + 1)), m(m) {}

    int lowbit(int a) {
        return (-a) & a;
    }

    LL cnt(int x, int y) {
        LL ans = 0;
        for (int i = x; i > 0; i -= lowbit(i)) {
            for (int j = y; j > 0; j -= lowbit(j)) {
                ans += c[i][j];
            }
        }
        return ans;
    }

    void add(int x, int y, LL w) {
        for (int i = x; i <= n; i += lowbit(i)) {
            for (int j = y; j <= m; j += lowbit(j)) {
                c[i][j] += w;
            }
        }
    }

    LL ask(int x1, int y1, int x2, int y2) {
        return cnt(x2, y2) - cnt(x2, y1 - 1) - cnt(x1 - 1, y2) + cnt(x1 - 1, y1 - 1);
    }
};

void best_coder() {
    int n, m;
    scanf("%d%d", &n, &m);
    FenwickTree ft(n, m);
    int a;
    while (~scanf("%d", &a)) {
        if (a == 1) {
            int x1, y1, x2, y2;
            LL w;
            scanf("%d%d%d%d%lld", &x1, &y1, &x2, &y2, &w);
            ft.add(x1, y1, w);
            ft.add(x1, y2 + 1, -w);
            ft.add(x2 + 1, y1, -w);
            ft.add(x2 + 1, y2 + 1, w);
        } else {
            int x, y;
            scanf("%d%d", &x, &y);
            printf("%lld\n", ft.cnt(x, y));
        }
    }
}

void happy_coder() {

}

int main() {
    // 提升cin、cout效率
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    // freopen("xxx.in", "r", stdin);
    // freopen("xxx.out", "w", stdout);

    // 小码匠
    best_coder();

    // 最优解
    // happy_coder();

    // fclose(stdin);
    // fclose(stdout);

    return 0;
}