PKU 2777 Count Color

最新推荐文章于 2024-04-26 07:00:00 发布

Dwylkz

最新推荐文章于 2024-04-26 07:00:00 发布

阅读量550

点赞数

分类专栏： Graceful-Segment-Tree 文章标签： colors search insert output express struct

本文链接：https://blog.csdn.net/dwylkz/article/details/6649051

版权

Graceful-Segment-Tree 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 21363		Accepted: 6218

Description

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.

Sample Input

Sample Output

2
1

好基础既线段树覆盖问题，LazyTag都唔洗用，直接贴代码…………

 
 8711966 GZHU1006100106 2777 Accepted 3244K 360MS C++ 1523B 2011-05-31
 23:04:17

#include <iostream>
using namespace std;
#define MAXI 100001
#define ls(x) x << 1
#define rs(x) (x << 1) + 1

struct SegTree
{
	struct node
	{
		int l, r, c;
	}t[3 * MAXI];

	bool hco[33];

	void inti(int x, int a, int b)
	{
		int mid = (a + b) >> 1;

		t[x].c = 1;
		t[x].l = a;
		t[x].r = b;

		if (a < b)
		{
			inti(ls(x), a, mid);
			inti(rs(x), mid + 1, b);
		}
	}

	void insert(int x, int a, int b, int c)
	{
		int mid = (t[x].l + t[x].r) >> 1;

		if (a <= t[x].l && t[x].r <= b)
			t[x].c = c;
		else
		{
			if (t[x].c > 0)
			{
				t[ls(x)].c = t[rs(x)].c = t[x].c;
				t[x].c = -1;
			}
			if (a <= mid) insert(ls(x), a, b, c);
			if (b > mid) insert(rs(x), a, b, c);
		}
	}

	void search(int x, int a, int b)
	{
		int mid = (t[x].l + t[x].r) >> 1;

		if (t[x].c > 0) hco[t[x].c] = 1;
		else
		{
			if (a <= mid) search(ls(x), a, b);
			if (b > mid) search(rs(x), a, b);
		}
	}

	int statistic(int a, int b)
	{
		int i, sum = 0;;

		memset(hco, 0, sizeof hco);
		search(1, a, b);
		for (i = 1; i < 33; i++)
			if (hco[i]) sum++;
		return sum;
	}

}zkl;

int main()
{
	int L, T, O, a, b, c;
	char o;

	while (scanf("%d%d%d", &L, &T, &O) != EOF)
	{
		zkl.inti(1, 1, L);
		
		while (O--)
		{
			getchar();
			scanf("%c%d%d", &o, &a, &b);
			if (a > b) swap(a, b);
			
			if (o == 'C')
			{
				scanf("%d", &c);
				zkl.insert(1, a, b, c);
			}
			if (o == 'P') printf("%d\n", zkl.statistic(a, b));
		}
	}

	return 0;
}
其实系小水题