#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } int op(int x, int y){ return x+y; } int e(){ return 0; } using P = pair; using Seg = atcoder::segtree; void solve(){ int n; cin >> n; vector x(n); set

st; for(int i = 0; i < n; i++){ string s; cin >> s; x[i] = s[0] == 'T'; st.insert({i, x[i]}); } Seg seg(vector(n-1, 1)); vector y(n-1); vector s(n-1); for(int i = 0; i < n-1; i++) cin >> y[i]; for(int i = 0; i < n-1; i++) { cin >> s[i]; } for(int i = 0; i < n-1; i++){ auto g = [&](int x){ return x < s[i]; }; int c = seg.max_right(0, g); bool ans = false; auto p = st.upper_bound({c, true}); auto [ir, fr] = *p; auto [il, fl] = *prev(p); st.erase({ir, fr}); st.erase({il, fl}); if(y[i] == "and"){ ans = fl&&fr; }else if(y[i] == "or"){ ans = fl||fr; }else if(y[i] == "xor"){ ans = fl!=fr; }else{ if(fl) ans = fr; ans = true; } st.insert({il, ans}); seg.set(c, 0); // for(auto [i, f]: st) cout << f << ' '; // cout << endl; } if(st.begin()->second){ cout << "True\n"; }else{ cout << "False\n"; } } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int t; cin >> t; while(t--) solve(); }