//Place your snippets for cpp here. Each snippet is defined under a snippet name and has a prefix, body and 
// description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. Placeholders with the 
// same ids are connected.
// prefix 的格式要求是 acm-[一级标题编号].[二级标题编号][该代码片段的英文简称]
// description 的格式要求是 "插入 [该代码片段的中文名]"

{
    "线段树分治 (可持久化Trie+CDQ) (火星商店问题)": {
        "prefix": "acm-2.6时间分治",
        "body": [
            "#include<algorithm>",
            "#include<cstring>",
            "#include<cstdio>",
            "#include<vector>",
            "#define LL long long",
            "#define Re register int",
            "using namespace std;",
            "const int N=1e5+3,logN=18;",
            "int n,x,y,z,w,op,m1,m2,T,A[N],t1[N],t2[N],Ans[N];",
            "struct Change{int i,v,t;inline bool operator<(const Change &O)const{return i<O.i;}}C[N],tmp[N];",
            "struct Query{int x,l,r,id;}Q[N];",
            "inline void in(Re &x){",
            "    int f=0;x=0;char c=getchar();",
            "    while(c<'0'||c>'9')f|=c=='-',c=getchar();",
            "    while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();",
            "    x=f?-x:x;",
            "}",
            "int pt[N];",
            "struct Trie{",
            "\tint O,cnt[N*(logN+2)],tr[N*(logN+2)][2];",
            "\tinline void insert(Re p,Re q,Re o,Re x){",
            "\t\tif(o<0)return;Re i=(x>>o)&1;",
            "\t\ttr[p][i]=++O,tr[p][i^1]=tr[q][i^1];",
            "\t\tcnt[tr[p][i]]=cnt[tr[q][i]]+1;",
            "\t\tinsert(tr[p][i],tr[q][i],o-1,x);",
            "\t}",
            "\tinline int ask(Re p,Re q,Re o,Re x){",
            "\t\tif(o<0)return 0;Re i=(x>>o)&1;",
            "\t\tif(cnt[tr[q][i^1]]>cnt[tr[p][i^1]])return (1<<o)+ask(tr[p][i^1],tr[q][i^1],o-1,x);",
            "\t\telse return ask(tr[p][i],tr[q][i],o-1,x);",
            "\t}",
            "}T1;",
            "struct Segment_Tree{",
            "\t#define pl (p<<1)",
            "\t#define pr (p<<1|1)",
            "\t#define mid ((L+R)>>1)",
            "\tvector<Query>tr[N<<2];",
            "\tinline void change(Re p,Re L,Re R,Re l,Re r,Query &v){",
            "\t\tif(l>r)return;",
            "\t\tif(l<=L&&R<=r){tr[p].push_back(v);return;}",
            "\t\tif(l<=mid)change(pl,L,mid,l,r,v);",
            "\t\tif(r>mid)change(pr,mid+1,R,l,r,v);",
            "\t}",
            "\tinline int find1(Re l,Re r,Re id){",
            "\t\tif(C[r].i<id)return r+1;",
            "\t\twhile(l<r){",
            "\t\t\tRe Mid=l+r>>1;",
            "\t\t\tif(C[Mid].i>=id)r=Mid;",
            "\t\t\telse l=Mid+1;",
            "\t\t}",
            "\t\treturn r;",
            "\t}",
            "\tinline int find2(Re l,Re r,Re id){",
            "\t\tif(C[r].i<=id)return r+1;",
            "\t\twhile(l<r){",
            "\t\t\tRe Mid=l+r>>1;",
            "\t\t\tif(C[Mid].i>id)r=Mid;",
            "\t\t\telse l=Mid+1;",
            "\t\t}",
            "\t\treturn r;",
            "\t}",
            "\tinline void CDQ(Re p,Re L,Re R,Re l,Re r){",
            "\t\tif(l>r)return;",
            "\t\tT1.O=pt[l-1]=0;",
            "\t\tfor(Re i=l;i<=r;++i)T1.insert(pt[i]=++T1.O,pt[i-1],logN,C[i].v);",
            "\t\tfor(vector<Query>::iterator it=tr[p].begin();it!=tr[p].end();++it){",
            "\t\t\tRe ll=find1(l,r,it->l)-1,rr=find2(l,r,it->r)-1;",
            "\t\t\tif(ll<rr)Ans[it->id]=max(Ans[it->id],T1.ask(pt[ll],pt[rr],logN,it->x));",
            "\t\t}",
            "\t\tif(L==R)return;",
            "\t\tRe p1=l-1;for(Re i=l;i<=r;++i)if(C[i].t<=mid)tmp[++p1]=C[i];",
            "\t\tRe p2=p1;for(Re i=l;i<=r;++i)if(C[i].t>mid)tmp[++p2]=C[i];",
            "\t\tfor(Re i=l;i<=r;++i)C[i]=tmp[i];",
            "\t\tCDQ(pl,L,mid,l,p1),CDQ(pr,mid+1,R,p1+1,r);",
            "\t}",
            "}TR;",
            "int main(){",
            "//\tfreopen(\"123.txt\",\"r\",stdin);",
            "\tin(n),in(T);",
            "\tfor(Re i=1;i<=n;++i)in(A[i]),T1.insert(pt[i]=++T1.O,pt[i-1],logN,A[i]);",
            "\tfor(Re i=1;i<=T;++i){",
            "\t\tin(op),in(x),in(y);",
            "\t\tif(!op)++m1,C[m1]=(Change){x,y,m1};",
            "\t\telse in(z),in(w),++m2,Q[m2]=(Query){z,x,y,m2},t1[m2]=max(1,m1-w+1),t2[m2]=m1;",
            "\t}",
            "\tfor(Re i=1;i<=m2;++i)Ans[i]=T1.ask(pt[Q[i].l-1],pt[Q[i].r],logN,Q[i].x),TR.change(1,1,m1,t1[i],t2[i],Q[i]);",
            "\tsort(C+1,C+m1+1),TR.CDQ(1,1,m1,1,m1);",
            "\tfor(Re i=1;i<=m2;++i)printf(\"%d\\n\",Ans[i]);",
            "}",
            ""
        ],
        "description": "插入 线段树分治 (可持久化Trie+CDQ) (火星商店问题)"
    }
}