Count Color (线段树,区间更新)

Problem 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

题目大概:

在一个单行表格上,对他们进行区间涂色,最后查询区间的颜色数。

思路:

线段树,区间查询,根据别人ac代码写的。

代码:


#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

struct poin
{
    int l,r,id,v;
}a[101000<<2];

void build(int L,int R,int rt)
{
    a[rt].l=L;
    a[rt].r=R;
    if(L==R)return;
    int m=(L+R)>>1;
    build(L,m,rt<<1);
    build(m+1,R,rt<<1|1);

}
void update(int L,int R,int v,int rt)
{
    if(L==a[rt].l&&R==a[rt].r)
    {
        a[rt].id=1;
        a[rt].v=1<<(v-1);
        return;
    }
    if(a[rt].id)
    {
        a[rt].id=0;
        a[rt<<1].id=a[rt<<1|1].id=1;
        a[rt<<1].v=a[rt<<1|1].v=a[rt].v;
    }
    int m=(a[rt].l+a[rt].r)>>1;
    if(R<=m)
    {
        update(L,R,v,rt<<1);
    }
    else if(L>m)
    {
        update(L,R,v,rt<<1|1);
    }
    else
    {
        update(L,m,v,rt<<1);
        update(m+1,R,v,rt<<1|1);
    }
    a[rt].v=(a[rt<<1].v|a[rt<<1|1].v);
    if(a[rt<<1].id&&a[rt<<1|1].id&&a[rt<<1].v==a[rt<<1|1].v)
    a[rt].id=1;

}
int quert(int L,int R,int rt)
{
    if(a[rt].l==L&&a[rt].r==R)
    {
        return a[rt].v;
    }
    if(a[rt].id)
    {
        return a[rt].v;
    }
    int m=(a[rt].l+a[rt].r)>>1;
    if(R<=m)
    {
        return quert(L,R,rt<<1);
    }
    else if(L>m)
    {
        return quert(L,R,rt<<1|1);
    }
    else
    {
        return quert(L,m,rt<<1)|quert(m,R,rt<<1|1);
    }

}
int main()
{
    int l,k,n;
    while(~scanf("%d%d%d\n",&l,&k,&n))
    {


    build(1,l,1);
    a[1].v=1;
    a[1].id=1;
    while(n--)
    {
        char q[2];
        scanf("%s",q);
        if(q[0]=='C')
        {
            int w,e,r;
            scanf("%d%d%d",&w,&e,&r);
            update(w,e,r,1);
        }
        else
        {
            int w,e;
            scanf("%d%d",&w,&e);
            int sum=quert(w,e,1);
            int su=0;
            for(int j=0;j<k;j++)
            {
                if(sum&(1<<j))su++;
            }
            printf("%d\n",su);
        }

    }
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值