結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー jabeejabee
提出日時 2023-05-24 12:26:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 875 ms / 2,000 ms
コード長 6,400 bytes
コンパイル時間 4,450 ms
コンパイル使用メモリ 272,068 KB
実行使用メモリ 42,912 KB
最終ジャッジ日時 2024-06-06 04:30:00
合計ジャッジ時間 32,904 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
18,936 KB
testcase_01 AC 611 ms
25,480 KB
testcase_02 AC 735 ms
30,896 KB
testcase_03 AC 695 ms
30,820 KB
testcase_04 AC 673 ms
31,544 KB
testcase_05 AC 680 ms
31,988 KB
testcase_06 AC 735 ms
39,000 KB
testcase_07 AC 730 ms
38,244 KB
testcase_08 AC 771 ms
40,172 KB
testcase_09 AC 775 ms
40,236 KB
testcase_10 AC 693 ms
31,200 KB
testcase_11 AC 746 ms
30,920 KB
testcase_12 AC 749 ms
30,916 KB
testcase_13 AC 770 ms
30,912 KB
testcase_14 AC 746 ms
30,920 KB
testcase_15 AC 746 ms
30,916 KB
testcase_16 AC 741 ms
30,792 KB
testcase_17 AC 749 ms
30,916 KB
testcase_18 AC 754 ms
30,916 KB
testcase_19 AC 749 ms
30,916 KB
testcase_20 AC 748 ms
30,916 KB
testcase_21 AC 849 ms
42,740 KB
testcase_22 AC 861 ms
42,848 KB
testcase_23 AC 858 ms
42,664 KB
testcase_24 AC 862 ms
42,736 KB
testcase_25 AC 875 ms
42,796 KB
testcase_26 AC 870 ms
42,728 KB
testcase_27 AC 873 ms
42,740 KB
testcase_28 AC 852 ms
42,804 KB
testcase_29 AC 845 ms
42,748 KB
testcase_30 AC 841 ms
42,804 KB
testcase_31 AC 369 ms
42,800 KB
testcase_32 AC 362 ms
42,812 KB
testcase_33 AC 358 ms
42,764 KB
testcase_34 AC 419 ms
42,808 KB
testcase_35 AC 417 ms
42,912 KB
testcase_36 AC 414 ms
42,908 KB
testcase_37 AC 33 ms
18,944 KB
testcase_38 AC 746 ms
30,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
ll op(ll a, ll b){return a+b;}
ll e(){return 0;}
void _main() {
    ll t;
    cin >> t;
    rep(ti,0,t){
        ll n;
        cin >> n;
        vector<string>x(n),y(n-1);
        vector<ll>s(n-1);
        rep(i,0,n)cin >> x[i];
        rep(i,0,n-1)cin >> y[i];
        rep(i,0,n-1)cin >> s[i];
        segtree<ll,op,e>useg(n+5),vseg(n+5);
        rep(i,0,n+5)useg.set(i,1);     
        rep(i,0,n+5)vseg.set(i,1);     
      rep(i,0,n-1){
            ll ac = 0;
            ll wa = n+5;
            while(wa - ac > 1){
              ll wj = (wa + ac) / 2;
              ll tot = useg.prod(0,wj);
              if(tot > s[i])wa = wj;
              else ac = wj;
            }
          	ll p = ac;
            ac = 0;
            wa = n+5;
            while(wa - ac > 1){
              ll wj = (wa + ac) / 2;
              ll tot = useg.prod(0,wj);
              if(tot > s[i] + 1)wa = wj;
              else ac = wj;
            }
            ll r = ac;
        
    	    ac = 0;
            wa = n+5;
            while(wa - ac > 1){
              ll wj = (wa + ac) / 2;
              ll tot = vseg.prod(0,wj);
              if(tot > s[i])wa = wj;
              else ac = wj;
            }
            ll q = ac;
       //     cout << p << " " << r << " " << q << endl;
	        useg.set(r,0);
            vseg.set(q,0);
            p--; r--; q--;      
            string pos_str = x[p];
            string npos_str = x[r];
            string nxt_s= "";
             
            if(y[q] == "and"){
                if(pos_str == "True" && npos_str == "True")nxt_s = "True";
                else nxt_s = "False";
                x[p] = nxt_s;
            }
            if(y[q] == "or"){
                if(pos_str == "True" || npos_str == "True")nxt_s = "True";
                else nxt_s = "False";
                x[p] = nxt_s;
            }
            if(y[q] == "xor"){
                if(pos_str != npos_str)nxt_s = "True";
                else nxt_s = "False";
                x[p] = nxt_s;
            }
            if(y[q] == "imp"){
                if(pos_str == "True")nxt_s = npos_str;
                else nxt_s = "True";
                x[p] = nxt_s;
            }
            //cout << pos << " " << npos << " " << ss << " " << nxt_s << "\n";    
           
        }
       
        cout << x[0] << "\n";
    }    
}
0