POJ2777_Count Color
来源:互联网 发布:长庚医院网络挂号查询 编辑:程序博客网 时间:2024/06/05 05:39
Count Color
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41391 Accepted: 12511
二进制存储颜色,lazy思想;
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.
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 4C 1 1 2P 1 2C 2 2 2P 1 2
Sample Output
21
Source
POJ Monthly--2006.03.26,dodo
#include<cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>#include <queue>#include <stack>#include <set>#include <queue>#include <map>#define lson l,mid,rt<<1#define rson mid+1,r,rt<<1|1using namespace std;const int N=1e5+10;int col[N<<2];int Add[N<<2];void build(){ Add[1]=1; col[1]=1;}void pushup(int rt){ col[rt]=col[rt<<1]|col[rt<<1|1];}void pushdown(int rt){ if(Add[rt]!=-1) { Add[rt<<1]=Add[rt<<1|1]=Add[rt]; col[rt<<1]=col[rt<<1|1]=Add[rt]; Add[rt]=-1; }}void update(int L,int R,int c,int l,int r,int rt){ if(L<=l&&R>=r) { Add[rt]=1<<(c-1); col[rt]=1<<(c-1); return; } if(L>r||R<l) return; pushdown(rt); int mid=(l+r)>>1; update(L,R,c,lson); update(L,R,c,rson); pushup(rt);}int Query(int L,int R,int l,int r,int rt){ if(L<=l&&R>=r) { return col[rt]; } if(L>r||R<l) return 0; pushdown(rt); int mid=(l+r)>>1; return Query(L,R,lson)|Query(L,R,rson);}int main(){ int l,t,o; int a,b,c; char s[2]; scanf("%d%d%d",&l,&t,&o); build(); while(o--) { scanf("%s",s); if(s[0]=='C') { scanf("%d%d%d",&a,&b,&c); if(a>b) swap(a,b); update(a,b,c,1,l,1); } else { scanf("%d%d",&a,&b); if(a>b) swap(a,b); int tmp=Query(a,b,1,l,1); int ans=0; while(tmp) { if(tmp&1) ans++; tmp>>=1; } printf("%d\n",ans); } } return 0;}
0 0
- POJ2777_Count Color
- POJ2777_Count colorz_solution
- color #
- color
- color
- Color
- color
- color
- color
- Color
- Color
- color
- COLOR
- Color
- color
- color
- Color
- color
- CMakeFile命令之file
- String、StringBuffer、StringBuilder简单理解
- Understanding Play2 Iteratees for Normal Humans
- 怎么维护 SQLite
- 位运算-Number of 1 Bits(求一个十进制数字,它的二进制表示中有多少个 1(bit))
- POJ2777_Count Color
- Ajax的简单使用
- 1007. Maximum Subsequence Sum
- flask框架配置email问题汇总,包括163邮箱,qq邮箱,gmail等国内外邮箱
- Ant Colony Optimization
- 无向图的双连通性
- shader内置变量和函数
- windows下创建并使用静态链接库(.lib)
- zcat,zgrep用法