結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー dyktr_06dyktr_06
提出日時 2023-05-19 22:43:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 225 ms / 2,000 ms
コード長 6,545 bytes
コンパイル時間 5,524 ms
コンパイル使用メモリ 269,876 KB
実行使用メモリ 25,248 KB
最終ジャッジ日時 2024-12-20 01:13:26
合計ジャッジ時間 13,630 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 164 ms
9,648 KB
testcase_02 AC 197 ms
14,160 KB
testcase_03 AC 181 ms
14,420 KB
testcase_04 AC 183 ms
15,120 KB
testcase_05 AC 185 ms
15,748 KB
testcase_06 AC 196 ms
19,860 KB
testcase_07 AC 192 ms
18,716 KB
testcase_08 AC 196 ms
21,564 KB
testcase_09 AC 195 ms
21,520 KB
testcase_10 AC 179 ms
14,588 KB
testcase_11 AC 189 ms
14,080 KB
testcase_12 AC 192 ms
14,172 KB
testcase_13 AC 191 ms
14,108 KB
testcase_14 AC 187 ms
14,216 KB
testcase_15 AC 189 ms
14,192 KB
testcase_16 AC 191 ms
14,180 KB
testcase_17 AC 193 ms
14,220 KB
testcase_18 AC 195 ms
14,216 KB
testcase_19 AC 187 ms
14,184 KB
testcase_20 AC 192 ms
14,088 KB
testcase_21 AC 225 ms
25,008 KB
testcase_22 AC 225 ms
25,156 KB
testcase_23 AC 221 ms
25,116 KB
testcase_24 AC 224 ms
25,248 KB
testcase_25 AC 225 ms
25,128 KB
testcase_26 AC 222 ms
25,052 KB
testcase_27 AC 224 ms
25,216 KB
testcase_28 AC 225 ms
25,060 KB
testcase_29 AC 220 ms
25,104 KB
testcase_30 AC 223 ms
25,068 KB
testcase_31 AC 112 ms
25,092 KB
testcase_32 AC 113 ms
25,076 KB
testcase_33 AC 110 ms
25,008 KB
testcase_34 AC 113 ms
25,056 KB
testcase_35 AC 115 ms
24,936 KB
testcase_36 AC 117 ms
25,044 KB
testcase_37 AC 10 ms
6,820 KB
testcase_38 AC 182 ms
14,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 1000000007;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
struct BinaryIndexedTree{
    int N;
    vector<T> BIT;
    BinaryIndexedTree(const int &N): N(N), BIT(N + 1, 0){
    }

    T get(int i){
        return sum(i + 1) - sum(i);
    }

    void add(int i, T x){
        i++;
        while(i <= N){
            BIT[i] += x;
            i += i & -i;
        }
    }

    T sum(int i) const {
        T ans = 0;
        while(i > 0){
            ans += BIT[i];
            i -= i & -i;
        }
        return ans;
    }

    T sum(int L, int R) const {
        return sum(R) - sum(L);
    }

    int lower_bound(T x) const {
        if(x <= 0){
            return 0;
        }else{
            int v = 0, r = 1;
            while(r < N) r = r << 1;
            for(int len = r; len > 0; len = len >> 1){
                if(v + len < N && BIT[v + len] < x){
                    x -= BIT[v + len];
                    v += len;
                }
            }
            return v;
        }
    }

    int upper_bound(T x) const {
        if(x < 0){
            return 0;
        }else{
            int v = 0, r = 1;
            while(r <= N) r = r << 1;
            for(int len = r; len > 0; len = len >> 1){
                if(v + len <= N && BIT[v + len] <= x){
                    x -= BIT[v + len];
                    v += len;
                }
            }
            return v;
        }
    }

    T operator [](int i) const {
        return sum(i, i + 1);
    }
};

ll t;

void input(){
    in(t);
}

void solve(){
    ll n; in(n);
    vst x, y; vin(x, n);
    BinaryIndexedTree<ll> BIT1(n), BIT2(n - 1);
    vin(y, n - 1);
    vll s; vin(s, n - 1);
    vll a(n);
    rep(i, n){
        if(x[i] == "True") a[i] = 1;
        else a[i] = 0;

        BIT1.add(i, 1);
    }
    rep(i, n - 1) BIT2.add(i, 1);

    rep(i, n - 1){
        ll l = BIT1.lower_bound(s[i]), r = BIT1.lower_bound(s[i] + 1);
        ll opi = BIT2.lower_bound(s[i]);
        string op = y[opi];
        // out(l, r, opi);
        BIT1.add(l, -1);
        BIT2.add(opi, -1);
        if(op == "and"){
            a[r] = a[l] & a[r];
        }else if(op == "or"){
            a[r] = a[l] | a[r];
        }else if(op == "xor"){
            a[r] = a[l] ^ a[r];
        }else{
            if(a[l] == 0){
                a[r] = 1; 
            }
        }
    }
    ll idx = BIT1.lower_bound(1);
    if(a[idx]){
        out("True");
    }else{
        out("False");
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    while(t--) solve();
}
0