POJ 2777 Count Color (线段树&位运算)
来源:互联网 发布:淘宝宝贝视频怎么制作 编辑:程序博客网 时间:2024/06/04 08:04
Count Color
http://poj.org/problem?id=2777
Time Limit: 1000MS Memory Limit: 65536K
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
注意A可以大于B。
/*360ms,2800KB*/#include <cstdio>#include <algorithm>using namespace std;#define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1#define root 1, N, 1const int maxn = 100000;int sum[maxn << 2], add[maxn << 2];inline void up(int rt){sum[rt] = sum[rt << 1] | sum[rt << 1 | 1];}inline void down(int rt){if (add[rt]){add[rt << 1] = add[rt << 1 | 1] = add[rt];sum[rt << 1] = sum[rt << 1 | 1] = add[rt];add[rt] = 0;}}void update(int ql, int qr, int c, int l, int r, int rt){if (ql <= l && r <= qr){add[rt] = c;sum[rt] = c;return;}down(rt);int m = (l + r) >> 1;if (ql <= m) update(ql, qr, c, lson);if (qr > m) update(ql, qr, c, rson);up(rt);}int query(int ql, int qr, int l, int r, int rt){if (ql <= l && r <= qr){return sum[rt];}down(rt);int m = (l + r) >> 1;int ret = 0;if (ql <= m) ret |= query(ql, qr, lson);if (qr > m) ret |= query(ql, qr, rson);return ret;}inline int cnt(int val){int n = 0;while (val){if (val & 1) n++;val >>= 1;}return n;}int main(){int N, Q, a, b, c;scanf("%d%*d%d", &N, &Q);fill(sum + 1, sum + (N << 2), 1);while (Q--){getchar();if (getchar() == 'P'){scanf("%d%d", &a, &b);if (a > b) swap(a, b);printf("%d\n", cnt(query(a, b, root)));}else{scanf("%d%d%d", &a, &b, &c);if (a > b) swap(a, b);update(a, b, 1 << (c - 1), root);}}return 0;}
- POJ 2777 Count Color(线段树+位运算优化)
- poj 2777 Count Color 线段树+位运算
- POJ 2777 Count Color(线段树+位运算)
- POJ 2777 Count Color (线段树&位运算)
- POJ 2777 Count Color 线段树区间更新位运算
- POJ 2777 Count Color (线段树+位运算)
- POJ 2777 Count Color(线段树+位运算)
- poj 2777 Count Color(线段树、状态压缩、位运算)
- POJ 2777 Count Color(线段树+位运算)
- POJ 2777 Count Color ( 线段树&&位运算
- hdu5023A Corrupt Mayor's Performance Art(线段树+位运算) poj 2777Count Color(线段树+位运算)
- Count Color(线段树+位运算 POJ2777)
- Count Color(线段树+位运算)
- POJ 2777 Count Color(位运算+线段树+lazy+区间更新)
- POJ 2777 Count Color 【线段树 区间更新 按位或运算】
- POJ 2777 Count Color(线段树区间修改+位运算)
- poj 2777 Count Color(线段树+lazy优化+位运算)
- POJ 2777Count Color (线段树区间更新 + 位运算压缩)
- 如何备份SHSH
- Android Canvas Path Paint
- sqlite的快速插入
- linux上iscsi工具部署详解&&分布式文件系统提供iscsi接口的简单方法
- C# 实现对XML文件的基本操作(创建xml文件,增、删、改、查 xml节点信息)
- POJ 2777 Count Color (线段树&位运算)
- Cannot make a static reference to the non-static method
- HDU 2059 龟兔赛跑
- (Problem 5)Smallest multiple
- jquery 定位元素几种方法
- 使用Java进行远程方法调用的几个方案及比较
- cocos2d-x根据点击的位置来拖动精灵
- 为学Android,我看了这些书
- delphi控件安装与删除