[poj2777 Count Color]线段树

Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.

There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board into L segments, and they are labeled by 1, 2, ... L from left to right, each is 1 centimeter long. Now we have to color the board - one segment with only one color. We can do following two operations on the board:

1. "C A B C" Color the board from segment A to segment B with color C.
2. "P A B" Output the number of different colors painted between segment A and segment B (including).

In our daily life, we have very few words to describe a color (red, green, blue, yellow…), so you may assume that the total number of different colors T is very small. To make it simple, we express the names of colors as color 1, color 2, ... color T. At the beginning, the board was painted in color 1. Now the rest of problem is left to your.

First line of input contains L (1 <= L <= 100000), T (1 <= T <= 30) and O (1 <= O <= 100000). Here O denotes the number of operations. Following O lines, each contains "C A B C" or "P A B" (here A, B, C are integers, and A may be larger than B) as an operation defined previously.

Ouput results of the output operation in order, each line contains a number.

2 2 4
C 1 1 2
P 1 2
C 2 2 2
P 1 2

2
1

POJ Monthly--2006.03.26,dodo

很明显的线段树，并且需要lazy操作提高性能，同时，注意到题目中的颜色数量很少，所以可以用一个整数表示一个集合，维护的是结点所管辖区间包含的所有颜色。

2777

Accepted

6496K

282MS

G++

2900B

代码：

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

const int MAX = 100007;
struct Node {
	int L, R;	//区间 
	int left, right;	//左右孩纸 
	int color;//每个节点的color包含了该结点所管理区间的颜色信息 
	bool lazy;
} tree[MAX << 2];
int N, C, M;

/*
	位运算大法好，因为颜色最多30种，可以用32位int表示出来。
	每个区间包含的颜色就直接采用二进制记录
	修改时修改孩子后把自身的颜色设为lson.color | rson.color
	也就是包含左右孩子的全部颜色
	查询时也可以直接用位运算返回左右孩子的color的或 
*/ 
//建树 
void build(int root, int L, int R) {
	if (L == R) {
		tree[root].L = tree[root].R = L;
		tree[root].color = 2;
		tree[root].lazy = false;
		return;
	}
	tree[root].L = L, tree[root].R = R;
	tree[root].left = root << 1;
	tree[root].right = tree[root].left | 1;
	tree[root].color = 2;
	tree[root].lazy = false;
	int mid = (L + R) >> 1;
	build(tree[root].left, L, mid);
	build(tree[root].right, mid + 1, R);
}

//下放操作 
void pushdown(int root) {
	if (tree[root].lazy && tree[root].R > tree[root].L) {
		tree[root].lazy = false;
		int ls = tree[root].left;
		int rs = tree[root].right;
		tree[ls].lazy = tree[rs].lazy = true;
		tree[ls].color = tree[rs].color = tree[root].color;
	}
}

//修改颜色 
void modify(int root, int L, int R, int cool) {
	//printf("modify %d,%d,%d,%d\n", root, L, R, cool);
	//如果区间被完全覆盖，采用lazy操作，在父节点处设置lazy 
	if (L <= tree[root].L && R >= tree[root].R) {
		tree[root].lazy = true;
		tree[root].color = cool;
		return;
	} else if (L > tree[root].R || R < tree[root].L) return;
	//否则，下放后修改左右孩纸，并修改父节点的颜色。 
	if (tree[root].lazy) pushdown(root);
	modify(tree[root].left, L, R, cool);
	modify(tree[root].right, L, R, cool);
	tree[root].color = tree[tree[root].left].color | tree[tree[root].right].color;
}

int query(int root, int L, int R) {
	//printf("query %d,%d,%d\n", root, L, R);
	if (L <= tree[root].L && R >= tree[root].R) {
		return tree[root].color;
	} else if (L > tree[root].R || R < tree[root].L) return 0;
	pushdown(root);//下放 
	return query(tree[root].left, L, R) | query(tree[root].right, L, R);
}

inline int read() {
	char ch;
	while ((ch = getchar()) < '0' || ch > '9');
	int x = ch - '0';
	while ((ch = getchar()) >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + ch - '0';
	}
	return x;
}

void Print(int x) {
	if (x == 0) return;
	Print(x / 10);
	putchar(x % 10 + '0');
}

int main() {
	while (~scanf(" %d %d %d", &N, &C, &M)) {
		build(1, 1, N);
		char op;
		int l, r, c;
		for (int i = 0; i < M; ++i) {
			while ((op = getchar()) != 'P' && op != 'C');
			l = read();
			r = read();
			//scanf(" %c %d %d", &op, &l, &r);
			if (l > r) swap(l, r);
			if (op == 'C') {
				c = read();
				//scanf(" %d", &c);
				modify(1, l, r, 1 << c);
			} else {
				int tmp = query(1, l, r);\
				int s = 0;
				while (tmp) {
					s += tmp & 1;
					tmp >>= 1;
				}//取出tmp二进制中1的个数 
				Print(s); //printf("%d\n", s);
				putchar('\n');
			}
		}
	}
	return 0;
}