結果
問題 | No.2308 [Cherry 5th Tune B] もしかして、真? |
ユーザー |
|
提出日時 | 2023-05-19 21:51:03 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 198 ms / 2,000 ms |
コード長 | 5,002 bytes |
コンパイル時間 | 2,250 ms |
コンパイル使用メモリ | 177,836 KB |
実行使用メモリ | 12,500 KB |
最終ジャッジ日時 | 2024-12-18 02:33:56 |
合計ジャッジ時間 | 10,613 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 39 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;template <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}segtree(int n) : segtree(std::vector<S>(n, e())) {}segtree(const std::vector<S>& v) : _n(int(v.size())) {log = ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}const S operator[](int p) const { return get(p); }S operator[](int p) { return get(p); }S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }template <bool (*f)(S)> int max_right(int l) {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0 <= l && l <= _n);assert(f(e()));if (l == _n) return _n;l += size;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, d[l]))) {while (l < size) {l = (2 * l);if (f(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*f)(S)> int min_left(int r) {return min_left(r, [](S x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(d[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};using S = pair<int,int>;S op(S lhs, S rhs){if(rhs.second == 0) return S({lhs.first & rhs.first, lhs.second});if(rhs.second == 1) return S({lhs.first | rhs.first, lhs.second});if(rhs.second == 2) return S({lhs.first ^ rhs.first, lhs.second});if(lhs.first == 1) return S({rhs.first, lhs.second});return make_pair(1, lhs.second);}S e(){return S({1, 0});}//xにfを作用させた時の値の変化int op2(int f, int x){return x + f;}//作用させても変化させないものint e2(){return 0;}int main(){ios::sync_with_stdio(false);cin.tie(0);int T;cin >> T;auto f = [&](int u, int v, int op){if(op == 0) return u & v;if(op == 1) return u | v;if(op == 2) return u ^ v;if(u == 1) return v;return 1;};//and or xor impauto g = [&](string s){if(s == "and") return 0;if(s == "or") return 1;if(s == "xor") return 2;if(s == "True") return 1;if(s == "False") return 0;return 3;};while(T--){int n;cin >> n;vector<pair<int,int>> b(n, e());vector<int> c(n);for(int i = 0; i < n; i++){string s;cin >> s;b[i].first = g(s);}for(int i = 1; i < n; i++){string s;cin >> s;b[i].second = g(s);}segtree<S, op, e> seg(b);segtree<int, op2, e2> seg2(vector<int>(n, 1));for(int i = 0; i + 1 < n; i++){int v2;cin >> v2;int p = seg2.max_right(0, [&](int v){return v < v2;});int p2 = seg2.max_right(0, [&](int v){return v < v2 + 1;});//cerr << p << " " << p2 << '\n';seg2.set(p2, 0);seg.set(p, op(seg.get(p), seg.get(p2)));seg.set(p2, e());}cout << (seg.all_prod().first == 1 ? "True" : "False") << '\n';}}