ZOJ - 3284 Matrix Processing 线段树区间更新查询

矩阵转化为一维矩阵，进行区间更新和查询

板子== 白书上的

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 10000 + 7, maxd = (1<<18)-1, mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, m, q, N;
int mp[111][111];
int data1[maxd], datb1[maxd], data2[maxd], datb2[maxd];

struct node1 {
    int l_, r_;
    int v;
}rr[maxn*10], cc[maxn*10];


void init() {
    N = n * m + 1;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) {
            scanf("%d", &mp[i][j]);
        }
    }
    memset(data1, 0, sizeof data1);
    memset(data2, 0, sizeof data2);
    memset(datb1, 0, sizeof datb1);
    memset(datb2, 0, sizeof datb2);
}


void add1(int a, int b, int x, int k, int l, int r) {
    if(a <= l && r <= b) {
        data1[k] += x;
    }
    else if(l < b && a < r) {
        datb1[k] += (min(b,r) - max(a,l)) * x;
        add1(a, b, x, k*2+1, l, (l+r)/2);
        add1(a, b, x, k*2+2, (l+r)/2, r);
    }
}

void add2(int a, int b, int x, int k, int l, int r) {
    if(a <= l && r <= b) {
        data2[k] += x;
    }
    else if(l < b && a < r) {
        datb2[k] += (min(b,r) - max(a,l)) * x;
        add2(a, b, x, k*2+1, l, (l+r)/2);
        add2(a, b, x, k*2+2, (l+r)/2, r);
    }
}

int sum1(int a, int b, int k, int l, int r) {
    if(b <= l || r <= a) {
        return 0;
    }
    else if(a <= l && r <= b) {
        return data1[k] * (r-l) + datb1[k];
    }
    else {
        int res = (min(b,r) - max(a,l)) * data1[k];
        res += sum1(a, b, k*2+1, l, (l+r)/2);
        res += sum1(a, b, k*2+2, (l+r)/2, r);
        return res;
    }
}

int sum2(int a, int b, int k, int l, int r) {
    if(b <= l || r <= a) {
        return 0;
    }
    else if(a <= l && r <= b) {
        return data2[k] * (r-l) + datb2[k];
    }
    else {
        int res = (min(b,r) - max(a,l)) * data2[k];
        res += sum2(a, b, k*2+1, l, (l+r)/2);
        res += sum2(a, b, k*2+2, (l+r)/2, r);
        return res;
    }
}

void solve() {

    scanf("%d", &q);
    int cnt1 = 0, cnt2 = 0;
    while(q--) {
        int d, r1, c1, r2, c2, k;
        scanf("%d", &d);
        if(d == 0) {
            scanf("%d %d %d %d %d", &r1, &c1, &r2, &c2, &k); // °´ÐÐ
            int t1 = (r1-1)*m + c1, t2 = (r2-1)*m + c2;
            rr[cnt1].l_ = t1, rr[cnt1].r_ = t2, rr[cnt1++].v = k;
            add1(t1, t2+1, k, 0, 0, N);
        }
        else if(d == 1) {
            scanf("%d %d %d %d %d", &r1, &c1, &r2, &c2, &k); // °´ÁÐ
            int t1 = (c1-1)*n + r1, t2 = (c2-1)*n + r2;
            cc[cnt2].l_ = t1, cc[cnt2].r_ = t2, cc[cnt2++].v = k;
            add2(t1, t2+1, k, 0, 0, N);
        }
        else {
            scanf("%d %d", &r1, &c1);
            int t1 = (r1-1)*m + c1;
            int t2 = (c1-1)*n + r1;
            int ans1 = 0, ans2 = 0;
            ans1 = sum1(t1, t1+1, 0, 0, N);
            ans2 = sum2(t2, t2+1, 0, 0, N);
            printf("%d\n", mp[r1][c1] + ans1 + ans2);
        }
    }
}

int main() {

    int kase = 1;
    while(~scanf("%d %d", &n, &m) && n+m ) {
        init();
        printf("Case %d\n", kase++);
        solve();
    }

    return 0;
}