POJ-2528 Mayor's posters (离散+线段树 区间修改 区间查询)
来源:互联网 发布:mooc字幕组知乎 编辑:程序博客网 时间:2024/06/04 23:24
Mayor's posters
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 70791 Accepted: 20416
Description
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for placing the posters and introduce the following rules:
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
- Every candidate can place exactly one poster on the wall.
- All posters are of the same height equal to the height of the wall; the width of a poster can be any integer number of bytes (byte is the unit of length in Bytetown).
- The wall is divided into segments and the width of each segment is one byte.
- Each poster must completely cover a contiguous number of wall segments.
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
Input
The first line of input contains a number c giving the number of cases that follow. The first line of data for a single case contains number 1 <= n <= 10000. The subsequent n lines describe the posters in the order in which they were placed. The i-th line among the n lines contains two integer numbers li and ri which are the number of the wall segment occupied by the left end and the right end of the i-th poster, respectively. We know that for each 1 <= i <= n, 1 <= li <= ri <= 10000000. After the i-th poster is placed, it entirely covers all wall segments numbered li, li+1 ,... , ri.
Output
For each input data set print the number of visible posters after all the posters are placed.
The picture below illustrates the case of the sample input.
The picture below illustrates the case of the sample input.
Sample Input
151 42 68 103 47 10
Sample Output
4
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define maxn 10001int cnt[maxn << 2], l[maxn], r[maxn], c[maxn << 3], ls[maxn << 2];void pushdown(int o, int l, int r){if(l == r || c[o] == -1) return;c[o << 1] = c[o];c[o << 1 | 1] = c[o];c[o] = -1;}void add(int o, int l, int r, int L, int R, int v){pushdown(o, l, r);if(l >= L && r <= R){c[o] = v; return;}int mid = l + r >> 1;if(mid >= L) add(o << 1, l, mid, L, R, v);if(mid < R) add(o << 1 | 1, mid + 1, r, L, R, v);}int query(int o, int l, int r){int ans = 0;if(c[o] != -1){if(cnt[c[o]] == 0){ans++;cnt[c[o]] = 1;}return ans;}if(l == r) return ans;int mid = l + r >> 1;ans += query(o << 1, l, mid);ans += query(o << 1 | 1, mid + 1, r);return ans;}int main(){int T;scanf("%d", &T);while(T--){memset(cnt, 0, sizeof(cnt));memset(c, -1, sizeof(c));int n, tot = 0, m, num;scanf("%d", &n);for(int i = 1; i <= n; ++i){scanf("%d %d", &l[i], &r[i]);ls[++tot] = l[i];ls[++tot] = r[i];}sort(ls + 1, ls + 1 + tot);m = num = unique(ls + 1, ls + 1 + tot) - ls;for(int i = 1; i < num; ++i){if(ls[i] - ls[i - 1] > 1){ls[m++] = ls[i - 1] + 1;}}sort(ls + 1, ls + m);int x, y;for(int i = 1; i <= n; ++i){x = lower_bound(ls + 1, ls + m, l[i]) - ls;y = lower_bound(ls + 1, ls + m, r[i]) - ls;add(1, 1, m, x, y, i);}printf("%d\n", query(1, 1, m));}}/*题意:1e7的区间,按顺序对不同区间刷不同颜色(自己YY的),问最后整个区间有多少不同颜色。思路:线段树区间修改区间查询。需要考虑的是区间长度过大,需要离散化一下,离散的时候一定注意如果差值大于2的情况不要让它们离散后连续了,比如[1,2],[4,5]很可能离散成[1,2],[3,4],这样会导致答案错误。*/
阅读全文
0 0
- POJ-2528 Mayor's posters (离散+线段树 区间修改 区间查询)
- POJ.2528 Mayor's posters (线段树 区间更新 区间查询 离散化)
- poj 2528 Mayor's posters (线段树+区间离散)
- POJ 2528 Mayor's posters 区间离散化线段树
- poj 2528 Mayor's posters(线段树+区间离散化)
- POJ-2528Mayor's posters(离散+线段树区间覆盖)
- POJ 2528 Mayor's posters(线段树区间修改+离散化)
- POJ 2528 Mayor's posters ( 线段树 : 区间修改 + 离散化 )
- 线段树区间更新,区间统计+离散化 POJ 2528 Mayor's posters
- POJ 2528 Mayor's posters (区间离散化、线段树区间染色)
- poj 2528 Mayor's posters 线段树+离散化 区间更新
- poj 2528 Mayor's posters(线段树+离散化+区间统计)
- poj 2528 Mayor's posters(线段树区间更新+离散化)经典题目,较难。。。
- POJ 2528 Mayor's posters(离散化+区间set线段树)
- POJ 2528 Mayor's posters 线段树离散化+区间更新
- POJ 2528-Mayor's posters(线段树区间更新+离散化)
- POJ 2528 Mayor's posters 线段树的区间覆盖 离散化
- POJ 2528 Mayor's posters (离散化+线段树区间更新)
- 稀疏矩阵存储格式总结
- 使用gitblit在windows上部署git服务器
- 全网优秀IT博客导航
- 实现安全的缓存更新方法
- Java 学习笔记 开发环境搭建JDK+Tomcat+Eclipse
- POJ-2528 Mayor's posters (离散+线段树 区间修改 区间查询)
- 素数
- 第四讲 变量与标识符及基本数据类型和转换详解
- 前端小知识
- ftp安装部署
- PHPstudy + phpstorm 配置xdebug
- 培训:基于Kubernetes的DevOps实践
- JAVA中循环删除list中元素的方法总结
- Funtainer:容器即函数之美