poj2777 Count Color

原创 2016年05月30日 20:37:23

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.

题解:

令线段树节点定义为: l,r,value,flag分被表示区间左右端点,该区间的涂色为value,flag为标记量,true表示该区间涂色为最新的涂色,否则表示该区间的子区间有更新的涂色。由于初始时均涂色为1,故value的值均为1,flag均为true(即都是最新的涂色)。本题的难点在于更新和查找。

代码:

with tree[p] do  
    begin  
      if (l=b) and (r=e) then  
        begin  
          color:=1 shl (c-1);  
          cover:=true;  
          exit;  
        end;  
      if cover then  
        begin  
          cover:=false;  
          tree[p*2].cover:=true;  
          tree[p*2].color:=color;  
          tree[p*2+1].cover:=true;  
          tree[p*2+1].color:=color;  
        end;  
      m:=(l+r) div 2;  
      if e<=m then ins(p*2,b,e,c) else  
        if b>m then ins(p*2+1,b,e,c) else  
          begin  
            ins(p*2,b,m,c);  
            ins(p*2+1,m+1,e,c);  
          end;  
      color:=tree[p*2].color or tree[p*2+1].color;  
    end;  

版权声明:要转载的“汪”一声,价钱面谈。

相关文章推荐

POJ 2777 Count Color

题目链接:http://poj.org/problem?id=2777 经典的线段树问题 1)建树,树节点有三个域,分别为左右端点l,r与代表颜色的c,当c等于0的时候表示被多...

poj(2777)——Count Color(lazy思想,成段更新,区间统计)

题目的意思是: 现在我们有l个数,然后标记为1到n,他们的单位长度都是1,然后在每个单位长度的地方我们只能染上一种颜色。 现在有两种操作:  "C A B C"代表给A,B区间都染上C这种颜色。...

poj 2777 Count Color(线段树)

传送门:点击打开链接 题目大意: 给定一个区间,出

线段树 POJ2777 Count Color 解题报告

Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 39860 Accepted: 12024 Desc...

poj 2777 Count Color(线段树、状态压缩、位运算)

Count Color Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 38921   Accepted: 116...

poj 2777 Count Color

这题是线段覆盖! 注意父亲节点性质的传递,如果父亲的颜色被破坏,要传递它的颜色给孩子!! 1A,爽歪歪!!keep on!! #include #include #include #def...

POJ2777 - Count Color (线段树 区间更新)

POJ2777 - Count Color解题思路 代码解题思路这道题看上去是一道普通的区间更新问题,但入手还是挺多坑的。因为所要查询的是给定区间内不同颜色的个数,这就需要在每一层节点都要保存该区间的...

poj 2777 Count Color 线段树成段更新区间统计

Count Color Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31008   Accepted: 929...

poj2777 Count Color

Count Color Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 26254   A...

POJ 2777 Count Color(线段树 )

Language: Default Count Color Time Limit: 1000MS   Memory Limit: 65536K Total Su...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)