HDU5023 A Corrupt Mayor's Performance Art 【线段树】

时间：2014-09-22 22:53:03 阅读：242 评论：0 收藏：0 [点我收藏+]

A Corrupt Mayor‘s Performance Art

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)

Total Submission(s): 507 Accepted Submission(s): 203

Problem Description

Corrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this seemed a safe way for mayor X to make money.

Because a lot of people praised mayor X‘s painting(of course, X was a mayor), mayor X believed more and more that he was a very talented painter. Soon mayor X was not satisfied with only making money. He wanted to be a famous painter. So he joined the local painting associates. Other painters had to elect him as the chairman of the associates. Then his painting sold at better price.

The local middle school from which mayor X graduated, wanted to beat mayor X‘s horse fart(In Chinese English, beating one‘s horse fart means flattering one hard). They built a wall, and invited mayor X to paint on it. Mayor X was very happy. But he really had no idea about what to paint because he could only paint very abstract paintings which nobody really understand. Mayor X‘s secretary suggested that he could make this thing not only a painting, but also a performance art work.

This was the secretary‘s idea:

The wall was divided into N segments and the width of each segment was one cun(cun is a Chinese length unit). All segments were numbered from 1 to N, from left to right. There were 30 kinds of colors mayor X could use to paint the wall. They named those colors as color 1, color 2 .... color 30. The wall‘s original color was color 2. Every time mayor X would paint some consecutive segments with a certain kind of color, and he did this for many times. Trying to make his performance art fancy, mayor X declared that at any moment, if someone asked how many kind of colors were there on any consecutive segments, he could give the number immediately without counting.

But mayor X didn‘t know how to give the right answer. Your friend, Mr. W was an secret officer of anti-corruption bureau, he helped mayor X on this problem and gained his trust. Do you know how Mr. Q did this?

Input

There are several test cases.

For each test case:

The first line contains two integers, N and M ,meaning that the wall is divided into N segments and there are M operations(0 < N <= 1,000,000; 0<M<=100,000)

Then M lines follow, each representing an operation. There are two kinds of operations, as described below:

1) P a b c
a, b and c are integers. This operation means that mayor X painted all segments from segment a to segment b with color c ( 0 < a<=b <= N, 0 < c <= 30).

2) Q a b
a and b are integers. This is a query operation. It means that someone asked that how many kinds of colors were there from segment a to segment b ( 0 < a<=b <= N).

Please note that the operations are given in time sequence.

The input ends with M = 0 and N = 0.

Output

For each query operation, print all kinds of color on the queried segments. For color 1, print 1, for color 2, print 2 ... etc. And this color sequence must be in ascending order.

Sample Input

Sample Output

Source

2014 ACM/ICPC Asia Regional Guangzhou Online

题意：

P表示将区间[a,b]涂上颜色c；Q表示输出[a,b]区间出现的颜色。

版本一：406ms 线段树+hash

#include <stdio.h>
#include <algorithm>
#include <string.h>
#define maxn 100010
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
using namespace std;

struct Node {
    int num, col[62];
    bool lazy;
} T[maxn << 2];
int a[maxn], b[maxn], c[maxn], hash[maxn << 1];
bool ans[32];
char op[maxn];

void pushDown(int rt) {
    T[rt << 1].lazy = T[rt << 1 | 1].lazy = true;
    T[rt].lazy = false;
    T[rt << 1].col[0] = T[rt << 1 | 1].col[0] = T[rt].col[0];
    T[rt << 1].num = T[rt << 1 | 1].num = 1;
}

void pushUp(int rt) {
    int count = 0, i;
    for(i = 0; i < T[rt << 1].num; ++i)
        T[rt].col[count++] = T[rt << 1].col[i];
    for(i = 0; i < T[rt << 1 | 1].num; ++i)
        T[rt].col[count++] = T[rt << 1 | 1].col[i];
    sort(T[rt].col, T[rt].col + count);
    T[rt].num = unique(T[rt].col, T[rt].col + count) - T[rt].col;
}

void build(int l, int r, int rt) {
    T[rt].lazy = false;
    T[rt].num = 1;
    T[rt].col[0] = 2;
    if(l == r) return;
    int mid = (l + r) >> 1;
    build(lson);
    build(rson);
}

void update(int L, int R, int val, int l, int r, int rt) {
    if(L == l && R == r) {
        T[rt].lazy = true;
        T[rt].num = 1;
        T[rt].col[0] = val;
        return;
    }
    if(T[rt].lazy) pushDown(rt);
    int mid = (l + r) >> 1;
    if(R <= mid) update(L, R, val, lson);
    else if(L > mid) update(L, R, val, rson);
    else {
        update(L, mid, val, lson);
        update(mid + 1, R, val, rson);
    }
    pushUp(rt);
}

void query(int L, int R, int l, int r, int rt) {
    if(L == l && R == r) {
        for(int i = 0; i < T[rt].num; ++i)
            ans[T[rt].col[i]] = true;
        return;
    }
    if(T[rt].lazy) pushDown(rt);
    int mid = (l + r) >> 1;
    if(R <= mid) query(L, R, lson);
    else if(L > mid) query(L, R, rson);
    else {
        query(L, mid, lson);
        query(mid + 1, R, rson);
    }
}

int main() {
    //freopen("stdin.txt", "r", stdin);
    int n, m, i, id, j;
    char ch[2];
    while(scanf("%d%d", &n, &m) != EOF && (n || m)) {
        for(i = id = 0; i < m; ++i) {
            scanf("%s%d%d", ch, &a[i], &b[i]);
            hash[id++] = a[i];
            hash[id++] = b[i];
            if(ch[0] == 'P') scanf("%d", &c[i]);
            op[i] = ch[0];
        }
        sort(hash, hash + id);
        id = unique(hash, hash + id) - hash;
        build(1, id, 1);
        for(i = 0; i < m; ++i) {
            a[i] = lower_bound(hash, hash + id, a[i]) - hash + 1;
            b[i] = lower_bound(hash, hash + id, b[i]) - hash + 1;
            if(op[i] == 'P') update(a[i], b[i], c[i], 1, id, 1);
            else {
                memset(ans, 0, sizeof(ans));
                query(a[i], b[i], 1, id, 1);
                for(j = 0; j <= 30; ++j)
                    if(ans[j]) {
                        printf("%d", j);
                        break;
                    }
                for(++j; j <= 30; ++j)
                    if(ans[j]) printf(" %d", j);
                printf("\n");
            }
        }
    }
    return 0;
}

版本二：187ms 线段树+位操作存储信息。相当飘逸的解法。

#include <stdio.h>
#include <string.h>
#define maxn 1000002
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1

struct Node {
    int col;
    bool lazy;
} T[maxn << 2];

void pushDown(int rt) {
    T[rt].lazy = false;
    T[rt << 1].lazy = T[rt << 1 | 1].lazy = true;
    T[rt << 1].col = T[rt << 1 | 1].col = T[rt].col;
}

void pushUp(int rt) {
    T[rt].col = T[rt << 1].col | T[rt << 1 | 1].col;
}

void build(int l, int r, int rt) {
    T[rt].col = 4; // 1 << 2;
    T[rt].lazy = false;
    if(l == r) return;
    int mid = (l + r) >> 1;
    build(lson);
    build(rson);
}

void update(int L, int R, int col, int l, int r, int rt) {
    if(L == l && R == r) {
        T[rt].lazy = true;
        T[rt].col = 1 << col;
        return;
    }
    if(T[rt].lazy) pushDown(rt);
    int mid = (l + r) >> 1;
    if(R <= mid) update(L, R, col, lson);
    else if(L > mid) update(L, R, col, rson);
    else {
        update(L, mid, col, lson);
        update(mid + 1, R, col, rson);
    }
    pushUp(rt);
}

int query(int L, int R, int l, int r, int rt) {
    if(L == l && R == r) {
        return T[rt].col;
    }
    if(T[rt].lazy) pushDown(rt);
    int mid = (l + r) >> 1, ans;
    if(R <= mid) ans = query(L, R, lson);
    else if(L > mid) ans = query(L, R, rson);
    else {
        ans = query(L, mid, lson) | query(mid + 1, R, rson);
    }
    return ans;
}

int main() {
    //freopen("stdin.txt", "r", stdin);
    int n, m, a, b, c, i, ans;
    char ch[2];
    while(scanf("%d%d", &n, &m) != EOF && (n || m)) {
        build(1, n, 1);
        while(m--) {
            scanf("%s%d%d", ch, &a, &b);
            if(ch[0] == 'P') {
                scanf("%d", &c);
                update(a, b, c, 1, n, 1);
            } else {
                ans = query(a, b, 1, n, 1);
                for(i = 0; i <= 30; ++i)
                    if((ans >> i) & 1) {
                        printf("%d", i);
                        break;
                    }
                for(++i; i <= 30; ++i)
                    if((ans >> i) & 1)
                        printf(" %d", i);
                printf("\n");
            }
        }
    }    
    return 0;
}

HDU5023 A Corrupt Mayor's Performance Art 【线段树】

标签：hdu5023

原文地址：http://blog.csdn.net/chang_mu/article/details/39479669

踩

(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)

周排行