POJ2777-Count Color 线段树

时间：2017-04-14 14:48:00 阅读：134 评论：0 收藏：0 [点我收藏+]

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 45259		Accepted: 13703

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

线段树对区间操作，简单题
给你一段L长的线让你染色，有T中颜色，共有O次命令，
命令分为
C：给x到y染成c色
P：看x到y一共有多少种颜色

  1 #include<stdio.h>
  2 #include<string.h>
  3 int cc[1000];
  4 struct A{
  5     int l,r,c;
  6 }t[100000*4+4];
  7 void bulid(int p,int l,int r)
  8 {
  9     t[p].l=l;t[p].r=r;t[p].c=1;
 10     if(l==r)
 11         return ;
 12         int mid=(t[p].l+t[p].r)>>1;
 13     bulid(p*2,l,mid);
 14     bulid(p*2+1,mid+1,r);
 15 }
 16 void cha(int l,int r,int c,int p)
 17 {
 18     if(t[p].l==l&&t[p].r==r)
 19     {
 20         t[p].c=c;
 21         return ;
 22     }
 23     if(t[p].c==c)
 24         return ;
 25     if(t[p].c!=-1)
 26     {
 27         t[p*2].c=t[p].c;
 28         t[p*2+1].c=t[p].c;
 29         t[p].c=-1;
 30         
 31     }int mid=(t[p].l+t[p].r)>>1;
 32         if(r<=mid)
 33         {
 34             cha(l,r,c,p*2);
 35         }
 36         else if(l>mid)
 37         {
 38             cha(l,r,c,p*2+1);
 39         }
 40         else 
 41         {
 42             cha(l,mid,c,p*2);
 43             cha(mid+1,r,c,p*2+1);
 44         }
 45 }
 46 void se(int l,int r,int p)
 47 {
 48     if(t[p].c!=-1)
 49     {
 50         cc[t[p].c]=1;
 51     //    printf("!%d\n",t[p].c);
 52         return ;
 53     }
 54     int mid=(t[p].l+t[p].r)>>1;
 55         if(r<=mid)
 56         {
 57             se(l,r,p*2);
 58         }
 59         else if(l>mid)
 60         {
 61             se(l,r,p*2+1);
 62         }
 63         else 
 64         {
 65             se(l,mid,p*2);
 66             se(mid+1,r,p*2+1);
 67             
 68         }
 69 }
 70 int main()
 71 {
 72     int l,t,o,i,j,a,b,c;
 73     char aa;
 74     while(scanf("%d%d%d",&l,&t,&o)!=EOF)
 75     {
 76     bulid(1,1,l);
 77         while(o--)
 78         {
 79             getchar();
 80         aa=getchar();
 81         
 82         if(aa==‘C‘)
 83         {
 84             scanf("%d%d%d",&a,&b,&c);
 85             if(a>b)
 86             {
 87                 a=a^b;
 88                 b=a^b;
 89                 a=a^b;    
 90             }    
 91             cha(a,b,c,1);
 92         }
 93         else if(aa==‘P‘)
 94         {
 95             scanf("%d%d",&a,&b);
 96             if(a>b)
 97             {
 98                 a=a^b;
 99                 b=a^b;
100                 a=a^b;    
101             }
102             memset(cc,0,sizeof(cc));
103             se(a,b,1);
104             int sun=0;
105             for(j=1;j<=t;j++)
106             {
107                 if(cc[j]==1)
108                     sun++;
109             }
110                 
111                 printf("%d\n",sun);
112                 
113         }
114         }
115         
116         
117     }
118     return 0;    
119 }

POJ2777-Count Color 线段树

标签：esc 区间 ati efi ted new 简单题 length 命令

原文地址：http://www.cnblogs.com/ljmzzyk/p/6708382.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行