ZOJ1610——Count the Colors (区间染色+暴力)
Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.

Your task is counting the segments of different colors you can see at last.

Input

The first line of each data set contains exactly one integer n, 1 <= n <= 8000, equal to the number of colored segments.

Each of the following n lines consists of exactly 3 nonnegative integers separated by single spaces:

x1 x2 c

x1 and x2 indicate the left endpoint and right endpoint of the segment, c indicates the color of the segment.

All the numbers are in the range [0, 8000], and they are all integers.

Input may contain several data set, process to the end of file.

Output


Each line of the output should contain a color index that can be seen from the top, following the count of the segments of this color, they should be printed according to the color index.

If some color can't be seen, you shouldn't print it.

Print a blank line after every dataset.


Sample Input

5
0 4 4
0 3 1
3 4 2
0 2 2
0 2 3
4
0 1 1
3 4 1
1 3 2
1 3 1
6
0 1 0
1 2 1
2 3 1
1 2 0
2 3 0
1 2 1

Sample Output

1 1
2 1
3 1

1 1

0 2
1 1


#include <cstdio>
#include <cstring> 

using namespace std;

const int MAXN = 8050;

int Tree[MAXN*4];
int Change[MAXN*4];
int mount[MAXN];
int book[MAXN];
int top;

void PushDown(int temp){
	if(Change[temp]!=-1){
		Change[temp<<1] = Change[temp<<1|1] = Change[temp];
		Change[temp] = -1;
	}
}

void Updata(int temp,int left,int right,int ql,int qr,int value){
	if(ql<=left && qr>=right){
		Change[temp] = value;
		return;
	}
	PushDown(temp);
	
	int mid = left + (right-left)/2;
	if(ql<=mid)Updata(temp<<1,left,mid,ql,qr,value);
	if(qr>mid)Updata(temp<<1|1,mid+1,right,ql,qr,value);
}

void query(int temp,int left,int right){
	if(left == right){
		if(Change[temp]!=-1){
			Tree[temp] = Change[temp];
			Change[temp] = -1;
		}
		mount[top++] = Tree[temp];//把叶节点的数据收集起来方便暴力
		return;
	}
	PushDown(temp);
	int mid = left + (right-left)/2;
	query(temp<<1,left,mid);
	query(temp<<1|1,mid+1,right);
}

int main(){
	
	int N;
	while(scanf("%d",&N)!=EOF){
		memset(Tree,-1,sizeof(Tree));
		memset(Change,-1,sizeof(Change));
		memset(book,0,sizeof(book));
		top = 0;
		int a,b,c;
		for(int i=0 ; i<N ; i++){
			scanf("%d %d %d",&a,&b,&c);
			if(a<b)a++;//左开右闭
			Updata(1,1,MAXN,a+1,b+1,c);
		}
		query(1,1,MAXN);
		int t = -1;
		for(int i=0 ; i<top ; i++){
			if(mount[i]!=-1 && mount[i]!=t){
				t = mount[i];
				book[t]++;
			}else if(mount[i] == -1 && mount[i]!=t){
				t = mount[i];
			}
		}
		for(int i=0 ; i<MAXN ; i++){
			if(book[i])printf("%d %d\n",i,book[i]);
		}
		printf("\n");
	}
	
	return 0;
}





阅读更多
版权声明:本文为博主原创文章,转载请附上注明就行。 https://blog.csdn.net/vocaloid01/article/details/80350974
个人分类: 树状数组&&线段树
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

ZOJ1610——Count the Colors (区间染色+暴力)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭