51nod 1981 如何愉快地与STL玩耍（线段树+bitset）

题目：给n(n<=65536)个初始为空的集合set从1....n编号，m(m<=65536)次操作（op,x,y,k）op==1表示把k(k<=1e4)这个数插入到x到y之间的所有集合中；op==2表示查询 x 到 y 区间所有集合中的数字放在一个集合中去重后第k小的元素。

思路：线段树，用bitset压位，线段树 lazy 永久化标记，查询完后二分结果，输入挂+输出挂，交题用Visual C++，还要有运气和交题的勇气，不然你就使劲TLE吧！

#include<cstdio>
#include<cstring>
#include<bitset>
using std::bitset;
using namespace std;
/*------------------------------------------------------------------------------------*/
namespace fastIO {
	#define BUF_SIZE 100000
	//fread -> read
	bool IOerror = 0;
	inline char nc() {
		static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
		if(p1 == pend) {
			p1 = buf;
			pend = buf + fread(buf, 1, BUF_SIZE, stdin);
			if(pend == p1) {
				IOerror = 1;
				return -1;
			}
		}
		return *p1++;
	}
	inline bool blank(char ch) {
		return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
	}
	inline void read(int &x) {
		char ch;
		while(blank(ch = nc()));
		if(IOerror)
			return;
		for(x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0');
	}
	#undef BUF_SIZE
};
using namespace fastIO;
template <class T>
void write(T ret)
{
    if(ret < 0)
    {
        putchar('-');
        ret = -ret;
    }
    if(ret > 9) write(ret/10);
    putchar(ret%10 + '0');
}
/*------------------------------------------------------------------------------------*/
const int maxn=65538;
const int maxc=10002;
struct node{
    bitset<maxc>val,laz;
}a[maxn<<1];
int n,m;
bitset<maxc>ans,pre[maxc];
void update(int rt,int l,int r,int x,int y,int k)
{
    a[rt].val[k]=1;
    if(x<=l&&r<=y)
    {
        a[rt].laz[k]=1;
        return ;
    }
    int mid=(l+r)>>1;
    if(mid>=x) update(rt<<1,l,mid,x,y,k);
    if(mid<y)  update(rt<<1|1,mid+1,r,x,y,k);
}
void query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        ans|=a[rt].val;
        return ;
    }
    ans|=a[rt].laz;
    int mid=(l+r)>>1;
    if(mid>=x) query(rt<<1,l,mid,x,y);
    if(mid<y)  query(rt<<1|1,mid+1,r,x,y);
}
bool check(int pos,int k)
{
    bitset<maxc>tmp;
    tmp=pre[pos]&ans;
    return tmp.count()>=k;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //scanf("%d%d",&n,&m);
    read(n);read(m);
    pre[0][0]=1;
    for(int i=1;i<maxc;i++)
    {
        pre[i]=pre[i-1];
        pre[i][i]=1;
    }
    //build(1,1,n);
    while(m--)
    {
        int op,x,y,k;
        //scanf("%d%d%d%d",&op,&x,&y,&k);
        read(op);read(x);read(y);read(k);
        if(op==1)
            update(1,1,n,x,y,k);
        else
        {
            ans.reset();
            query(1,1,n,x,y);
            if(ans.count()<k||k==0)
                puts("-1");
            else
            {
                int l=k-1,r=maxc-1,kt;
                while(l<r-1)
                {
                    int mid=(l+r)>>1;
                    if(check(mid,k))
                        r=mid;
                    else l=mid;
                }
                kt=r;
                if(check(l,k))
                    kt=l;
                //printf("%d\n",kt);
                write(kt);puts("");
            }
        }
    }
    return 0;
}