裸的ODT
#include <bits/stdc++.h>
const int maxn=1e5+5;
#define IT std::set<node>::iterator
int n,q;
struct node
{
int l,r;
mutable long long val;
node(int L, int R=-1, long long V=0):l(L), r(R), val(V) {}
bool operator<(const node& o) const
{
return l < o.l;
}
};
std::set<node> s;
//split(pos)操作是指将原来含有pos位置的节点分成两部分:[l,pos?1]和[pos,r]
inline IT split(int pos)
{
IT it = s.lower_bound(node(pos));
if (it != s.end() && it->l == pos) return it;
--it;
int L = it->l, R = it->r;
long long V = it->val;
s.erase(it);
s.insert(node(L, pos-1, V));
return s.insert(node(pos, R, V)).first;
//这里利用了pair<iterator,bool> insert (const value_type& val)的返回值
}
//assign操作迅速减小set的规模
inline void assign_val(int l, int r, int val)//区间全部赋值
{
IT itr = split(r+1), itl = split(l);
s.erase(itl, itr);
//void erase (iterator first, iterator last)可删除[first,last)区间
s.insert(node(l, r, val));
}
inline long long querysum(int l,int r)//区间求和
{
IT itr = split(r+1),itl = split(l);
long long res=0;
for(;itl!=itr;itl++)
res+=(itl->r-itl->l+1)*itl->val ;
return res;
}
inline long long solve(int l,int r)
{
long long ans=0;
IT itr=split(r+1),itl=split(l);
std::set<long long>tmp;
for(;itl!=itr;itl++) tmp.insert(itl->val);
for(auto &it:tmp)if(it!=0)ans++;
return ans;
}
int main()
{
scanf("%d%d",&n,&q);
s.insert(node(1,n,1));
while(q--)
{
int op,l,r;scanf("%d%d%d",&op,&l,&r);
if(op==1)
{
assign_val(l,r,1);
}
if(op==2)
{
long long tmp=querysum(l,r);
assign_val(l,r-1,0);
assign_val(r,r,tmp);
}
if(op==3)printf("%lld\n",solve(l,r));
}
return 0;
}