bzoj1176: [Balkan2007]Mokia【cdq分治】

　　把询问搞成4个，cdq分治。

 #include <bits/stdc++.h>
 #define rep(i, a, b) for (int i = a;i <= b; i++)
 #define drep(i, a, b) for (int i = a; i >= b; i--)
 #define REP(i, a, b) for (int i = a; i < b; i++)
 #define mp make_pair
 #define pb push_back
 #define clr(x) memset(x, 0, sizeof(x))
 #define xx first
 #define yy second
 using namespace std;
 typedef long long i64;
 typedef pair<int, int> pii;
 const int inf = ~0U >> ;
 const i64 INF = ~0ULL >> ;
 //**********************************

 const int maxn = ;

 int c[], w;
 struct Complex {
     int flag;
     int x, y, c;
     int id, ans;
     int pos, l;
     inline bool operator < (const Complex &a) const {
         return x < a.x ||
             x == a.x && y < a.y ||
             x == a.x && y == a.y && c < a.c;
     }
 } src[maxn], t[maxn];

 inline void add(int x, int v) {
     while (x <= w) {
         c[x] += v;
         x += x & -x;
     }
 }
 inline int get(int x) {
     int ret();
     while (x > ) {
         ret += c[x];
         x -= x & -x;
     }
     return ret;
 }
 int ans[];

 void cdq(int l, int r) {
     if (l == r) return;
     int mid = l + r >> , l1 = l, l2 = mid + ;
     rep(i, l, r) {
         if (src[i].id <= mid && !src[i].l) add(src[i].y, src[i].c);
         if (src[i].id > mid && src[i].l) ans[src[i].pos] += src[i].l * get(src[i].y);
     }
     rep(i, l, r) if (src[i].id <= mid && !src[i].l) add(src[i].y, -src[i].c);
     rep(i, l, r) if (src[i].id <= mid) t[l1++] = src[i]; else t[l2++] = src[i];
     memcpy(src + l, t + l, (r - l + ) * sizeof(Complex));
     cdq(l, mid); cdq(mid + , r);
 }

 int main() {
     int cnt(), n(), s;
     scanf("%d%d", &s, &w);
     int flag;
     while (scanf("%d", &flag), flag ^ ) {
         if (flag == ) {
             ++n;
             src[n].id = n; src[n].l = ; src[n].pos = ;
             scanf("%d%d%d", &src[n].x, &src[n].y, &src[n].c);
         }
         else {
             int x, y, a, b; scanf("%d%d%d%d", &x, &y, &a, &b);

             ans[++cnt] = s * (a - x) * (b - y);

             ++n;
             src[n].id = n; src[n].l = ; src[n].pos = cnt;
             src[n].x = a, src[n].y = b, src[n].c = inf;

             ++n;
             src[n].id = n; src[n].l = -; src[n].pos = cnt;
             src[n].x = a, src[n].y = y - , src[n].c = inf;

             ++n;
             src[n].id = n; src[n].l = -; src[n].pos = cnt;
             src[n].x = x - , src[n].y = b, src[n].c = inf;

             ++n;
             src[n].id = n; src[n].l = ; src[n].pos = cnt;
             src[n].x = x - , src[n].y = y - , src[n].c = inf;
         }
     }
     sort(src + , src + n + );
     cdq(, n);
     rep(i, , cnt) printf("%d\n", ans[i]);
     return ;
 }