POJ Mayor's posters (线段树成段更新 离散化666)

Mayor's posters

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 1   Accepted Submission(s) : 1

Problem 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 l_i 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 <= l_i <= ri <= 10000000. After the i-th poster is placed, it entirely covers all wall segments numbered l_i, l_i+1 ,... , ri.

 

Output

For each input data set print the number of visible posters after all the posters are placed. <br> <br>The picture below illustrates the case of the sample input. <br><img src=images/2528_1.jpg>

 

Sample Input

  
  

   
   1
5
1 4
2 6
8 10
3 4
7 10

  
  

 

Sample Output

  
  

   
   4

  
  

 

Source

PKU

 

题意：每一行给出一个范围，最后判断出能看到几张海报

思路：能想到是线段树的成段更新，关键是如何统计出有几张能看到的呢，这一题就用到了类似于延迟标记的push_down来得到的，即把每张海报都进行标号，最后有几个标号，就有几张可以看到，难点在于想到数据的离散化，因为数据很大，所以可以把数字往小范围的一对一的对应，就是对数据进行排序，然后去重复的数字，最后再对应数字，

不过问题又来了，对于

1 10

1 4

5 10

和

1 10

1 4

6 10

这两组数据时行不通的，所以这个时候看到大神的代码需要在前后两个数之间大于1的之间在加一个数，来解决这个问题。。。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define Max 13010
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
using namespace std;

int cnt[Max<<4];
int hash[Max<<1];
int X[Max<<2];
int num;

void push_down(int rt)
{
	if(cnt[rt] != -1)
	{
		cnt[rt<<1] = cnt[rt<<1|1] = cnt[rt];
		cnt[rt] = -1;
	}
}

void update(int L,int R,int add,int l,int r,int rt)
{
	if(L<=l && R>=r)
	{
		cnt[rt] = add;
		return ;
	}
	  
	int m = (l+r)>>1;
	push_down(rt);
	
	if(L <= m)
		update(L,R,add,ls);
	if(R > m)
		update(L,R,add,rs);
}

void query(int l,int r,int rt)
{
	if(cnt[rt] != -1)
	{
		if(!hash[cnt[rt]])
			num++;
		hash[cnt[rt]] = 1;
		return ;
	}

	if(l == r)
		return ;

	int m = (l+r)>>1;
	query(ls);
	query(rs);
}

int lisan(int x,int tt)
{
	int l = 1,r = tt-1;
	int i,m;

	while(l <= r)
	{
		m = (l+r)>>1;
		if(X[m] == x)
			return m;

		if(X[m] < x)
			l = m + 1;
		else
			r = m - 1;

	}

	return 0;
}

int main()
{
    int n,m,t,nnn,tt,l,r;
	int i,j,k;
	int x[Max],y[Max];

	scanf("%d",&nnn);

	while(nnn--)
	{
		scanf("%d",&n);
		memset(cnt,-1,sizeof(cnt));
		memset(X,0,sizeof(X));

		num = 0 ;

		for(i=1,k=1;i<=n;i++)
		{
			scanf("%d%d",&x[i],&y[i]);
			X[k++] = x[i];
			X[k++] = y[i];
		}

		sort(X+1,X+k);

		tt=1;
		for(i=1;i<k;i++)//去重复
		{
			if(X[i] != X[i-1])
				X[tt++] = X[i];
		}

		for(i=tt-1;i>=1;i--)
		{
			if(X[i] != X[i-1] + 1)
				X[tt++] = X[i-1] + 1;
		}

		sort(X+1,X+tt);

		for(i=1;i<=n;i++)
		{
			l = lisan(x[i],tt);
			r = lisan(y[i],tt);
			//cout<<l<<" "<<r<<endl;
			update(l,r,i,1,tt-1,1);
		}

		memset(hash,0,sizeof(hash));

		query(1,tt-1,1);

		cout<<num<<endl;
	}

    return 0; 
}