Count Colour_poj2777(线段树+位)

POJ 2777 Count Color (线段树)

 

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 29895		Accepted: 8919

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

 

 

---

分析 一个有n（n<100000）个单位的画板，但颜色只有30种，我没有马上想到位运算，但后来和一个宋词学仙交流的时候她告诉了我可以用位，不过她也是先用的布尔数组来判断的，可能会TLE

这个线段树的提就比较标准了，我先前写的时候一直没有想到好的延时更新的方法，最后慢慢想了一下午和一晚上终于弄对了

AC代码

#include<iostream>
#include<cstdio>
#define maxx 100005
#define L(u) (u<<1)
#define R(u) (u<<1|1)
using namespace std;
int n,t,Q;
int result,ans;
struct xx{
    int ls,rs;
    int clr;
    int sta;
}node[maxx<<2];
void pushup(int u)
{
    node[u].clr=node[R(u)].clr|node[L(u)].clr;
}
void pushdown(int u)
{
    node[u].sta=0;
    node[R(u)].clr=node[u].clr;
    node[L(u)].clr=node[u].clr;
    if(node[L(u)].ls!=node[L(u)].rs)
    node[L(u)].sta=1;
    if(node[R(u)].ls!=node[R(u)].rs)
    node[R(u)].sta=1;
}
void Build(int u,int l,int r)
{
    node[u].ls=l;
    node[u].rs=r;
    node[u].clr=2;
    if(l==r)
        return;
    int mid=(l+r)>>1;
    Build(L(u),l,mid);
    Build(R(u),mid+1,r);
}
void Updata(int u,int l,int r,int c)
{
    if(l==node[u].ls&&node[u].rs==r)
    {
        node[u].clr=(1<<c);
        if(node[u].ls!=node[u].rs)node[u].sta=1;
        return;
    }
    if(node[u].sta)pushdown(u);        //下传是必要的 
    int mid=(node[u].ls+node[u].rs)>>1;
    if(r<=mid)  Updata(L(u),l,r,c);
    else if(l>mid)  Updata(R(u),l,r,c);
    else{
        Updata(L(u),l,mid,c);
        Updata(R(u),mid+1,r,c);
    }
    pushup(u);
}
void Qurey(int u,int l,int r)
{
    if(l==node[u].ls&&node[u].rs==r)
    {
        result=result|node[u].clr;
        return;
    }
    if(node[u].sta)pushdown(u);        //下传是必要的
    int mid=(node[u].ls+node[u].rs)>>1;
    if(r<=mid) Qurey(L(u),l,r);
    else if(l>mid) Qurey(R(u),l,r);
    else{
        Qurey(L(u),l,mid);
        Qurey(R(u),mid+1,r);
    }
}
int main()
{
    while(~scanf("%d %d %d
",&n,&t,&Q))
    {
        Build(1,1,n);
        while(Q--)
        {
            char x;
            int a,b,c;
            scanf("%c",&x);
            if(x=='P')
            {
                result=0,ans=0;
                scanf("%d %d
",&a,&b);
                if(a>b)
                {a=a+b;b=a-b;a=a-b;}
                Qurey(1,a,b);
                while(result)
                {
                    result>>=1;
                    if(1&result)ans++;
                }
                cout<<ans<<endl;
            }
            else
            {
                scanf("%d %d %d
",&a,&b,&c);
                if(a>b)
                {a=a+b;b=a-b;a=a-b;}//注意查询的区间可能左大于右数据怪怪的 
                Updata(1,a,b,c);
            }
        }
    }
    return 0;
}