求助

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long l;
typedef bool b;
l n, q, lef[1000005], rig[1000005], now;
char lx[1000005];
b f[1000005], a[1000005], ans;
struct Stact
{
    l x[100005];
    l t = 0;
    void push(l v)
    {
        t++;
        x[t] = v;
    }
    void pop()
    {
        t--;
    }
    l top()
    {
        return x[t];
    }
} st;
string s;

int main()
{
    getline(cin, s);
    scanf("%lld", &n);
    now = n;
    for (l i = 1; i <= n; ++i)
    {
        scanf("%d", &a[i]);
        lx[i] = 0;
    }
    for (l i = 0; i < s.size(); ++i)
    {
        if (s[i] == '&')
        {
            lx[++now] = '&';
            rig[now] = st.top();
            st.pop();
            lef[now] = st.top();
            st.pop();
            a[now] = a[lef[now]] && a[rig[now]];
            st.push(now);
        }
        if (s[i] == '|')
        {
            lx[++now] = '|';
            rig[now] = st.top();
            st.pop();
            lef[now] = st.top();
            st.pop();
            a[now] = a[lef[now]] || a[rig[now]];
            st.push(now);
        }
        if (s[i] == '!')
        {
            lx[++now] = '!';
            lef[now] = st.top();
            st.pop();
            a[now] = !a[lef[now]];
            st.push(now);
        }
        if (s[i] == 'x')
        {
            l v = 0;
            i++;
            while (s[i] != ' ')
            {
                v = v * 10 + (l)(s[i] - '0');
                i++;
            }
            st.push(v);
        }
    }
    ans = a[st.t];
    f[now] = 1;
    for (l i = now; i > n; --i)
    {
        if (lx[i] == '&')
        {
            if (((!a[lef[i]]) && a[rig[i]]) != a[i]) f[lef[i]] = f[i];
            if ((a[lef[i]] && (!a[rig[i]])) != a[i]) f[rig[i]] = f[i];
        }
        else if (lx[i] == '|')
        {
            if (((!a[lef[i]]) || a[rig[i]]) != a[i]) f[lef[i]] = f[i];
            if ((a[lef[i]] || (!a[rig[i]])) != a[i]) f[rig[i]] = f[i];
        }
        else f[lef[i]] = f[i];
    }
    scanf("%lld", &q);
    for (l i = 1; i <= q; ++i)
    {
        l t;
        scanf("%lld", &t);
        printf("%d\n", f[t] ^ ans);
    }
    return 0;
}