题目大意:
就是在一段区间上贴海报, 后来的区间会把前面来的区间覆盖掉, 为贴完海报后能看到几张海报(只看到一部分也算看到)
大致思路:
就是区间替换更新, 标记一下当前区间的所有的海报是否一致, 用懒惰标记标记一下当前区间的类别
听说数据比较水...布吉岛严格的数据下这个代码还能过不= =
代码如下:
Result : Accepted Memory : 908 KB Time : 79 ms
/*
* Author: Gatevin
* Created Time: 2015/8/16 22:05:24
* File Name: Sakura_Chiyo.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
#define maxn 20020
struct Segment_Tree
{
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
int val[maxn << 2];
int flag[maxn << 2];
int ans;
bool vis[maxn / 2];
void pushUp(int rt)
{
if(val[rt << 1] == val[rt << 1 | 1] && val[rt << 1])
val[rt] = val[rt << 1];
else val[rt] = -1;//-1表示颜色不一致
return;
}
void build(int l, int r, int rt)
{
flag[rt] = 0;
if(l == r)
{
val[rt] = 0;//用0表示没有颜色
return;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
pushUp(rt);
}
void pushDown(int l, int r, int rt, int mid)
{
if(flag[rt])
{
flag[rt << 1] = flag[rt << 1 | 1] = flag[rt];
val[rt << 1] = val[rt << 1 | 1] = flag[rt];
flag[rt] = 0;
}
return;
}
void update(int l, int r, int rt, int L, int R, int value)
{
if(l >= L && r <= R)
{
val[rt] = value;
flag[rt] = value;
return;
}
int mid = (l + r) >> 1;
pushDown(l, r, rt, mid);
if(mid >= L) update(lson, L, R, value);
if(mid + 1 <= R) update(rson, L, R, value);
pushUp(rt);
return;
}
void query(int l, int r, int rt, int L, int R)
{
if(l >= L && r <= R && val[rt] != -1)
{
if(!vis[val[rt]])
{
ans++;
vis[val[rt]] = 1;
}
return;
}
int mid = (l + r) >> 1;
pushDown(l, r, rt, mid);
if(mid >= L) query(lson, L, R);
if(mid + 1 <= R) query(rson, L, R);
pushUp(rt);
}
};
Segment_Tree ST;
vector<int> V;
pair<int, int> post[10010];;
int main()
{
int T, n;
scanf("%d", &T);
while(T--)
{
V.clear();
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
scanf("%d %d", &post[i].first, &post[i].second);
V.push_back(post[i].first);
V.push_back(post[i].second);
}
sort(V.begin(), V.end());
for(int i = 1; i <= n; i++)
{
post[i].first = lower_bound(V.begin(), V.end(), post[i].first) - V.begin() + 1;
post[i].second = lower_bound(V.begin(), V.end(), post[i].second) - V.begin() + 1;
}
ST.build(1, 2*n + 2, 1);
for(int i = 1; i <= n; i++)
ST.update(1, 2*n + 2, 1, post[i].first, post[i].second, i);
ST.ans = 0;
memset(ST.vis, 0, sizeof(ST.vis));
ST.vis[0] = 1;
ST.query(1, 2*n + 2, 1, 1, 2*n + 2);
printf("%d\n", ST.ans);
}
return 0;
}