competitive-programming/data_structure/bit2D.cpp at master · lincolncpp/competitive-programming · GitHub

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
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e3+3;
int bit[maxn+11][maxn+11];

void updatej(int i, int j, int x){
    while(j <= maxn){
        bit[i][j] += x;
        j += j&(-j);
    }
}

void update(int i, int j, int x){
    while(i <= maxn){
        updatej(i, j, x);
        i += i&(-i);
    }
}

int queryj(int i, int j){
    int res = 0;

    while(j > 0){
        res += bit[i][j];
        j -= j&(-j);
    }

    return res;
}

int query(int i, int j){
    int res = 0;

    while(i > 0){
        res += queryj(i, j);
        i -= i&(-i);
    }

    return res;
}

int query(int ai, int aj, int bi, int bj){
    return query(bi, bj) - query(bi, aj-1) - query(ai-1, bj) + query(ai-1, aj-1);
}

int main(){


    return 0;
}