GDUT 专题五 F - Count Color (线段树 + 二进制压缩 + lowbit) 2022

题目链接：https://vjudge.net/contest/479523#problem/F
题面：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.

input
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.

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

思路：线段树的区间更新问题。这里可以观察到color种类比较少，所以我们可以用二进制数来代替即第k总颜色对于二进制的第k位；通过’‘或’'操作，可以实现储存区间颜色的种类，线段树维护的值sum储存的所包含二进制位1的数量即为颜色种类（这里可以用到lowbit操作）。
另外需要用到延迟标记，以防超时。
具体看代码实现

AC代码

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 1e5;
int len, tot, m;
char opr[2];
struct SeT
{
	int l, r, sum;
	int mark;
}t[4 * N + 5];

void build(int p, int l, int r)
{
	//t[p].mark = 0;
	t[p].l = l; t[p].r = r;
	if(l == r)
	{
		t[p].sum = 1;	return;
	}
	int mid = l + (r - l) / 2;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	t[p].sum = t[p << 1].sum | t[p << 1 | 1].sum;
}

void spread(int p)	//延时标记
{
	if(t[p].mark)
	{
		t[p << 1].sum = t[p].mark;
		t[p << 1 | 1].sum = t[p].mark;
		t[p << 1].mark = t[p].mark;
		t[p << 1 | 1].mark = t[p].mark;
		t[p].mark = 0;
	}
}

void change(int p, int l, int r, int d)
{
	if(t[p].l >= l && t[p].r <= r)
	{
		t[p].sum = d;
		t[p].mark = d;
		return;
	}
	spread(p);
	int mid = (t[p].l + t[p].r) >> 1;
	if(l <= mid)	change(p << 1, l, r, d);
	if(r > mid)	change(p << 1 | 1, l, r, d);
	t[p].sum = t[p << 1].sum | t[p << 1 | 1].sum;
}

int ask(int p, int l, int r)
{
	if(t[p].l >= l && t[p].r <= r)
	{
		return t[p].sum;
	}
	spread(p);
	int mid = (t[p].l + t[p].r) >> 1, val = 0;
	if(l <= mid)	val = val | ask(p << 1, l, r);
	if(r > mid)	val = val | ask(p << 1 | 1, l, r);
	return val;
}

int main()
{
	scanf("%d%d%d", &len, &tot, &m);
	build(1, 1, len);
	for(int i = 1; i <= m; ++i)
	{
		scanf("%s", opr);
		if(opr[0] == 'C')
		{
			int l, r, c;
			scanf("%d%d%d", &l, &r, &c);
			if(r < l)	swap(l, r); 
			change(1, l, r, 1 << (c - 1));
		}
		else
		{
			int l, r, tmp, ans = 0;
			scanf("%d%d", &l, &r);
			if(r < l)	swap(l, r);
			tmp = ask(1, l, r);
			for(int i = tmp; i; i -= i & -i) //lowbit操作
				++ans;
			printf("%d\n", ans);
		}
	}
	return 0;
}```