結果
問題 | No.2308 [Cherry 5th Tune B] もしかして、真? |
ユーザー |
|
提出日時 | 2023-05-19 22:25:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 230 ms / 2,000 ms |
コード長 | 3,097 bytes |
コンパイル時間 | 4,333 ms |
コンパイル使用メモリ | 255,932 KB |
最終ジャッジ日時 | 2025-02-13 02:17:00 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 39 |
ソースコード
#include <atcoder/all>#include <bits/stdc++.h>using namespace std;#define SZ(x) (int) (x).size()#define REP(i, n) for(int i = 0; i < (n); i++)#define FOR(i, a, b) for(auto i = (a); i < (b); i++)#define For(i, a, b, c) \for(auto i = (a); i != (b); i += (c))#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)#define ALL(s) (s).begin(), (s).end()#define so(V) sort(ALL(V))#define rev(V) reverse(ALL(V))#define uni(v) v.erase(unique(ALL(v)), (v).end())#define eb emplace_backtypedef unsigned long long ull;typedef long long ll;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<bool> vb;typedef vector<vi> vvi;typedef vector<vll> vvll;typedef pair<int, int> PI;typedef pair<ll, ll> PL;const double EPS = 1e-6;const int MOD = 1e9 + 7;const int INF = (1 << 30);const ll LINF = 1e18;const double math_PI = acos(-1);template<typename T>vector<T> make_v(size_t a) {return vector<T>(a);}template<typename T, typename... Ts>auto make_v(size_t a, Ts... ts) {return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));}template<typename T, typename V>typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {t = v;}template<typename T, typename V>typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {for(auto& e: t) fill_v(e, v);}template<class T>bool chmax(T& a, const T& b) {if(a < b) {a = b;return true;}return false;}template<class T>bool chmin(T& a, const T& b) {if(a > b) {a = b;return true;}return false;}template<typename S, typename T>istream& operator>>(istream& is, pair<S, T>& p) {cin >> p.first >> p.second;return is;}template<typename T>istream& operator>>(istream& is, vector<T>& vec) {for(T& x: vec) is >> x;return is;}template<typename T>string join(vector<T>& vec, string splitter) {stringstream ss;REP(i, SZ(vec)) {if(i != 0) ss << splitter;ss << vec[i];}return ss.str();}template<typename T>ostream& operator<<(ostream& os, vector<T>& vec) {os << join(vec, " ");return os;}using namespace atcoder;int op(int a, int b) {return a + b;}int e() {return 0;}void solve() {int N;cin >> N;vector<string> X(N);vector<string> Y(N - 1);cin >> X >> Y;vi SS(N - 1);cin >> SS;segtree<int, op, e> SX(vi(N, 1)), SY(vi(N - 1, 1));REP(i, N - 1) {int s = SS[i] - 1;int pi = SX.max_right(0, [&](int x) {return x <= s;});int p = X[pi] == "True" ? 1 : 0;int qi = SX.max_right(0, [&](int x) {return x <= s + 1;});int q = X[qi] == "True" ? 1 : 0;int oi = SY.max_right(0, [&](int x) {return x <= s;});string op = Y[oi];int v = 0;if(op == "and") {v = p & q;} else if(op == "or") {v = p | q;} else if(op == "xor") {v = p ^ q;} else {if(!p || q) {v = 1;}}if(v == 1) {X[pi] = "True";} else {X[pi] = "False";}SX.set(qi, 0);SY.set(oi, 0);}cout << X[0] << endl;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int T;cin >> T;while(T--) {solve();}return 0;}