计蒜客习题 矩形的周长并 线段树 线扫描 离散化

以前以为胡浩大神的点树我改成区间树 结果这题最后一个数据竟然爆了

以后还是老老实实用点树把

这饭真香

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define lson l , m , rt << 1
#define rson m+1 , r , rt << 1 | 1
const int maxn = 100005;
int X[maxn<<2];
struct Seg{
    int l , r , h , s;
    Seg() {}
    Seg(int a,int b,int c,int d):l(a) , r(b) , h(c) , s(d) {}
    bool operator < (const Seg &cmp) const {
    return h < cmp.h;
           }
}ss[maxn<<2];
bool lbd[maxn<<2] , rbd[maxn<<2];//记录边界是不是重合
int numseg[maxn<<2];//记录竖的边有几个
int cnt[maxn<<2];
int len[maxn<<2];
void PushUP(int rt,int l,int r) {
    if (cnt[rt]) {
            lbd[rt] = rbd[rt] = 1;
            len[rt] = X[r+1] - X[l] ;
            numseg[rt] = 2;
    } else if (l == r) {
        len[rt] = numseg[rt] = lbd[rt] = rbd[rt] = 0;
    } else {
            lbd[rt] = lbd[rt<<1];
            rbd[rt] = rbd[rt<<1|1];
            len[rt] = len[rt<<1] + len[rt<<1|1];
            numseg[rt] = numseg[rt<<1] + numseg[rt<<1|1];
    if (lbd[rt<<1|1] && rbd[rt<<1]) numseg[rt] -= 2;//两条线重合
        }
    }
int Bin(int key,int n,int X[]) {
           int l = 0 , r = n-1 ;
           while (l <= r) {
                  int m = (l + r) >> 1;
                  if (X[m] == key) return m;
                  if (X[m] < key) l = m + 1;
                  else r = m - 1;
           }
           return -1;
    }
void update(int L,int R,int c,int l,int r,int rt) {
    if (L <= l && r <= R) {
        cnt[rt] += c;
        PushUP(rt , l , r);
        return ;
    }
        int m = (l + r) >> 1;
    if (L <= m) update(L , R , c , lson);
    if (m < R) update(L , R , c , rson);
        PushUP(rt , l , r);
    }
int main() {
        int n;
    while (~scanf("%d",&n)) {
        int m = 0;
    for (int i = 0 ; i < n ; i ++) {
        int a , b , c , d;
        scanf("%d%d%d%d",&a,&b,&c,&d);
        X[m] = a;
        ss[m++] = Seg(a , c , b , 1);
        X[m] = c;
        ss[m++] = Seg(a , c , d , -1);
        }
        sort(X,X+m);
        sort(ss , ss + m);
        int k = 1;
        for (int i = 1 ; i < m ; i ++) {
                if (X[i] != X[i-1]) X[k++] = X[i];
                  }
                memset(cnt , 0 , sizeof(cnt));
                memset(len , 0 , sizeof(len));
                memset(numseg,0,sizeof(numseg));
        long long ret = 0 , last = 0;
    for (int i = 0 ; i < m ; i ++) {
            int l = Bin(ss[i].l , k , X);
            int r = Bin(ss[i].r , k , X)-1;
           if(l<=r)  update(l , r , ss[i].s , 0 , k-1 , 1);
        ret += 1LL*numseg[1] * (ss[i+1].h - ss[i].h);
        ret += abs(len[1] - last);
        last = len[1];
            }
        printf("%lld\n",ret);
    }
    return 0;
}