POJ 2528 Mayor's posters 并查集+离散化做法
2015-08-03 19:23
316 查看
Mayor's posters
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:
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.
Sample Input
Alberta Collegiate Programming Contest 2003.10.18
题目链接:http://poj.org/problem?id=2528
题意:n(n<=10000)个人依次贴海报,给出每张海报所贴的范围li,ri(1<=li<=ri<=10000000)。
求出最后还能看见多少张海报。
思路:一道线段树的题目,YY种并查集的做法,效果还可以。
AC代码:(47ms)
1 #include <iostream>
2 #include <map>
3 #include <cstdio>
4#include <algorithm>
5 #include <vector>
6 using namespace std;
7 #define MAXN 20100
8 int t, n, a, b;
9 vector<int> tmp;
vector<pair<int,int> > V;
int f[MAXN];
void Init() {
V.clear();
tmp.clear();
for(int i = 0; i < MAXN; ++i)
f[i]=i;
}
int find_set(int x) {
if(x != f[x]) f[x] = find_set(f[x]);
return f[x];
}
int get_index(int key) {
return lower_bound(tmp.begin(), tmp.end(), key) - tmp.begin() + 1;
}
int main() {
cin >> t;
while(t--) {
Init();
scanf("%d",&n);
while(n--) {
scanf("%d%d", &a, &b);
V.push_back(make_pair(a, b));
tmp.push_back(a);
tmp.push_back(b);
}
sort(tmp.begin(), tmp.end());
tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
for(int i = 0; i < V.size(); ++i) {
pair<int,int> &P = V[i];
P.second = get_index(P.second);
P.first = get_index(P.first);
}
int ans = 0;
for(int i = V.size() - 1; i >= 0; i--) {
pair<int, int> &P = V[i];
bool flag = false;
for(int i = P.first; i <= P.second; i = find_set(i)) {
if(i == f[i]) {
flag = true;
f[i] = i + 1;
i++;
}
}
if(flag) ans++;
}
printf("%d\n",ans);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 49767 | Accepted: 14434 |
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:
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.
Sample Input
1 5 1 42 6 8 10 3 47 10Sample Output
4Source
Alberta Collegiate Programming Contest 2003.10.18
题目链接:http://poj.org/problem?id=2528
题意:n(n<=10000)个人依次贴海报,给出每张海报所贴的范围li,ri(1<=li<=ri<=10000000)。
求出最后还能看见多少张海报。
思路:一道线段树的题目,YY种并查集的做法,效果还可以。
AC代码:(47ms)
1 #include <iostream>
2 #include <map>
3 #include <cstdio>
4#include <algorithm>
5 #include <vector>
6 using namespace std;
7 #define MAXN 20100
8 int t, n, a, b;
9 vector<int> tmp;
vector<pair<int,int> > V;
int f[MAXN];
void Init() {
V.clear();
tmp.clear();
for(int i = 0; i < MAXN; ++i)
f[i]=i;
}
int find_set(int x) {
if(x != f[x]) f[x] = find_set(f[x]);
return f[x];
}
int get_index(int key) {
return lower_bound(tmp.begin(), tmp.end(), key) - tmp.begin() + 1;
}
int main() {
cin >> t;
while(t--) {
Init();
scanf("%d",&n);
while(n--) {
scanf("%d%d", &a, &b);
V.push_back(make_pair(a, b));
tmp.push_back(a);
tmp.push_back(b);
}
sort(tmp.begin(), tmp.end());
tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
for(int i = 0; i < V.size(); ++i) {
pair<int,int> &P = V[i];
P.second = get_index(P.second);
P.first = get_index(P.first);
}
int ans = 0;
for(int i = V.size() - 1; i >= 0; i--) {
pair<int, int> &P = V[i];
bool flag = false;
for(int i = P.first; i <= P.second; i = find_set(i)) {
if(i == f[i]) {
flag = true;
f[i] = i + 1;
i++;
}
}
if(flag) ans++;
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- win8系统安装Oracle 11g报错:[INS-13001]环境不满足最低要求--解决办法
- 多态小结
- HDU 2689 Sort it (树状数组)
- POJ 2528 Mayor's posters 并查集+离散化做法
- linux编程出错: Value too large for defined data type.doc
- 凸n+2边形进行三角形分割(只连接顶点对形成n个三角形)数:
- 拓扑排序 SRM 660 Div2 Medium: PrivateD2party
- LA 4256 DP Salesmen
- Linux启动新进程的几种方法及比较
- 线段树成段更新及懒散标记
- can’t help doing还是can’t help to do
- 母港TOP用新API_url = "api_port/port";20150803
- 母港TOP用新API_url = "api_port/port";20150803
- Android ViewFlipper用法浅析
- 瞎扯大数据
- C++ 计蒜客算法基础入门最长上升子序列
- 指针函数与函数指针的区别
- c/c++----------虚函数、虚继承、纯虚函数
- linuxmint 下开启和关闭防火墙
- eclipse + redis + python