ACM学习历程—HDU 5023 A Corrupt Mayor'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.
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
3 4
4 7
4
4 7 8
这道题是用线段树来做的。网上找了比较好的模板看了一下,然后自己来写了一下。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#define maxn 1000005
using namespace std;
struct node
{
int lt, rt, val, turn;
}tree[*maxn];
set < int > ans;
void build (int lt, int rt, int id)
{
tree[id].lt = lt;
tree[id].rt = rt;
tree[id].val = ;
tree[id].turn = ;
if (lt == rt)
return;
int mid = (lt + rt) >> ;
build (lt, mid, id << );
build (mid + , rt, id << | );
}
void updata (int lt, int rt, int id, int col)
{
if (lt <= tree[id].lt && rt >= tree[id].rt)
{
tree[id].val = tree[id].turn = col;
return;
}
if (tree[id].turn != )
{
tree[id<<].turn = tree[id<<].val = tree[id].turn;
tree[id<<|].turn = tree[id<<|].val = tree[id].turn;
tree[id].turn = ;
}
int mid = (tree[id].lt + tree[id].rt) >> ;
if (lt <= mid)
updata (lt, rt, id<<, col);
if (rt > mid)
updata (lt, rt, id<<|, col);
if (tree[id<<].val == tree[id<<|].val)
tree[id].val = tree[id<<].val;
else
tree[id].val = ;
}
void query (int lt, int rt, int id)
{
if (lt > tree[id].rt || rt < tree[id].lt)
return;
if (tree[id].val != )
{
ans.insert(tree[id].val);
return;
}
query (lt, rt, id<<);
query (lt, rt, id<<|);
}
int main()
{
//freopen ("test.txt", "r", stdin);
int n, m;
while (scanf ("%d%d", &n, &m) != EOF && (m+n) != )
{
build (, n, );
for (int times = ; times < m; ++times)
{
char ch;
int xx, yy, col;
getchar();
scanf ("%c%d%d", &ch, &xx, &yy);
if (ch == 'P')
{
scanf ("%d", &col);
updata (xx, yy, , col);
}
else
{
query (xx, yy, );
set < int > :: iterator it;
bool flag = ;
for (it = ans.begin(); it != ans.end(); it++)
{
if (flag)
printf (" ");
printf ("%d", *it);
flag = ;
}
printf ("\n");
ans.clear();
}
}
}
return ;
}
ACM学习历程—HDU 5023 A Corrupt Mayor's Performance Art(广州赛区网赛)(线段树)的更多相关文章
- hdu 5023 A Corrupt Mayor's Performance Art 线段树
A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100 ...
- HDU 5023 A Corrupt Mayor's Performance Art(线段树区间更新)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5023 解题报告:一面墙长度为n,有N个单元,每个单元编号从1到n,墙的初始的颜色是2,一共有30种颜色 ...
- HDU 5023 A Corrupt Mayor's Performance Art 线段树区间更新+状态压缩
Link: http://acm.hdu.edu.cn/showproblem.php?pid=5023 #include <cstdio> #include <cstring&g ...
- HDU 5023 A Corrupt Mayor's Performance Art (据说是线段树)
题意:给定一个1-n的墙,然后有两种操作,一种是P l ,r, a 把l-r的墙都染成a这种颜色,另一种是 Q l, r 表示,输出 l-r 区间内的颜色. 析:应该是一个线段树+状态压缩,但是我用s ...
- 2014 网选 广州赛区 hdu 5023 A Corrupt Mayor's Performance Art
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #d ...
- ACM学习历程—HDU 5459 Jesus Is Here(递推)(2015沈阳网赛1010题)
Sample Input 9 5 6 7 8 113 1205 199312 199401 201314 Sample Output Case #1: 5 Case #2: 16 Case #3: 8 ...
- ACM学习历程——HDU 5014 Number Sequence (贪心)(2014西安网赛)
Description There is a special number sequence which has n+1 integers. For each number in sequence, ...
- hdu - 5023 - A Corrupt Mayor's Performance Art(线段树)
题目原文废话太多太多太多,我就不copyandpaste到这里啦..发个链接吧题目 题目意思就是:P l r c 将区间 [l ,r]上的颜色变成c Q l r 就是打印出区间[l,r ...
- hdu----(5023)A Corrupt Mayor's Performance Art(线段树区间更新以及区间查询)
A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100 ...
随机推荐
- 与webView进行交互,webView小记
本文转载至 http://www.verydemo.com/demo_c101_i46895.html 一.与webView进行交互,调用web页面中的需要传参的函数时,参数需要带单引号,或者双引号( ...
- Conductors(水题)
Conductors Background Everyone making translations from English to Russian knows an English phrase & ...
- PostMan的使用注意事项
1json格式要设置头尾application/json 2body中raw的{"userName":"123","passWord":&q ...
- [note]fhq_treap
fhq_treap 这东西据说是某个叫范浩强的神仙搞出来的, 他的这种treap可以不用旋转并且资磁很多平衡树操作, 复杂度通过随机的键值来保证(树大致平衡,期望一次操作复杂度\(logn\)) 依靠 ...
- KVM虚拟化技术实战全过程
今天准备开始.................... centos安装-kvm 教程: http://www.linuxidc.com/Linux/2017-01/140007.htm http:// ...
- JQuery日记 5.11 Sizzle选择器(五)
//设置当前document和document相应的变量和方法 setDocument = Sizzle.setDocument = function( node ) { var hasCompare ...
- ceph基本架构简述
1. 介绍 云硬盘是IaaS云平台的重要组成部分,云硬盘给虚拟机提供了持久的块存储设备.目前的AWS 的EBS(Elastic Block store)给Amazon的EC2实例提供了高可用高可靠的块 ...
- swift ! 和 ? 的学习
刚开始学 这两个符号 不确定到底是否是可以互相替代 用的都混淆了 今天好好做个总结 如果声明一个变量 如下 var name:String? //只声明 没做初始化赋值 说明 当前name 是 n ...
- iOS 开发规范
公司来了大牛 是绝好的学习机会 今天分享了我们一个代码规范 比如UITableViewCell 1.首先根据这个cell 需要的数据源 建一个数据model ,只针对于 该cell 好处:数据独立 ...
- IOS 代码风格习惯 总结1
从我大三下学期开始工作开始, 几乎都是孤独的开发 因为身边开发ios 不多 ,除了学习开源的代码优秀风格技巧 剩下的 就是自己造, 所以 养成了 好多不好的习惯. 本知道面向对象的好处 ,但是实际开 ...