zoukankan      html  css  js  c++  java
  • POJ2777(线段树涂色问题)

    Count Color
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 42828   Accepted: 12973

    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

    思路:因为只有30种颜色,所以可以用2进制数颜色。
    注意:l可能大于r
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    const int MAXN = 100005;
    struct Node{
        int l, r;
        int color;
        bool lazy;
    }a[MAXN*3];
    int n, t, m, tag;
    void build(int rt, int l, int r)
    {
        a[rt].l = l;
        a[rt].r = r;
        a[rt].lazy = false;
        if(l == r)
        {
            a[rt].color = 1;
            return ;
        }
        int mid = (l + r) >> 1;
        build(rt << 1, l, mid);
        build((rt << 1) | 1, mid + 1, r);
        a[rt].color = a[rt<<1].color | a[(rt<<1)|1].color;
    }
    void pushDown(int rt)
    {
        if(a[rt].lazy)
        {
            a[rt<<1].color = a[rt].color;
            a[(rt<<1)|1].color = a[rt].color;
            a[rt<<1].lazy = a[rt].lazy;
            a[(rt<<1)|1].lazy = a[rt].lazy;
            a[rt].lazy = false;
        }
    }
    void update(int rt, int l, int r, int val)
    {
        if(a[rt].l == l && a[rt].r == r)
        {
            a[rt].color = 1 << (val - 1);
            a[rt].lazy = true;
            return ;
        }
        pushDown(rt);
        int mid = (a[rt].l + a[rt].r) >> 1;
        if(r <= mid)
        {
            update(rt << 1, l, r, val);
        }
        else if(mid < l)
        {
            update((rt << 1) | 1, l, r, val);
        }
        else
        {
            update(rt << 1, l, mid, val);
            update((rt << 1) | 1, mid + 1, r, val);
        }
        a[rt].color = a[rt<<1].color | a[(rt<<1)|1].color;
    }
    void query(int rt, int l, int r)
    {
        if(a[rt].l == l && a[rt].r == r)
        {
            tag |= a[rt].color;
            return ;
        }
        pushDown(rt);
        int mid = (a[rt].l + a[rt].r) >> 1;
        if(r <= mid)
        {
            query(rt << 1, l, r);
        }
        else if(mid < l)
        {
            query((rt << 1) | 1, l, r);
        }
        else
        {
            query(rt << 1, l, mid);
            query((rt << 1) | 1, mid + 1, r);
        }
    }
    int main()
    {
        while(scanf("%d %d %d", &n, &t, &m) != EOF)
        {
            build(1, 1, n);
            while(m--)
            {
                char op;
                scanf("%*c%c", &op);
                if(op == 'C')
                {
                    int l, r, val;
                    scanf("%d %d %d", &l, &r, &val);
                    if(l > r)   swap(l, r);
                    update(1, l, r, val);
                }
                else
                {
                    int l, r;
                    scanf("%d %d", &l, &r);
                    if(l > r)   swap(l, r);
                    tag = 0;
                    query(1, l, r);
                    int res = 0;
                    while(tag > 0)
                    {
                        if(tag & 1)
                        {
                            res++;
                        }
                        tag >>= 1;
                    }
                    printf("%d
    ", res);
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    mac安装浏览器同步测试工具
    感觉自己不幸福怎么办?
    React组件
    常用的网页加载进度条
    浅析百分百还原网站效果图的可行性分析
    关于后台权限
    第一阶段:Python开发基础 day04  Python基础语法入门--Python基本数据类型
    第一阶段:Python开发基础 day03 Python基础语法入门--Python基础知识
    第一阶段:Python开发基础 Python基础语法入门  day03 课后作业
    第一阶段:Python开发基础 基础语法入门-- day02 编程语言分类
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5721405.html
Copyright © 2011-2022 走看看