因为给的数值比较大
所以要离散化
然后倒着来
用线段树来维护
看有没有新的点需要改
AC代码:
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
typedef long long ll;
vector<int> V;
const int N=1e5;
struct Plant{
int x,y,idx,idy;
}A[N];
struct SegmentTree{
int l,r,add,val;
#define l(x) Tree[x].l
#define r(x) Tree[x].r
#define add(x) Tree[x].add
#define val(x) Tree[x].val
}Tree[N*4];
void build(int p,int l,int r){
l(p)=l;r(p)=r;
if(l==r) return;
int mid=(l+r)/2;
build(p*2,l,mid);
build(p*2+1,mid+1,r);
}
void spread(int p){
if(add(p)){
add(p*2)=1;
add(p*2+1)=1;
val(p*2)=1;
val(p*2+1)=1;
add(p)=0;
}
}
void change(int p,int l,int r){
if(l<=l(p)&&r>=r(p)){
add(p)=1;val(p)=1;
return;
}
spread(p);
int mid=(l(p)+r(p))/2;
if(l<=mid) change(p*2,l,r);
if(r>mid) change(p*2+1,l,r);
val(p)=val(p*2)&&val(p*2+1);
}
bool ask(int p,int l,int r){
if(l<=l(p)&&r>=r(p)){
return val(p);
}
spread(p);
int mid=(l(p)+r(p))/2;
int val=1;
if(l<=mid) val=val&&ask(p*2,l,r);
if(r>mid) val=val&&ask(p*2+1,l,r);
return val;
}
int getid(int x){
return lower_bound(V.begin(),V.end(),x)-V.begin()+1;
}
int main(){
int n;
int T;
cin>>T;
while(T--){
cin>>n;
V.clear();
memset(Tree,0,sizeof Tree);
memset(A,0,sizeof A);
for(int i=1;i<=n;++i){
cin>>A[i].x>>A[i].y;
V.push_back(A[i].x);
V.push_back(A[i].y);
V.push_back(A[i].x+1);
V.push_back(A[i].x-1);
V.push_back(A[i].y+1);
V.push_back(A[i].y-1);
}
sort(V.begin(),V.end());
V.erase(unique(V.begin(),V.end()),V.end());
int maxn=0;
for(int i=1;i<=n;++i){
A[i].idx=getid(A[i].x);
A[i].idy=getid(A[i].y);
maxn=max(maxn,max(A[i].idx,A[i].idy));
}
build(1,1,maxn);
int ans=0;
for(int i=n;i>=1;--i){
if(ask(1,A[i].idx,A[i].idy)==0)
++ans;
change(1,A[i].idx,A[i].idy);
}
cout<<ans<<endl;
}
}