题目链接:点击这里
题目大意:
多组输入,每组给出
n
n
n 个区间,依次向一面墙上染不同的色,问染色后墙上能看见几种颜色
题目分析:
经典线段树染色问题,因为值域有点大,可以先离散化一下,然后加一个标记来判断是否被染色,最后用一个
s
e
t
set
set 统计有多少种颜色即可,记得不要加入
0
0
0
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
vector<int>vpos;
set<int>st;
struct position {
int l,r;
}pos[maxn];
struct node{
int val;
bool flag;//判断是否被覆盖过
}a[maxn<<2];
void pushdown(int root,int l,int r)
{
if(a[root].flag)
{
a[root].flag = false;
a[root<<1].flag = true;
a[root<<1|1].flag = true;
a[root<<1].val = a[root].val;
a[root<<1|1].val = a[root].val;
}
}
void build(int root,int l,int r)
{
a[root].flag = true;
if(l == r) return ;
int mid = l+r>>1;
build(root<<1,l,mid);
build(root<<1|1,mid+1,r);
}
void update(int root,int l,int r,int ql,int qr,int val)
{
if(l>qr || r<ql) return ;
if(l>=ql && r<=qr)
{
a[root].val = val;
a[root].flag = true;
return ;
}
pushdown(root,l,r);
int mid = l+r>>1;
update(root<<1,l,mid,ql,qr,val);
update(root<<1|1,mid+1,r,ql,qr,val);
}
void query(int root,int l,int r,int ql,int qr)
{
if(l == r || a[root].flag)
{
if(a[root].val)
st.insert(a[root].val);
return ;
}
pushdown(root,l,r);
int mid = l+r>>1;
query(root<<1,l,mid,ql,qr);
query(root<<1|1,mid+1,r,ql,qr);
}
int main()
{
int t = read();
while(t--)
{
vpos.clear();
st.clear();
int n = read();
for(int i = 1;i <= n;i++)
{
pos[i].l = read();
pos[i].r = read();
vpos.push_back(pos[i].l);
vpos.push_back(pos[i].r);
}
sort(vpos.begin(),vpos.end());
int siz = vpos.size();
for(int i = 1;i < siz;i++)
if(vpos[i]-vpos[i-1] > 1)
vpos.push_back(vpos[i-1]+1);
sort(vpos.begin(),vpos.end());
vpos.erase(unique(vpos.begin(),vpos.end()),vpos.end());
siz = vpos.size();
build(1,1,siz);
for(int i = 1;i <= n;i++)
{
pos[i].l = lower_bound(vpos.begin(),vpos.end(),pos[i].l)-vpos.begin()+1;
pos[i].r = lower_bound(vpos.begin(),vpos.end(),pos[i].r)-vpos.begin()+1;
update(1,1,siz,pos[i].l,pos[i].r,i);
}
query(1,1,siz,1,siz);
printf("%d\n",st.size());
}
return 0;
}