hdu----(5023)A Corrupt Mayor's Performance Art(线段树区间更新以及区间查询)

A Corrupt Mayor‘s Performance Art

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)
Total Submission(s): 33    Accepted Submission(s): 11

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

5 10
P 1 2 3
P 2 3 4
Q 2 3
Q 1 3
P 3 5 4
P 1 2 7
Q 1 3
Q 3 4
P 5 5 8
Q 1 5
0 0

Sample Output

4
3 4
4 7
4
4 7 8

Source

2014 ACM/ICPC Asia Regional Guangzhou Online

代码:G++ 281ms

  1 #define LOCAL
  2 #include<cstring>
  3 #include<cstdio>
  4 #include<cstdlib>
  5 #include<algorithm>
  6 #include<iostream>
  7 using namespace std;
  8 const int maxn=1000100;
  9
 10 struct node
 11 {
 12     int lef,rig; //通过和的大小来比较种类是否一样
 13     int cnt; //跟新的种类
 14     int type; //保存的种类
 15     int mid(){
 16       return lef+(rig-lef>>1);
 17     }
 18 };
 19
 20 node sac[maxn<<3];
 21 int ans[maxn*4],ct;
 22
 23 void Build(int left,int right,int pos)
 24 {
 25   sac[pos]=(node){left,right,0,2};   //单一
 26   if(left==right) return ;
 27   int mid=sac[pos].mid();
 28   Build(left,mid,pos<<1);
 29   Build(mid+1,right,pos<<1|1);
 30 }
 31
 32 void Update(int left,int right,int pos,int val)
 33 {
 34    if(left<=sac[pos].lef&&sac[pos].rig<=right)
 35     {
 36       sac[pos].cnt=val;
 37       sac[pos].type=val;
 38       return ;
 39     }
 40
 41     if(sac[pos].cnt!=0)
 42     { //向下更新一次
 43       sac[pos<<1|1].cnt=sac[pos<<1].cnt=sac[pos].cnt;
 44       sac[pos<<1|1].type=sac[pos<<1].type=sac[pos].type;
 45       sac[pos].cnt=0;
 46     }
 47     int mid=sac[pos].mid();
 48     if(mid>=left)
 49        Update(left,right,pos<<1,val);
 50     if(mid<right)
 51        Update(left,right,pos<<1|1,val);
 52       if(sac[pos<<1].type==sac[pos<<1|1].type)
 53           sac[pos].type=sac[pos<<1].type;
 54         else sac[pos].type=0;
 55 }
 56
 57 void Query(int pos,int left,int right) {//查找操作
 58
 59    if(sac[pos].lef>right||sac[pos].rig<left)
 60         return ;
 61
 62     if(sac[pos].type)
 63     {
 64       ans[ct++]=sac[pos].type;
 65       return ;
 66     }
 67    Query(pos<<1,left,right);
 68    Query(pos<<1|1,left,right);
 69
 70 }
 71
 72 int main()
 73 {
 74   int n,m,a,b,c;
 75   char s[2];
 76   #ifdef LOCAL
 77      freopen("test.in","r",stdin);
 78   #endif
 79   while(scanf("%d%d",&n,&m),n+m!=0){
 80      Build(1,n,1);
 81      ct=0;
 82      while(m--)
 83      {
 84        scanf("%s",s);
 85        if(s[0]==‘P‘){
 86          scanf("%d%d%d",&a,&b,&c);
 87          Update(a,b,1,c);
 88        }
 89        else
 90        {
 91              scanf("%d%d",&a,&b);
 92           Query(1,a,b);
 93           sort(ans,ans+ct);
 94           printf("%d",ans[0]);
 95          for(int i=1;i<ct;i++){
 96             if(ans[i]!=ans[i-1])
 97               printf(" %d",ans[i]);
 98          }
 99           printf("\n");
100           ct=0;
101        }
102      }
103   }
104   return 0;
105 }

hdu----(5023)A Corrupt Mayor's Performance Art(线段树区间更新以及区间查询)

时间: 2024-10-01 00:31:52

hdu----(5023)A Corrupt Mayor's Performance Art(线段树区间更新以及区间查询)的相关文章

HDU 5023 A Corrupt Mayor&#39;s Performance Art 线段树区间更新+状态压缩

Link:  http://acm.hdu.edu.cn/showproblem.php?pid=5023 1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <algorithm> 5 #include <vector> 6 #include <string> 7 #include <cmath> 8 using namesp

hdu 5023 A Corrupt Mayor&#39;s Performance Art(线段树区间更新)

#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; int tree[5001000],add[5001000]; int color[50]; int n,m; void pushup(int pos) { tree[pos]=tree[pos<<1]|tree[pos<<1|1]; //更新

hdu 5023 A Corrupt Mayor&#39;s Performance Art (线段树+区间更新+状压)

A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 699    Accepted Submission(s): 267 Problem Description Corrupt governors always find ways to get dirty money.

hdu 5023 A Corrupt Mayor&#39;s Performance Art (线段树)

把求和操作改为或操作,就可以了. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 #include <cmath> 6 #define lson l,m,rt<<1 7 #define rson m+1,r,rt<<1|1 8 using namespace std; 9 const int ma

hdu 5023 A Corrupt Mayor&#39;s Performance Art(线段树)

题目链接 题意:有一个长度 n 的序列,初始染色2,有两种操作,P x ,y ,z,区间x---y染色为z,另一种Q x,y,查询区间 x -- y 有几种颜色,并输出,会覆盖 分析:lz[]为0,表示下面颜色不统一,统一是>0; f[]表示该节点下有多少种颜色,是30种颜色的二进制表示. 刚开始做时,用1<<i 不对,不知道为什么,int的范围按理不会超的.. 1 #include <iostream> 2 #include <cstdio> 3 #includ

HDU 5023 A Corrupt Mayor&#39;s Performance Art(线段树区间更新)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5023 解题报告:一面墙长度为n,有N个单元,每个单元编号从1到n,墙的初始的颜色是2,一共有30种颜色,有两种操作: P a b c  把区间a到b涂成c颜色 Q a b 查询区间a到b的颜色 线段树区间更新,每个节点保存的信息有,存储颜色的c,30种颜色可以压缩到一个int型里面存储,然后还有一个tot,表示这个区间一共有多少种颜色. 对于P操作,依次往下寻找,找要更新的区间,找到要更新的区间之前

HDU 5023 A Corrupt Mayor&#39;s Performance Art (线段树)

A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 255    Accepted Submission(s): 114 Problem Description Corrupt governors always find ways to get dirty money.

ACM学习历程—HDU 5023 A Corrupt Mayor&#39;s Performance Art(广州赛区网赛)(线段树)

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. Becaus

2014 网选 广州赛区 hdu 5023 A Corrupt Mayor&#39;s Performance Art

1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include<algorithm> 5 #define N 1000005 6 using namespace std; 7 8 int c[35]; 9 int tree[N*4];//正值表示该节点所管理的区间的颜色是纯色,-1表示的是非纯色 10 int n, m; 11 12 void buildT(int ld, int