Pagini recente » Cod sursa (job #1536860) | Cod sursa (job #1535771) | Cod sursa (job #2147371) | Cod sursa (job #1550575) | Cod sursa (job #2643598)
#include <bits/stdc++.h>
#define NMAX 1004
#define ll long long
using namespace std;
int n, lg;
bool val[NMAX];
char expr[NMAX],c;
vector<bool> values;
vector<int> sign;
int i;
void jump(int pos){
i += pos;
while (i < lg && expr[i] == ' ')
i++;
}
void reduct(bool val){
while (!sign.empty()){
if (sign.back() == 3){
val ^= 1;
sign.pop_back();
}
else if (sign.back() == 2){
val |= values.back();
values.pop_back();
sign.pop_back();
}
else if (sign.back() == 1){
val &= values.back();
values.pop_back();
sign.pop_back();
}
else{
break;
}
}
values.push_back(val);
}
bool _is(string word){
if (i + word.size() - 1 >= lg) return false;
for (int j=0;j<word.size();j++){
if (expr[i + j] != word[j])
return false;
}
jump(word.size());
return true;
}
bool solve(){
values.clear();
sign.clear();
i = 0;
while (i < lg){
if (_is("AND")){
sign.push_back(1);
continue;
}
if (_is("OR")){
sign.push_back(2);
continue;
}
if (_is("NOT")){
sign.push_back(3);
continue;
}
if (expr[i] == '('){
sign.push_back(4);
jump(1);
continue;
}
if (expr[i] == ')'){
sign.pop_back();
bool crt = values.back();
values.pop_back();
reduct(crt);
jump(1);
continue;
}
if (_is("TRUE")){
reduct(true);
continue;
}
if (_is("FALSE")){
reduct(false);
continue;
}
bool crt = val[expr[i]];
jump(1);
reduct(crt);
}
assert(values.size() == 1);
assert(sign.empty());
return values[0];
}
int main(){
freopen("bool.in","r",stdin);
freopen("bool.out","w",stdout);
cin.getline(expr, 1006);
lg = strlen(expr);
cin >> n;
for (int i=1;i<=n;i++){
cin >> c;
val[c] ^= 1;
cout << (int)solve();
}
return 0;
}