Codeforces Round #442 (Div. 2) Danil and a Part-time Job

http://codeforces.com/contest/877/problem/E

真的菜的不行，自己敲一个模板，到处都是问题。哎

 #include <bits/stdc++.h>
 using namespace std;
 const int maxn = 2e5+;
 #define lson (q<<1)
 #define rson ((q<<1)|1)
 struct node
 {
     int l,r,mid;
     int v,lazy;
 }tree[maxn*];
 int L[maxn],R[maxn],index;
 int vis[maxn] = {};
 int a[maxn];
 vector<int> g[maxn];
 void dfs(int x)
 {
     L[x] = index;
     for(int i=;i<g[x].size();i++)
     {
         int v = g[x][i];
         if(!vis[v])
         {
             vis[v] = ;
             index++;
             dfs(v);
         }
     }
     R[x] = index;
 }
 void push_up(int q)
 {
     tree[q].v = tree[lson].v+tree[rson].v;
 }
 void build(int l,int r,int q)
 {
     tree[q].l = l,tree[q].r = r,tree[q].mid = (l+r)/;
     tree[q].lazy = ;
     if(l==r)
     {
         tree[q].v = a[l];
         //printf("%d %d\n",l,tree[q].v);
         return;
     }
     build(l,tree[q].mid,lson);
     build(tree[q].mid+,r,rson);
     push_up(q);
 }
 void push_down(int q)
 {
     if(tree[q].lazy)
     {
         tree[lson].v = (tree[lson].r-tree[lson].l+)-tree[lson].v;
         tree[rson].v = (tree[rson].r-tree[rson].l+)-tree[rson].v;
         tree[q].lazy ^= ;
         tree[lson].lazy ^= ;
         tree[rson].lazy ^= ;
     }
 }
 void update(int l,int r,int q)
 {
     if(tree[q].l>=l&&tree[q].r<=r)
     {
         tree[q].lazy ^= ;
         tree[q].v = (tree[q].r-tree[q].l+)-tree[q].v;
         return;
     }
     push_down(q);
     if(l<=tree[q].mid) update(l,r,lson);
     if(r>=tree[q].mid+) update(l,r,rson);
     push_up(q); ///v值由下往上更新
 }
 int query(int l,int r,int q)  ///由上及下
 {
     if(tree[q].l>=l&&tree[q].r<=r)
     {
        // printf("%d %d %d %d\n",tree[q].l,tree[q].r,tree[q].v,tree[q].lazy);
         return tree[q].v;
     }
     push_down(q);
     int sum = ;
     if(l<=tree[q].mid) sum += query(l,r,lson);
     if(r>=tree[q].mid+) sum += query(l,r,rson);
     return sum;
 }
 int main()
 {
     int n;scanf("%d",&n);
     for(int i=;i<=n;i++)
     {
         int x;scanf("%d",&x);
         g[x].push_back(i);
         g[i].push_back(x);
     }
     index = ;vis[] = ;
     dfs();
     for(int i=;i<=n;i++)
     {
         int cc;
         scanf("%d",&cc);
         a[L[i]] = cc; ///按dfs序来赋值
     }
     build(,n,);
     int q;scanf("%d",&q);
     while(q--)
     {
         char s[];
         int v;
         scanf("%s %d",s,&v);
         if(s[]=='g')
         {
             printf("%d\n",query(L[v],R[v],));
         }
         else
         {
             update(L[v],R[v],);
         }
     }
     return ;
 }
 /*
 10
 1 2 3 3 5 5 7 7 8
 0 0 0 0 1 1 1 1 0 0
 10
 pow 3
 get 3
 */