POJ2777: Count Color

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16446		Accepted: 4721

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

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

Sample Output

2
1

Source

POJ Monthly--2006.03.26,dodo

                             

                             

                             

                             

                             

                             

                             

线段树解决状态类问题

//#include <windows.h> //#include <iostream> //#include <fstream> #include <cstdio> //#include <cmath> //#include <cstdlib> //#include <cstring> //#include <algorithm> //using namespace std; //LARGE_INTEGER _lTemp; //LONGLONG _dFreq, _bTime, _eTime; //double _uTime; //定义数组大小 const int size = 100000 + 100; //线段结构定义 struct seg{ int left, right; int val; }; //结点集 seg S[size * 6]; //查询左右子女：从1开始 inline int L(int x){ return 2 * x; } inline int R(int x){ return 2 * x + 1; } //建线段树 void build(int idx, int left, int right){ S[idx].left = left; S[idx].right = right; S[idx].val = -1; //假设初始化为-1表示没有统一状态量 if (left < right){ int mid = (left + right) >> 1; build(L(idx), left, mid); build(R(idx), mid + 1, right); } } //更新数据 void update(int idx, int left, int right, int val){ //成功匹配 if (left == S[idx].left && right == S[idx].right){ S[idx].val = val; //如果是状态，则改变之 return; } //如果该区间已赋值（具有统一状态量），让左右子女暂时继承 if (S[idx].val != -1){ if (S[idx].val != val){ S[L(idx)].val = S[R(idx)].val = S[idx].val; S[idx].val = -1; } else return; } //递归 int mid = ( S[idx].left + S[idx].right) >> 1; if (left >= mid + 1) update(R(idx), left, right, val); else if (right <= mid) update(L(idx), left, right, val); else{ update(L(idx), left, mid, val); update(R(idx), mid + 1, right, val); } } //查询数据 int ans; bool used[40]; void initl(){ ans = 0; for (int i = 1; i < 40; i ++) used[i] = false; } //统计不同状态量 void query(int idx, int left, int right){ //查询到状态统一区间，增加记录 if (S[idx].val != -1){ if (!used[S[idx].val]){ used[S[idx].val] = true; ans ++; } return; } //继续向下查找 int mid = (S[idx].left + S[idx].right) >> 1; if (right <= mid) query(L(idx), left, right); else if (left >= mid + 1) query(R(idx), left, right); else{ query(L(idx), left, mid); query(R(idx), mid + 1, right); } } int main(){ // freopen("in.txt", "r", stdin); //重定向输入 // freopen("out.txt", "w", stdout);//重定向输出 // QueryPerformanceFrequency(&_lTemp); //获取运算频率 // _dFreq = _lTemp.QuadPart; //获取运算频率大整数 // QueryPerformanceCounter(&_lTemp); //获取开始时间 // _bTime = _lTemp.QuadPart; //获取开始时间大整数 int l, t, o; char chr; int b, e, cl; scanf("%d %d %d/n", &l, &t, &o); build(1, 1, l); S[1].val = 1; while (o --){ scanf("%c ", &chr); if (chr == 'C'){ scanf("%d %d %d/n", &b, &e, &cl); if (b > e) update(1, e, b, cl); else update(1, b, e, cl); } else{ scanf("%d %d/n", &b, &e); initl(); query(1, b, e); printf("%d/n", ans); } } // QueryPerformanceCounter(&_lTemp); //获取终止时间 // _eTime = _lTemp.QuadPart; //获取终止时间大整数 // _uTime = 1000 * double(_eTime - _bTime) / double(_dFreq); //计算总耗时，转化成ms // printf("Time used: %012.3f ms/n", _uTime); //输出总耗时，单位是ms // fclose(stdin); //关闭文件 // fclose(stdout); //关闭文件 return 0; }