POJ2777 Count Color 线段树

关注

原创最新推荐文章于 2021-08-12 22:39:07 发布 676 阅读 AI 写同款· GEO 优化 ›

【题解】Count Color POJ - 2777 (线段树 区间染色)⭐⭐⭐ Count Color POJ - 2777 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 le... 阅读详情

颜色不多只有30种，用状态压缩每一位代表一种颜色，最后统计区间里面有多少个1就可以了。

线段树的成段更新和查询。

C A B C 将A B 段染成C

P A B 查询 A B段的颜色数量

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 30425		Accepted: 9083

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

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>

using namespace std;

#define MAXN 100100
#define lson l,m,root<<1
#define rson m+1,r,root<<1|1

int col[MAXN<<2],node[MAXN<<2];

void push_up(int root)
{
    node[root]=node[root<<1]|node[root<<1|1];
}

void push_down(int root)
{
    if(col[root])
    {
        col[root<<1]=col[root<<1|1]=col[root];
        node[root<<1]=node[root<<1|1]=col[root];
        col[root]=0;
    }
}

void build(int l,int r,int root)
{
    col[root]=0;
    if(l==r)
    {
        node[root]=1;
        return ;
    }
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    push_up(root);
}

void update(int l,int r,int root,int L,int R,int d)
{
    if(l>=L&&r<=R)
    {
        node[root]=d;
        col[root]=d;
        return;
    }
    int m=(l+r)>>1;
    push_down(root);
    if(L<=m)
        update(lson,L,R,d);
    if(R>m)
        update(rson,L,R,d);
    push_up(root);
}

int query(int l,int r,int root,int L,int R )
{
    if(l>=L&&r<=R)
    {
        return node[root];
    }
    int m=(l+r)>>1,ret=0;
    push_down(root);
    if(L<=m)
        ret|=query(lson,L,R);
    if(R>m)
        ret|=query(rson,L,R);
    return ret;
}

int counts(int k)
{
    int ans=0;
    while(k)
    {
        if(k&1) ans++;
        k>>=1;
    }
    return ans;
}

int n,t,o;

int main()
{
    while(~scanf("%d%d%d",&n,&t,&o))
    {
        build(1,n,1);
        char str[5];
        int u,v,w;
        for(int i=0;i<o;i++)
        {
            scanf("%s",str);
            if(str[0]=='C')
            {
                scanf("%d%d%d",&u,&v,&w);
                if(u>v) swap(u,v);
                int col=1<<(w-1);
                update(1,n,1,u,v,col);
            }
            else
            {
                scanf("%d%d",&u,&v);
                if(u>v) swap(u,v);
                int ans=counts(query(1,n,1,u,v));
                printf("%d\n",ans);
            }
        }
    }
    return 0;
}

收录于