uva11992 Fast Matrix Operations

思路：看似一个二维矩阵值的更新，其实就是换成多条线段更新，线段树。

总共有3种操作：

1. 1 x1 y1 x2 y3 val(在满足(x,y)的点上＋val)

2. 2 x1 y1 x2 y2 val(把满足条件的点清空为val)

3. 3 x1 y1 x2 y3 查询区间值 sum min max。

因为有延迟标记，所以每次要down和up下，二维在down的时候还要先考虑区间是否被清空了的。

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2016
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
#define MEM(x,y) memset(x, y,sizeof x)
#define pk push_back
#define lson(x) ((x) << 1)
#define rson(x) ((x) << 1 | 1)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const double eps = 1e-10;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
struct Node {
    int Min, Max, Sum;
    int add, set;
    int l, r;
}p[maxn<<2],ans;
void up(int rt) {
    p[rt].Sum = p[lson(rt)].Sum + p[rson(rt)].Sum;
    p[rt].Max = max(p[lson(rt)].Max, p[rson(rt)].Max);
    p[rt].Min = min(p[lson(rt)].Min, p[rson(rt)].Min);
}
void build(int rt,int L,int R) {
    if ( L > R ) return ;
    p[rt].l = L, p[rt].r = R;
    if (L == R) {
        p[rt].Min = p[rt].Max = p[rt].Sum = 0;
        p[rt].add = 0;
        p[rt].set = -1;
        return ;
    }
    p[rt].set = -1;
    int mid = (L + R) >> 1;
    build(rt<<1, L, mid);
    build(rt<<1|1, mid+1, R);
    up(rt);
}
void down(int rt) {//every element add value.
    if (p[rt].set >= 0) {
        p[lson(rt)].add = 0;
        p[lson(rt)].set = p[rt].set;
        p[lson(rt)].Max = p[lson(rt)].Min = p[rt].set;
        p[lson(rt)].Sum = (p[lson(rt)].r - p[lson(rt)].l + 1)*p[rt].set;

        p[rson(rt)].add = 0;
        p[rson(rt)].set = p[rt].set;
        p[rson(rt)].Max = p[rson(rt)].Min = p[rt].set;
        p[rson(rt)].Sum = (p[rson(rt)].r - p[rson(rt)].l + 1)*p[rt].set;

        p[rt].set = -1;
    }

    if (p[rt].add > 0) {

        p[lson(rt)].add += p[rt].add;
        p[lson(rt)].Max += p[rt].add;
        p[lson(rt)].Min += p[rt].add;
        p[lson(rt)].Sum += (p[lson(rt)].r - p[lson(rt)].l + 1)*p[rt].add;

        p[rson(rt)].add += p[rt].add;
        p[rson(rt)].Max += p[rt].add;
        p[rson(rt)].Min += p[rt].add;
        p[rson(rt)].Sum += (p[rson(rt)].r - p[rson(rt)].l + 1)*p[rt].add;

        p[rt].add = 0;
    }
    return ;
}

void SegmentAdd(int rt,int L, int R,int val) {
    if (L <= p[rt].l && p[rt].r <= R) {
        p[rt].Sum += (p[rt].r - p[rt].l + 1)*val;
        p[rt].Max += val;
        p[rt].Min += val;
        p[rt].add += val;
        return ;
    }

    down(rt);
    int mid = (p[rt].l + p[rt].r) >> 1;

    if (L <= mid) SegmentAdd(lson(rt), L, R, val);
    if (R > mid) SegmentAdd(rson(rt), L, R, val);

    up(rt);
    return ;
}

void SegmentSet(int rt,int L,int R,int val) {
    if (L <= p[rt].l && p[rt].r <= R) {
        p[rt].add = 0;
        p[rt].Max = p[rt].Min = val;
        p[rt].Sum = (p[rt].r - p[rt].l + 1)*val;
        p[rt].set = val;
        return ;
    }
    down(rt);
    int mid = (p[rt].l + p[rt].r) >> 1;
    if (L <= mid) SegmentSet(lson(rt), L, R, val);
    if (R > mid) SegmentSet(rson(rt), L, R, val);
    up(rt);
    return ;
}

void Query(int rt,int L, int R) {
    if (L <= p[rt].l && p[rt].r <= R) {
        ans.Sum += p[rt].Sum;
        ans.Max = max(ans.Max, p[rt].Max);
        ans.Min = min(ans.Min, p[rt].Min);
        return ;
    }
    down(rt);
    int mid = (p[rt].l + p[rt].r) >> 1;
    if (L <= mid) Query(lson(rt), L, R);
    if (R > mid) Query(rson(rt), L, R);
    up(rt);
}

int main()
{    
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    int r, c, q;
    while(~scanf("%d%d%d",&r,&c,&q)) {
        build(1, 1, r*c);
        int op, x1,y1,x2,y2,val;
        while(q--) {
            scanf("%d",&op);
            if (op == 1) {
                scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&val);
                for (int i = x1 - 1;i < x2;++i) 
                    SegmentAdd(1,i*c + y1,i*c + y2,val);
            }
            if (op == 2) {
                scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&val);
                for (int i = x1 - 1;i < x2;++i)
                    SegmentSet(1, i*c + y1,i*c + y2,val);
            }
            if (op == 3) {
                scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                ans.Max = -INF, ans.Sum = 0, ans.Min = INF;
                int tot = 0;
                for (int i = x1 - 1;i < x2;++i)
                    Query(1, i*c + y1,i*c + y2);
                printf("%d %d %d\n", ans.Sum, ans.Min, ans.Max);
            }
        }
    }
    return 0;
}