E - Divide Square（二维坐标系被分割成几部分）

#include<bits/stdc++.h>
using namespace std;
#define lson root<<1,l,midd
#define rson root<<1|1,midd+1,r
#define pb push_back
#define ull unsigned long long
#define pii pair<int,int>
#define MP make_pair
typedef long long ll;
const ll INF=1e18;
const int inf=0x3f3f3f3f;
const int M=1e6+6;
ll tr[M];
vector<pii >a[M],b[M];
void add(int x,int c){
    while(x<=1e6){
        tr[x]+=c;
        x+=x&(-x);
    }
}
ll sum(int x){
    ll res=0;
    while(x){
        res+=tr[x];
        x-=x&(-x);
    }
    return res;
}
int main(){
    int n,m;
    ll ans=1;
    scanf("%d%d",&n,&m);
    for(int y,x1,x2,i=1;i<=n;i++){
        scanf("%d%d%d",&y,&x1,&x2);
        a[x1].pb(MP(y,1));
        a[x2+1].pb(MP(y,-1));
        if(x1==0&&x2==1e6)
            ans++;
    }
    for(int x,y1,y2,i=1;i<=m;i++){
        scanf("%d%d%d",&x,&y1,&y2);
        b[x].pb(MP(y1,y2));
        if(y1==0&&y2==1e6)
            ans++;
    }
    for(int i=0;i<=1e6;i++){
        for(auto it:a[i])
            add(it.first,it.second);
        for(auto it:b[i]){
            ll tmp1=sum(it.second);
            int l=it.first;
            ll tmp2;
            if(l==0)
                tmp2=0;
            else
                tmp2=sum(l-1);
            ans+=tmp1-tmp2;
        }
    }
    printf("%lld\n",ans);
    return 0;
}