POJ 2528

#include<map>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
map<int,int> ky;
struct node{
	int x,y;
}a[80010];
int tre[80010],laz[80010],b[80010],s[80010],ans;
void pushdown(int num){
    if(laz[num]!=0){
        tre[num*2]=laz[num];
        tre[num*2+1]=laz[num];
        laz[num*2]=laz[num];
        laz[num*2+1]=laz[num];
        laz[num]=0;
    }
}
void query(int num,int le,int ri){
    if(tre[num]!=-1&&tre[num]!=0){
    	if(b[tre[num]]==0)ans++;
		b[tre[num]]=1;
        return;
    }
	pushdown(num);	
    int mid=(le+ri)/2;
    query(num*2,le,mid);
    query(num*2+1,mid+1,ri);
}
void update(int num,int le,int ri,int x,int y,int ad){
    if(x<=le&&y>=ri){
        tre[num]=ad;
        laz[num]=ad;
        return;
    }
	pushdown(num);
    int mid=(le+ri)/2;
    if(x<=mid)update(num*2,le,mid,x,y,ad);
    if(y>mid)update(num*2+1,mid+1,ri,x,y,ad);
	if(tre[num*2]==ad&&tre[num*2+1]==ad)tre[num]=ad;
	else tre[num]=-1;
}
int main(){
    int x,y,n,m,i,j,t,c;
    scanf("%d",&t);
    for(i=1;i<=t;i++){
	    scanf("%d",&m);
	    n=0;ans=0;c=2;
		memset(b,0,sizeof(b));
    	for(j=1;j<=m;j++){
        	scanf("%d%d",&a[j].x,&a[j].y);
        	s[j*2-1]=a[j].x;
        	s[j*2]=a[j].y;
        }
        sort(s+1,s+2*m+1);
        ky[s[1]]=1;
        for(j=2;j<=2*m;j++)
        	if(s[j]!=s[j-1]){
				ky[s[j]]=c;
				c++;
			}
		for(j=1;j<=m;j++){
            update(1,1,ky[s[2*m]],ky[a[j].x],ky[a[j].y],j);
        }
        query(1,1,ky[s[2*m]]);
        printf("%d\n",ans);
    }
    return 0;
}