POJ 2777 카운트 컬러 (선분 트 리 & 비트 연산)
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.
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
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, 1
const 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
", 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;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
정수 반전Udemy 에서 공부 한 것을 중얼거린다 Chapter3【Integer Reversal】 (예) 문자열로 숫자를 반전 (toString, split, reverse, join) 인수의 수치 (n)가 0보다 위 또는 ...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.