bzoj 3531 旅行

动态开点线段树+树链剖分  对于每一种宗教信仰都开一颗线段树

　　空间： QlogN 即每一次修改都只会改变logN 个点

　　时间 O(QlogN)  naive题  边没有开两倍  QAQ

bzoj 3531

 #include <bits/stdc++.h>
 using namespace std;

 inline int read()
 {
     int x=,f=;
     char ch=getchar();
     while(ch<''||ch>'')
     {
         if(ch=='-')f=-;
         ch=getchar();
     }
     while(ch>=''&&ch<='')
     {
         x=x*+ch-'';
         ch=getchar();
     }
     return x*f;
 }
 int ee=,st[],fa[],top[],son[],lastadd;
 int n,q,belif[],weight[],size[],dep[],cnt,pl[];
 struct edge
 {
     int v,next;
 } vs[];
 inline void addedge(int u,int v)
 {
     vs[++ee].v=v;
     vs[ee].next=st[u];
     st[u]=ee;
 }
 struct treenode
 {
     int l,r,mx,sum;
 } tree[];
 treenode operator+(treenode a,treenode b)
 {
     treenode tmp;
     tmp.sum=a.sum+b.sum;
     tmp.mx=max(a.mx,b.mx);
     return tmp;
 }
 void modify(int q,int x,int l,int r,int rt)
 {
     if(l==r)
     {
         tree[rt].mx=x;
         tree[rt].sum=x;
         return ;
     }
     int mid=(l+r)>>;
     if(mid>=q)
     {
         if(!tree[rt].l) tree[rt].l=++cnt;
         modify(q,x,l,mid,tree[rt].l);
     }
     if(mid<q)
     {
         if(!tree[rt].r) tree[rt].r=++cnt;
         modify(q,x,mid+,r,tree[rt].r);
     }
     tree[rt].sum=tree[tree[rt].l].sum+tree[tree[rt].r].sum;
     tree[rt].mx=max(tree[tree[rt].l].mx,tree[tree[rt].r].mx);
 }
 treenode query(int L,int R,int l,int r,int rt)
 {
     if(L<=l&&r<=R) return tree[rt];
     int mid=(l+r)>>;
     if(mid>=R) return query(L,R,l,mid,tree[rt].l);
     if(mid<L) return query(L,R,mid+,r,tree[rt].r);
     return query(L,R,l,mid,tree[rt].l)+query(L,R,mid+,r,tree[rt].r);
 }
 void dfs1(int rt)
 {
     size[rt]=;
     for(int i=st[rt]; i; i=vs[i].next)
     {
         if(fa[rt]==vs[i].v) continue;
         fa[vs[i].v]=rt;
         dep[vs[i].v]=dep[rt]+;
         dfs1(vs[i].v);
         size[rt]+=size[vs[i].v];
         if(size[son[rt]]<size[vs[i].v])
             son[rt]=vs[i].v;
     }
 }
 void dfs2(int rt)
 {
     pl[rt]=++lastadd;
     if(son[rt])
     {
         top[son[rt]]=top[rt];
         dfs2(son[rt]);
     }
     for(int i=st[rt]; i; i=vs[i].next)
     {
         if(vs[i].v==fa[rt]||son[rt]==vs[i].v) continue;
         dfs2(vs[i].v);
     }
 }
 void op(int &a,treenode b,int tp)
 {
     if(tp==) a=max(a,b.mx);
     else a+=b.sum;
 }
 void calans(int x,int y,int tp)
 {
     int f1=top[x],f2=top[y];
     if(dep[f1]>dep[f2])
         swap(x,y),swap(f1,f2);
     int ans=,rt=belif[x];
     while(f1!=f2)
     {
         treenode tt=query(pl[f2],pl[y],,n,rt);
         op(ans,tt,tp);
         y=fa[f2];
         f2=top[y];
         if(dep[f1]>dep[f2]) swap(f1,f2),swap(x,y);
     }
     if(dep[x]>dep[y]) swap(x,y);
     treenode tt=query(pl[x],pl[y],,n,rt);
     op(ans,tt,tp);
     printf("%d\n",ans);
 }
 void cgbelif(int x,int y)
 {
     modify(pl[x],,,n,belif[x]);
     belif[x]=y;
     modify(pl[x],weight[x],,n,belif[x]);
 }
 void cgwight(int x,int y)
 {
     modify(pl[x],weight[x]=y,,n,belif[x]);
 }
 int main()
 {
     cnt=;
     n=read();
     q=read();
     for(int i=; i<=n; i++)
         top[i]=i;
     for(int i=; i<=n; i++)
     {
         weight[i]=read();
         belif[i]=read();
     }
     for(int i=; i<n; i++)
     {
         int a=read(),b=read();
         addedge(a,b);
         addedge(b,a);
     }
     dfs1();
     dfs2();
     for(int i=; i<=n; i++)
         modify(pl[i],weight[i],,n,belif[i]);
     for(int i=; i<=q; i++)
     {
         char sd[];
         scanf("%s",sd);
         int x=read(),y=read();
         if(sd[]=='Q')
         {
             if(sd[]=='M') calans(x,y,);
             else calans(x,y,);
         }
         else if(sd[]=='C')
         {
             if(sd[]=='C') cgbelif(x,y);
             else cgwight(x,y);
         }
     }
     return ;
 }

蛤鸡附上 dmk

dmk_GG  好像有点问题QWQ

 #include <bits/stdc++.h>
 #define N 30010
 #define Q 30010
 #define C 1000
 using namespace std;

 int bf[N+],wt[N+],sign[N+];
 vector <int> xx[N+];
 char ch[][]= {{'Q','S','\0'},{'Q','S','\0'},{'C','C','\0'},{'C','W','\0'}};
 int main()
 {
     srand(time());
     freopen("read.in","w",stdout);
     printf("%d %d\n",N,Q);
     for(int i=; i<=N; i++)
     {
         bf[i]=rand()%C+;
         xx[bf[i]].push_back(i);
         wt[i]=rand()%;
     }
     for(int i=; i<=N; i++)
         printf("%d %d\n",wt[i],bf[i]);
     sign[]=;
     sign[]=;
     printf("%d %d\n",,);
     for(int i=; i<N-; i++)
     {
         int x=rand()%N+,y=rand()%N+;
         while(!sign[x]) x=rand()%N+;
         while(sign[y]) y=rand()%N+;
         printf("%d %d\n",x,y);
         sign[y]=;
     }
     for(int i=; i<=Q; i++)
     {
         int ty=rand()%;
         puts(ch[ty]);
         if(ty==||ty==)
         {
             int x=rand()%N+,y=rand()%C+;
             printf("%d %d\n",x,y);
             if(ty==)
             {
                 for(int j=; j<=(int)xx[bf[x]].size(); j++)
                     if(xx[bf[x]][j]==x)
                         xx[bf[x]].erase(xx[bf[x]].begin()+j);
                 bf[x]=y;
             }

         }
         if(ty==||ty==)
         {
             int x=rand()%N+;
             while(xx[bf[x]].size()==)
                 x=rand()%N+;
             printf("%d %d\n",x,xx[bf[x]][rand()%xx[bf[x]].size()]);
         }
     }
     return ;
 }