【COGS】950 切割矩形 线段树&树状数组

传送门：【COGS】950 切割矩形

题目分析：

以y轴作为坐标轴，将一个矩阵拆成左右两条竖边，一条水平线拆成左右两个端点，按照x轴从小到大顺序扫描边和线，当x坐标相同时，先扫描矩阵的左竖边，再扫描左端点，再扫描矩阵的右竖边，再扫描右端点。

这样每次扫描到一条左竖边时，统计竖边覆盖的y轴范围内有多少水平线与该矩阵有交点，这就需要我们维护一个单点更新，区间求和：扫到左端点则+1，扫到右端点则-1。

每次扫到一个左端点的时候，统计有多少矩阵是覆盖这个点的，这就需要我们维护一个区间更新，单点查询：扫到一条左竖边则区间【L，R】+ 1，扫到一条右竖边则区间【L，R】- 1。

一开始写了线段树版的。。跑的挺慢的。树状数组比线段树快了2倍以上。

线段树代码如下：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

#define REP( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define CLR( a , x ) memset ( a , x , sizeof a )
#define CPY( a , x ) memcpy ( a , x , sizeof a )
#define ls ( o << 1 )
#define rs ( o << 1 | 1 )
#define lson ls , l , m
#define rson rs , m + 1 , r
#define mid ( ( l + r ) >> 1 )
#define root 1 , 1 , cnt
#define rt o , l , r

const int MAXN = 90005 ;

struct Line {
	int l , r , h ;
	int x ;
	Line () {}
	Line ( int x , int l , int r , int h ) : x ( x ) , l ( l ) , r ( r ) , h ( h ) {}
	bool operator < ( const Line& a ) const {
		if ( h != a.h ) return h < a.h ;
		return x > a.x ;
	}
} L[60005] , Q[60005] ;

int addv[MAXN << 2] , num[MAXN << 2] , sum[MAXN << 2] ;
int a[MAXN] , cnt ;
int numL , numQ ;
int n , q ;

int unique ( int n ) {
	int cnt = 1 ;
	sort ( a + 1 , a + n + 1 ) ;
	FOR ( i , 2 , n ) if ( a[i] != a[cnt] ) a[++ cnt] = a[i] ;
	return cnt ;
}

int search ( int x , int l , int r ) {
	while ( l < r ) {
		int m = mid ;
		if ( a[m] >= x ) r = m ;
		else l = m + 1 ;
	}
	return l ;
}

void pushdown ( int o ) {
	if ( addv[o] ) {
		num[ls] += addv[o] ;
		num[rs] += addv[o] ;
		addv[ls] += addv[o] ;
		addv[rs] += addv[o] ;
		addv[o] = 0 ;
	}
}

void update_num ( int L , int R , int v , int o , int l , int r ) {
	if ( L <= l && r <= R ) {
		addv[o] += v ;
		num[o] += v ;
		return ;
	}
	int m = mid ;
	pushdown ( o ) ;
	if ( L <= m ) update_num ( L , R , v , lson ) ;
	if ( m <  R ) update_num ( L , R , v , rson ) ;
}

void update_sum ( int pos , int v , int o , int l , int r ) {
	if ( l == r ) {
		sum[o] += v ;
		return ;
	}
	int m = mid ;
	if ( pos <= m ) update_sum ( pos , v , lson ) ;
	else            update_sum ( pos , v , rson ) ;
	sum[o] = sum[ls] + sum[rs] ;
}

int query_num ( int pos , int o , int l , int r ) {
	if ( l == r ) return num[o] ;
	int m = mid ;
	pushdown ( o ) ;
	if ( pos <= m ) return query_num ( pos , lson ) ;
	else            return query_num ( pos , rson ) ;
}

int query_sum ( int L , int R , int o , int l , int r ) {
	if ( L <= l && r <= R ) return sum[o] ;
	int m = mid ;
	if ( R <= m ) return query_sum ( L , R , lson ) ;
	if ( m <  L ) return query_sum ( L , R , rson ) ;
	return query_sum ( L , R , lson ) + query_sum ( L , R , rson ) ;
}

void scanf ( int& x , char c = 0 ) {
	while ( ( c = getchar () ) < '0' || c > '9' ) ;
	x = c - '0' ;
	while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}

void solve () {
	int x1 , x2 , y1 , y2 ;
	int ans = 0 ;
	CLR ( addv , 0 ) ;
	CLR ( num , 0 ) ;
	CLR ( sum  , 0 ) ;
	numL = numQ = cnt = 0 ;
	scanf ( n ) ;
	REP ( i , 0 , n ) {
		scanf ( x1 ) , scanf ( y1 ) , scanf ( x2 ) , scanf ( y2 ) ;
		a[++ cnt] = y1 ;
		a[++ cnt] = y2 ;
		L[numL ++] = Line (  1 , y1 , y2 , x1 ) ;
		L[numL ++] = Line ( -1 , y1 , y2 , x2 ) ;
	}
	scanf ( q ) ;
	REP ( i , 0 , q ) {
		scanf ( x1 ) , scanf ( y1 ) , scanf ( x2 ) , scanf ( y2 ) ;
		a[++ cnt] = y1 ;
		Q[numQ ++] = Line (  1 , y1 , y2 , x1 ) ;
		Q[numQ ++] = Line ( -1 , y1 , y2 , x2 ) ;
	}
	cnt = unique ( cnt ) ;
	sort ( L , L + numL ) ;
	sort ( Q , Q + numQ ) ;
	int j = 0 ;
	REP ( i , 0 , numQ ) {
		Q[i].l = search ( Q[i].l , 1 , cnt ) ;
		while ( j < numL && ( L[j].h < Q[i].h || L[j].h == Q[i].h && L[j].x == 1 ) ) {
			L[j].l = search ( L[j].l , 1 , cnt ) ;
			L[j].r = search ( L[j].r , 1 , cnt ) ;
			if ( L[j].x == 1 ) ans += query_sum ( L[j].l , L[j].r , root ) ;
			update_num ( L[j].l , L[j].r , L[j].x , root ) ;
			++ j ;
		}
		if ( Q[i].x == 1 ) ans += query_num ( Q[i].l , root ) ;
		update_sum ( Q[i].l , Q[i].x , root ) ;
	}
	printf ( "%d\n" , ans ) ;
}

int main () {
	freopen ( "cutting.in" , "r" , stdin ) ;
	freopen ( "cutting.out" , "w" , stdout ) ;
	int T ;
	scanf ( "%d" , &T ) ;
	while ( T -- ) solve () ;
	return 0 ;
}

树状数组代码如下：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

#define REP( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define CLR( a , x ) memset ( a , x , sizeof a )
#define CPY( a , x ) memcpy ( a , x , sizeof a )
#define ls ( o << 1 )
#define rs ( o << 1 | 1 )
#define lson ls , l , m
#define rson rs , m + 1 , r
#define mid ( ( l + r ) >> 1 )
#define root 1 , 1 , cnt
#define rt o , l , r

const int MAXN = 90005 ;

struct Line {
	int l , r , h ;
	int x ;
	Line () {}
	Line ( int x , int l , int r , int h ) : x ( x ) , l ( l ) , r ( r ) , h ( h ) {}
	bool operator < ( const Line& a ) const {
		if ( h != a.h ) return h < a.h ;
		return x > a.x ;
	}
} L[60005] , Q[60005] ;

int T1[MAXN] , T2[MAXN] ;
int a[MAXN] , cnt ;
int numL , numQ ;
int n , q ;

int unique ( int n ) {
	int cnt = 1 ;
	sort ( a + 1 , a + n + 1 ) ;
	FOR ( i , 2 , n ) if ( a[i] != a[cnt] ) a[++ cnt] = a[i] ;
	return cnt ;
}

int search ( int x , int l , int r ) {
	while ( l < r ) {
		int m = mid ;
		if ( a[m] >= x ) r = m ;
		else l = m + 1 ;
	}
	return l ;
}

void add1 ( int x , int v ) {
	while ( x <= cnt ) {
		T1[x] += v ;
		x += x & -x ;
	}
}

void add2 ( int x , int v ) {
	while ( x ) {
		T2[x] += v ;
		x -= x & -x ;
	}
}

int sum1 ( int x , int ans = 0 ) {
	while ( x ) {
		ans += T1[x] ;
		x -= x & -x ;
	}
	return ans ;
}

int sum2 ( int x , int ans = 0 ) {
	while ( x <= cnt ) {
		ans += T2[x] ;
		x += x & -x ;
	}
	return ans ;
}

void scanf ( int& x , char c = 0 ) {
	while ( ( c = getchar () ) < '0' || c > '9' ) ;
	x = c - '0' ;
	while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}

void solve () {
	int x1 , x2 , y1 , y2 ;
	int ans = 0 ;
	CLR ( T1 , 0 ) ;
	CLR ( T2 , 0 ) ;
	numL = numQ = cnt = 0 ;
	scanf ( n ) ;
	REP ( i , 0 , n ) {
		scanf ( x1 ) , scanf ( y1 ) , scanf ( x2 ) , scanf ( y2 ) ;
		a[++ cnt] = y1 ;
		a[++ cnt] = y2 ;
		L[numL ++] = Line (  1 , y1 , y2 , x1 ) ;
		L[numL ++] = Line ( -1 , y1 , y2 , x2 ) ;
	}
	scanf ( q ) ;
	REP ( i , 0 , q ) {
		scanf ( x1 ) , scanf ( y1 ) , scanf ( x2 ) , scanf ( y2 ) ;
		a[++ cnt] = y1 ;
		Q[numQ ++] = Line (  1 , y1 , y2 , x1 ) ;
		Q[numQ ++] = Line ( -1 , y1 , y2 , x2 ) ;
	}
	cnt = unique ( cnt ) ;
	sort ( L , L + numL ) ;
	sort ( Q , Q + numQ ) ;
	int j = 0 ;
	REP ( i , 0 , numQ ) {
		Q[i].l = search ( Q[i].l , 1 , cnt ) ;
		while ( j < numL && ( L[j].h < Q[i].h || L[j].h == Q[i].h && L[j].x == 1 ) ) {
			L[j].l = search ( L[j].l , 1 , cnt ) ;
			L[j].r = search ( L[j].r , 1 , cnt ) ;
			if ( L[j].x == 1 ) ans += sum1 ( L[j].r ) - sum1 ( L[j].l - 1 ) ;
			add2 ( L[j].r , L[j].x ) , add2 ( L[j].l - 1 , -L[j].x ) ;
			++ j ;
		}
		if ( Q[i].x == 1 ) ans += sum2 ( Q[i].l ) ;
		add1 ( Q[i].l , Q[i].x ) ;
	}
	printf ( "%d\n" , ans ) ;
}

int main () {
	freopen ( "cutting.in" , "r" , stdin ) ;
	freopen ( "cutting.out" , "w" , stdout ) ;
	int T ;
	scanf ( "%d" , &T ) ;
	while ( T -- ) solve () ;
	return 0 ;
}