http://poj.org/problem?id=2528
题意:基本和上一题板子上涂颜色一样,只不过这题数据量超大。。
思路:把一条条线段离散化。这题的离散化原理:题中区间:[1,4][2,6][8,10][3,4][7,10],排序去重后变成
1,2,3,4,6,7,8,10
赋其序号为1,2,3,4,5,6,7,8这样就减少了空间,但是不影响线段划分。将新的线段树排起建树,按照上一题涂颜色处理即可。
但是要注意一点,不可过多遍历n,因为n很大,所以在查询期间就要统计完毕。一下子想不到方法看别人的,原来是在查询中遍历查找求和,受教了。。
AC代码:
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <string.h>
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 100010;
const int INF = 1e8;
struct line
{
int l;
int r;
int kind;
}tree[4*N];
struct node
{
int start;
int endd;
}seg[4*N];
bool mark[N];
int tmp[N];//代表被离散的数组,数组元素为横坐标的值
int f[10000010];
void build(int i, int l, int r)
{
tree[i].l = l;
tree[i].r = r;
tree[i].kind = 1;
if(l == r) return;
int mid = (l + r) >> 1;
build(i*2, l, mid);
build(i*2+1, mid+1, r);
}
int query(int i, int l, int r)
{
if(tree[i].l == l && tree[i].r == r)
{
if(tree[i].kind != -1 && !mark[tree[i].kind])
{
mark[tree[i].kind] = true;
return 1;
}
else if(tree[i].kind == -1)
{
int mid = (tree[i].l + tree[i].r) >> 1;
return query(i*2, tree[i].l, mid) + query(i*2+1, mid+1, tree[i].r);
}
else return 0;
}
int mid = (tree[i].l + tree[i].r) >> 1;
if(mid >= r) query(i*2, l, r);
else if(mid < l) query(i*2+1, l, r);
else
{
query(i*2, l, mid) + query(i*2+1, mid+1, r);
}
}
void update(int i, int l, int r, int kind)
{
if(tree[i].l == l && tree[i].r == r)
{
tree[i].kind = kind;
return;
}
if(tree[i].kind != -1)//已经搜索到这一点了但没有执行上个条件就说明不是想要的结果,这个节点就没有价值了,将价值传到子节点
{
tree[i*2].kind = tree[i].kind;
tree[i*2+1].kind = tree[i].kind;
tree[i].kind = -1;
}
int mid = (tree[i].l + tree[i].r) >> 1;
if(mid >= r) update(i*2, l, r, kind);
else if(mid < l) update(i*2+1, l, r, kind);
else
{
update(i*2, l, mid, kind);
update(i*2+1, mid+1, r, kind);
}
}
int main()
{
// freopen("in.txt", "r", stdin);
int test, n;
char s[5];
scanf("%d", &test);
while(test--)
{
scanf("%d", &n);
int np = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d%d", &seg[i].start, &seg[i].endd);
tmp[np++] = seg[i].start;
tmp[np++] = seg[i].endd;
}
sort(tmp, tmp+np);
int k = 1;
for(int i = 1; i < np; i++)
{
while(tmp[k-1] == tmp[i])
{
i++;
if(i == np) break;
}
if(i == np) break;
tmp[k++] = tmp[i];
}
np = k;
for(int i = 0; i < np; i++)
{
f[tmp[i]] = i+1;
}
build(1, 1, np);
for(int i = 1; i <= n; i++)
{
update(1, f[seg[i].start], f[seg[i].endd], i);
}
memset(mark, false, sizeof(mark));
int ans = query(1, 1, np);
printf("%d\n", ans);
}
return 0;
}
超时代码:
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <string.h>
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 100010;
const int INF = 1e8;
struct line
{
int l;
int r;
int kind;
}tree[4*N];
struct node
{
int start;
int endd;
}seg[4*N];
bool mark[N];
int tmp[N];
int f[10000010];
void build(int i, int l, int r)
{
tree[i].l = l;
tree[i].r = r;
tree[i].kind = 1;
if(l == r) return;
int mid = (l + r) >> 1;
build(i*2, l, mid);
build(i*2+1, mid+1, r);
}
void query(int i, int l, int r)
{
if(tree[i].kind > 0)
{
mark[tree[i].kind] = true;
return;
}
int mid = (tree[i].l + tree[i].r) >> 1;
if(mid >= r) query(i*2, l, r);
else if(mid < l) query(i*2+1, l, r);
else
{
query(i*2, l, mid);
query(i*2+1, mid+1, r);
}
}
void update(int i, int l, int r, int kind)
{
if(tree[i].l == l && tree[i].r == r)
{
tree[i].kind = kind;
return;
}
if(tree[i].kind != -1)//已经搜索到这一点了但没有执行上个条件就说明不是想要的结果,这个节点就没有价值了,将价值传到子节点
{
tree[i*2].kind = tree[i].kind;
tree[i*2+1].kind = tree[i].kind;
tree[i].kind = -1;
}
int mid = (tree[i].l + tree[i].r) >> 1;
if(mid >= r) update(i*2, l, r, kind);
else if(mid < l) update(i*2+1, l, r, kind);
else
{
update(i*2, l, mid, kind);
update(i*2+1, mid+1, r, kind);
}
}
int main()
{
// freopen("in.txt", "r", stdin);
int test, n;
char s[5];
scanf("%d", &test);
while(test--)
{
scanf("%d", &n);
int np = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d%d", &seg[i].start, &seg[i].endd);
tmp[np++] = seg[i].start;
tmp[np++] = seg[i].endd;
}
sort(tmp, tmp+np);
int k = 1;
for(int i = 1; i < np; i++)
{
while(tmp[k-1] == tmp[i])
{
i++;
if(i == np) break;
}
if(i == np) break;
tmp[k++] = tmp[i];
}
np = k;
for(int i = 0; i < np; i++)
{
f[tmp[i]] = i+1;
}
build(1, 1, np);
for(int i = 1; i <= n; i++)
{
update(1, f[seg[i].start], f[seg[i].endd], i);
}
memset(mark, 0, sizeof(mark));
for(int i = 1; i <= n; i++)
{
query(1, f[seg[i].start], f[seg[i].endd]);
}
int ans = 0;
for(int i = 1; i <= n; i++)
{
if(mark[i]) ans++;
}
printf("%d\n", ans);
}
return 0;
}