[BOI 2007] 摩基亚Mokia【CDQ分治求三维偏序】

题目链接

---

  因为是有修改操作的求三维偏序，所以在这里我们不能简单的使用树状数组之类的二叉搜索树来解决这类问题。

  这里就是用到了cdq分治来进行降维的操作，我们首先对一维偏序的x进行升序排列，然后再对二维偏序的y（先留一下），最后我们用cdq的方式进行对时间戳的分治。

  cdq分治的过程：

1. 先对一维偏序进行排序；
2. 对时间戳（二维偏序）进行分治，前面分治的左边时间会对右边的时间戳造成对应的贡献，这时候需要把前面的加到后面去，并且需要对操作的树状数组y（三维偏序）进行清除clear操作；
3. 对于y，我们把它放进树状数组中即可，作为二维偏序。

void cdq(int l, int r)
{
    if(l >= r) return;
    int mid = HalF, ql = l, qr = mid + 1;
    for(int i=l; i<=r; i++)  //对时间戳进行分治
    {
        if(q[i].itself <= mid) cop[ql++] = q[i];
        else cop[qr++] = q[i];
    }
    for(int i=l; i<=r; i++) q[i] = cop[i];  //去get到这段[l,r]的对应查询
    int i, j = l;
    for(i = mid + 1; i <= r; i++)  //右区间会产生贡献
    {
        if(q[i].type == 2)  //现在要去求贡献的时候
        {
            for(; j <= mid && q[j].x <= q[i].x; j++)  //左区间的x是升序的、右区间的x也是升序的，但是不能说左右合并的x是升序的
            {
                if(q[j].type == 1)  //如果是更新操作
                {
                    update(q[j].y, q[j].val);
                }
            }
            ans[q[i].id] += q[i].val * query(q[i].y);  //val代表了是加还是减去
        }
    }
    for(i = l; i < j; i++) if(q[i].type == 1) update(q[i].y, -q[i].val); //去除掉左边的产生的贡献，进入下一层递归
    cdq(l, mid); cdq(mid + 1, r);
}

 

然后是完整的Code。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e6 + 7;
int W, cnt_q = 0, cnt = 0, ans[maxN] = {0};
struct Question
{
    int type, x, y, val, id, itself;
    Question(int _t = 0, int _x = 0, int _y = 0, int _v = 0, int _i = 0, int _it = 0):type(_t), x(_x), y(_y), val(_v), id(_i), itself(_it) {}
    friend bool operator < (Question e1, Question e2) { return e1.x == e2.x ? e1.y < e2.y : e1.x < e2.x; }
}q[maxN], cop[maxN];
int trie[maxN];
inline void update(int x, int val)
{
    while(x <= W)
    {
        trie[x] += val;
        x += lowbit(x);
    }
}
inline int query(int x)
{
    int sum = 0;
    while(x)
    {
        sum += trie[x];
        x -= lowbit(x);
    }
    return sum;
}
void cdq(int l, int r)
{
    if(l >= r) return;
    int mid = HalF, ql = l, qr = mid + 1;
    for(int i=l; i<=r; i++)
    {
        if(q[i].itself <= mid) cop[ql++] = q[i];
        else cop[qr++] = q[i];
    }
    for(int i=l; i<=r; i++) q[i] = cop[i];
    int i, j = l;
    for(i = mid + 1; i <= r; i++)
    {
        if(q[i].type == 2)
        {
            for(; j <= mid && q[j].x <= q[i].x; j++)
            {
                if(q[j].type == 1)
                {
                    update(q[j].y, q[j].val);
                }
            }
            ans[q[i].id] += q[i].val * query(q[i].y);
        }
    }
    for(i = l; i < j; i++) if(q[i].type == 1) update(q[i].y, -q[i].val);
    cdq(l, mid); cdq(mid + 1, r);
}
int main()
{
//    freopen("mokia.in", "r", stdin);
//    freopen("mokia.out","w", stdout);
    int op, x1, y1, x2, y2, val;
    scanf("0 %d", &W); W++;
    while(true)
    {
        scanf("%d", &op);
        if(op == 1)
        {
            scanf("%d%d%d", &x1, &y1, &val);    ++cnt;
            x1++; y1++;
            q[cnt] = Question(1, x1, y1, val, 0, cnt);
        }
        else if(op == 2)
        {
            scanf("%d%d%d%d", &x1, &y1, &x2, &y2);  ++cnt; x1++; y1++; x2++; y2++;
            q[cnt] = Question(2, x1 - 1, y1 - 1, 1, ++cnt_q, cnt);   ++cnt;
            q[cnt] = Question(2, x1 - 1, y2, -1, cnt_q, cnt);    ++cnt;
            q[cnt] = Question(2, x2, y1 - 1, -1, cnt_q, cnt);    ++cnt;
            q[cnt] = Question(2, x2, y2, 1, cnt_q, cnt);
        }
        else break;
    }
    sort(q + 1, q + cnt + 1);
    cdq(1, cnt);
    for(int i=1; i<=cnt_q; i++) printf("%d\n", ans[i]);
    return 0;
}
/*
0 4
1 2 3 3
2 1 1 3 3
1 2 2 2
2 2 2 3 4
3
*/