Gangsters in Central City Gym - 101142G

https://vjudge.net/problem/Gym-101142G 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int mod=1e9+7;

vector<int>g[maxn];
set<int>st[maxn];

int deep[maxn];
bool vis[maxn];

int fa[maxn][30];
int id;
int son[maxn],siz[maxn];
int pos[maxn],dfn[maxn];
int gfa[maxn];

void dfs(int u,int f,int rt2)
{
    dfn[u]=++id;
    pos[id]=u;
    vis[u]=1;
    fa[u][0]=f;
    deep[u]=deep[f]+1;

    if(deep[u]==2)
    {
        rt2=u;
    }
    if(rt2) gfa[u]=rt2;

    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i];
        if(v==f) continue;
        if(vis[v]) continue;
        dfs(v,u,rt2);
        son[u]+=siz[v];
    }

    if(!son[u]) siz[u]=1;
    else siz[u]=son[u];
}

void addedge(int u,int v)
{
    g[u].pb(v);
}

int LCA(int u,int v)
{
    if(deep[u]<deep[v]) swap(u,v);
    for(int i=25;i>=0;i--) if(deep[fa[u][i]]>=deep[v]) u=fa[u][i];
    if(u==v) return u;
    for(int i=25;i>=0;i--) if(fa[u][i]!=fa[v][i]) u=fa[u][i],v=fa[v][i];
    return fa[u][0];
}

int ans1,ans2;
int num1[maxn],num2[maxn],cnt[maxn];
int n,q;
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    freopen("gangsters.in","r",stdin);
    freopen("gangsters.out","w",stdout);

    while(~scanf("%d%d",&n,&q))
    {
        for(int i=0;i<=n;i++) g[i].clear(),st[i].clear(),num1[i]=num2[i]=cnt[i]=0;
        ans1=0,ans2=0;

        for(int i=2;i<=n;i++)
        {
            int x;
            sfi(x);

            addedge(i,x);
            addedge(x,i);

        }

        fa[1][0]=0;
        dfs(1,0,0);
        for(int j=1;j<=25;j++)
        {
            for(int i=1;i<=n;i++)
                fa[i][j]=fa[fa[i][j-1]][j-1];
        }


        while(q--)
        {
            char op[3];
            int u;
            scanf("%s%d",op,&u);

            int rt=gfa[u];

            if(op[0]=='+')
            {
                if(st[rt].empty()) ans1++;
                else ans2-=num2[rt];
                st[rt].insert(dfn[u]);
                int lca=LCA(pos[*st[rt].begin()],pos[*st[rt].rbegin()]);
                num1[rt]++;
                num2[rt]=siz[lca]-num1[rt];
                ans2+=num2[rt];

            }
            else
            {
                ans2-=num2[rt];
                num2[rt]=0;
                st[rt].erase(dfn[u]);
                num1[rt]--;
                if(st[rt].empty()) ans1--,cnt[rt]=0;
                else
                {
                    int lca=LCA(pos[*st[rt].begin()],pos[*st[rt].rbegin()]);
                    num2[rt]=siz[lca]-num1[rt];
                    ans2+=num2[rt];
                }
            }

            printf("%d %d\n",ans1,ans2);
        }
    }

    return 0;
}