hihocoder1699

链接：http://hihocoder.com/problemset/problem/1699

快毕业了的菜菜，做了个比赛，遇到四维偏序，调成了傻逼，所以记录下，看了下以前的傻逼代码，发现自己的cdq居然用sort

怪不得总是被卡常，然后就是套路cdq+cdq，这类题的坑点就是有相同的矩形

贴代码：

 #include <stdio.h>
 #include <algorithm>
 using namespace std;
 typedef long long LL;
 const LL N = 1e5 + ;
 const LL mod = 1e9 + ;

 struct Point {
     int x1, y1, x2, y2, partition, id;
     bool operator < (const Point &p) const {
         if(x1 != p.x1) return x1 < p.x1;
         if(y1 != p.y1) return y1 < p.y1;
         if(x2 != p.x2) return x2 > p.x2;
         if(y2 != p.y2) return y2 > p.y2;
         return id < p.id;
     }
 }p[N], o[N], tmp[N];

 int n, bit[N], lim, ret[N];

 void add(int x, int ad) {
     for(; x <= lim; x += x & -x) bit[x] += ad;
 }

 int ask(int x) {
     int sum = ;
     for(; x > ; x -= x & -x) sum += bit[x];
     return sum;
 }

 void cdq(int l, int r) {
     if(l == r) return;
     int mid = l + r >> ;
     cdq(l, mid); cdq(mid + , r);
     int i = l, j = mid + , cnt = l;
     while(i <= mid || j <= r) {
         if(i > mid) {
             if(o[j].partition) ret[o[j].id] += ask(lim) - ask(o[j].y2 - );
             tmp[cnt ++] = o[j ++];
         } else if(j > r) {
             if(!o[i].partition) add(o[i].y2, );
             tmp[cnt ++] = o[i ++];
         } else if(o[i].x2 >= o[j].x2) {
             if(!o[i].partition) add(o[i].y2, );
             tmp[cnt ++] = o[i ++];
         } else {
             if(o[j].partition) ret[o[j].id] += ask(lim) - ask(o[j].y2 - );
             tmp[cnt ++] = o[j ++];
         }
     }
     for(i = l; i <= mid; ++ i) if(!o[i].partition) add(o[i].y2, -);
     for(i = l; i <= r; ++ i) o[i] = tmp[i];
 }

 bool cmp(const Point &a, const Point &b) {
     if(a.y1 != b.y1) return a.y1 < b.y1;
     if(a.x2 != b.x2) return a.x2 > b.x2;
     if(a.y2 != b.y2) return a.y2 > b.y2;
     return a.id < b.id;
 }

 void solve(int l, int r) {
     if(l == r) return;
     int mid = l + r >> ;
     solve(l, mid); solve(mid + , r);
     int i = l, j = mid + , cnt = l - ;
     while(i <= mid || j <= r) {
         if(i > mid) o[++ cnt] = p[j ++], o[cnt].partition = ;
         else if(j > r) o[++ cnt] = p[i ++], o[cnt].partition = ;
         else if(cmp(p[i], p[j])) o[++ cnt] = p[i ++], o[cnt].partition = ;
         else o[++ cnt] = p[j ++], o[cnt].partition = ;
     }
     for(i = l; i <= r; ++ i) {
         p[i] = o[i];
     }
     cdq(l, r);
 }
 int main() {
     scanf("%d", &n);
     for(int i = ; i <= n; ++ i) {
         scanf("%d%d%d%d", &p[i].x1, &p[i].y1, &p[i].x2, &p[i].y2);
         bit[++ lim] = p[i].y2;
         p[i].id = i;
     }
     sort(bit + , bit +  + lim);
     lim = unique(bit + , bit +  + lim) - bit - ;
     for(int i = ; i <= n; ++ i) {
         p[i].y2 = lower_bound(bit + , bit +  + lim, p[i].y2) - bit;
     }
     for(int i = ; i <= lim; ++ i) bit[i] = ;
     sort(p + , p +  + n);
     solve(, n);
     sort(p + , p +  + n);
     for(int i = n - ; i > ; -- i) {
        if(p[i].x1 == p[i + ].x1 && p[i].y1 == p[i + ].y1)
           if(p[i].x2 == p[i + ].x2 && p[i].y2 == p[i + ].y2)
               ret[p[i].id] = ret[p[i+].id];
     }
     for(int i = ; i <= n; ++ i) printf("%d\n", ret[i]);
     return ;
 }