Queries on a String Gym - 101755L

https://cn.vjudge.net/problem/Gym-101755L

#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 1e18
#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=2e5+9;
const int mod=1e9+7;

char s[maxn];
int nex[maxn][30];
int main()
{
    //FAST_IO;

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


    while(~scanf("%s",s+1))
    {
        mem(nex,0);
        int len=strlen(s+1);

        for(int i=len;i>=1;i--)
        {
            for(int j=0;j<26;j++)
            {
                nex[i-1][j]=nex[i][j];
            }
            nex[i-1][s[i]-'a']=i;
        }

        int now=0;
        int q;
        sfi(q);
        stack<int>st;
        while(q--)
        {
            char op[10];
            scanf("%s",op);
            //cout<<op<<endl;
            if(op[1]=='u')
            {
                char x[5];
                scanf("%s",x);
                //cout<<x<<endl;
                int id=x[0]-'a';
                //cout<<now<<endl;
                if(nex[now][id]==0)
                {
                    st.push(-1);
                }
                else
                {
                    if(st.empty()||(!st.empty()&&st.top()!=-1))
                    {
                        now=nex[now][id];
                        st.push(now);
                    }
                    else
                    {
                        st.push(-1);
                    }

                }

                if(!st.empty()&&st.top()==-1)
                {
                    puts("NO");
                }
                else
                {
                    puts("YES");
                }
            }
            else
            {
                st.pop();
                if(st.empty()) now=0;
                if(!st.empty()&&st.top()!=-1) now=st.top();
                if(!st.empty()&&st.top()==-1) puts("NO");
                else puts("YES");
            }
        }

    }

    return 0;
}