結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー 👑 amentorimaruamentorimaru
提出日時 2023-05-19 22:13:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,887 bytes
コンパイル時間 3,890 ms
コンパイル使用メモリ 193,532 KB
実行使用メモリ 23,196 KB
最終ジャッジ日時 2024-05-10 05:40:03
合計ジャッジ時間 16,150 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 279 ms
13,212 KB
testcase_15 AC 274 ms
13,084 KB
testcase_16 AC 274 ms
13,176 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 296 ms
23,040 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 295 ms
22,992 KB
testcase_27 AC 291 ms
22,912 KB
testcase_28 AC 295 ms
22,912 KB
testcase_29 AC 294 ms
23,156 KB
testcase_30 AC 296 ms
22,912 KB
testcase_31 AC 180 ms
23,040 KB
testcase_32 AC 172 ms
23,040 KB
testcase_33 AC 172 ms
23,040 KB
testcase_34 AC 193 ms
23,024 KB
testcase_35 WA -
testcase_36 AC 193 ms
22,964 KB
testcase_37 WA -
testcase_38 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/vector:65,
                 from main.cpp:7:
In member function 'std::_Bit_reference& std::_Bit_reference::operator=(bool)',
    inlined from 'int main()' at main.cpp:148:18:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_bvector.h:102:7: warning: 'nx' may be used uninitialized [-Wmaybe-uninitialized]
  102 |       if (__x)
      |       ^~
main.cpp: In function 'int main()':
main.cpp:139:12: note: 'nx' was declared here
  139 |       bool nx;
      |            ^~

ソースコード

diff # 

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>

using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

//template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define TOMAX(n,v) n=n<v?v:n
#define TOMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) x1*y2-x2*y1
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

using val = ll;
using func = ll;

val op(val a, val b) { return a + b; }
val e() { return 0; }


val mp(func f, val a) {
  if (f == -1)
    return a;
  return f;
}
func comp(func f, func g) {
  if (f == -1)
    return g;
  return f;
}
func id() { return -1; }

ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };

ll z;
bool f(ll v) {
  return v <= z;
}

int main() {
  ll t;
  cin >> t;
  while (t--) {
    ll n;
    cin >> n;
    auto xs = read<string>(n);
    vector<bool> x(n);
    REP(i, n)
      x[i] = xs[i] == "True";
    auto y = read<string>(n - 1);
    auto s = read(n - 1);
    segtree<val, op, e> st(n + 1);
    REP(i, n + 1)
      st.set(i, 1);
    REP(i, n - 1) {
      z = s[i];
      ll v = st.max_right<f>(0);
      z -= 1;
      ll l = st.max_right<f>(0);
      z += 2;
      ll r = st.max_right<f>(0);
      bool nx;
      if (y[v-1] == "and")
        nx = x[v-1] && x[v + 0];
      if (y[v-1] == "or")
        nx = x[v-1] || x[v + 0];
      if (y[v-1] == "xor")
        nx = x[v-1] ^ x[v + 0];
      if (y[v-1] == "imp")
        nx = !x[v-1] || x[v + 0];
      x[v - 1] = nx;
      l--; r--;
      if (l != v && l >= 0)
        x[l] = nx;
      if (r != v && r < n)
        x[r] = nx;
      st.set(v, 0);
    }
    if (x[0])
      cout << "True\n";
    else
      cout << "False\n";
  }
  return 0;
}
0