結果
| 問題 | No.2308 [Cherry 5th Tune B] もしかして、真? |
| ユーザー |
👑  eoeo
|
| 提出日時 | 2023-05-20 00:15:16 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,899 bytes |
| コンパイル時間 | 3,760 ms |
| コンパイル使用メモリ | 260,428 KB |
| 実行使用メモリ | 12,820 KB |
| 最終ジャッジ日時 | 2024-12-20 03:23:24 |
| 合計ジャッジ時間 | 8,138 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 15 WA * 24 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef MY_DEBUG
#define dbg(...) debug_out(__VA_ARGS__)
#define dbgn(var) debug_out(#var, "=", var)
#else
#define dbg(...)
#define dbgn(...)
#endif
void debug_out();
template <class Head, class... Tail> void debug_out(Head, Tail...);
template <class T> bool chmax(T&, const T&);
template <class T> bool chmin(T&, const T&);
template <class T> T pwr(T, ll);
template <class T> T squ(T x) { return x * x; }
ll fact(ll);
ll comb(ll, ll);
ll ctoll(char);
char lltoc(ll);
bool flg(ll b, ll i) { return ((b) >> (i)) & 1LL; } // flg(0b010, 1LL) -> true
const ll LINF = (ll)1e18 + 7;
const double EPS = 1e-9;
const int MAX_DUBUG_SIZE = 10;
#include <atcoder/fenwicktree>
using namespace atcoder;
void solve([[maybe_unused]] int test) {
ll n;
cin >> n;
vector<bool> x(n);
for (ll i = 0; i < n; i++) {
string tmp;
cin >> tmp;
if (tmp == "True") {
x[i] = true;
}
else {
x[i] = false;
}
}
vector<string> y(n - 1);
for (ll i = 0; i < n - 1; i++) {
cin >> y[i];
}
vector<ll> s(n - 1);
for (ll i = 0; i < n - 1; i++) {
cin >> s[i];
s[i]--;
}
fenwick_tree<ll> ft(n);
bool ans = false;
for (ll i = 0; i < n - 1; i++) {
ll s_now = s[i] + ft.sum(0, s[i] + 1);
ll s_next = s[i] + 1 + ft.sum(0, s[i] + 2);
dbg(s_now, s_next);
if (y[s_now] == "and") {
x[s_now] = x[s_now] && x[s_next];
if (s_next < n) ft.add(s_next, 1);
}
else if (y[s_now] == "or") {
x[s_now] = x[s_now] || x[s_next];
if (s_next < n) ft.add(s_next, 1);
}
else if (y[s_now] == "xor") {
x[s_now] = x[s_now] ^ x[s_next];
if (s_next < n) ft.add(s_next, 1);
}
else {
x[s_now] = (!x[s_now]) || x[s_next];
if (s_next < n) ft.add(s_next, 1);
}
ans = x[s_now];
}
dbg(x);
cout << (ans ? "True" : "False") << endl;
}
int main() {
cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12);
int testcase_size = 1;
cin >> testcase_size;
for (int _t = 0; _t < testcase_size; _t++) {
solve(_t);
}
}
/*
-----------------------------------MY_FUNCTIONS------------------------------------ */
template <class First, class Second> ostream& operator<<(ostream& os, const pair<First, Second>& pp) {
return os << "{" << pp.first << "," << pp.second << "}";
}
template <class T> ostream& operator<<(ostream& os, const vector<T>& V) {
if (V.empty()) return os << "[]";
os << "[";
for (ll i = 0; i < (ll)V.size(); i++) {
os << V[i] << (i == int(V.size() - 1) ? "]" : ",");
}
return os;
}
template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& VV) {
if (VV.empty()) return os << "[[]]";
os << "[\n";
for (auto&& V : VV) {
os << V << "\n";
}
os << "]";
return os;
}
template <class T> ostream& operator<<(ostream& os, const vector<vector<vector<T>>>& VVV) {
if (VVV.empty()) return os << "[[[]]]";
os << "["
<< "\n";
int cnt = 0;
for (auto&& VV : VVV) {
os << cnt++ << VV << "\n\n";
}
os << "]";
return os;
}
template <class T> ostream& operator<<(ostream& os, const set<T>& SS) {
if (SS.empty()) return os << "[]";
os << "[";
auto ii = SS.begin();
for (; ii != SS.end(); ii++) os << *ii << (ii == prev(SS.end()) ? "]" : ",");
return os;
}
template <class Key, class Tp> ostream& operator<<(ostream& os, const map<Key, Tp>& MM) {
if (MM.empty()) return os << "[{:}]";
os << "[";
auto ii = MM.begin();
for (; ii != MM.end(); ii++)
os << "{" << ii->first << ":" << ii->second << "}" << (ii == prev(MM.end()) ? "]" : ",");
return os;
}
void debug_out() { cerr << endl; }
void debug_out_vl(vector<ll> V) {
const int MAX_SIZE = min((int)V.size(), MAX_DUBUG_SIZE);
cerr << "\033[33m";
if (V.empty()) {
cerr << "[]" << endl;
return;
}
cerr << "[";
for (int i = 0; i < MAX_SIZE; i++) {
if (V[i] == LINF)
cerr << "INF";
else
cerr << V[i];
if (i == (int)V.size() - 1)
cerr << "]\n";
else if (i == MAX_DUBUG_SIZE - 1)
cerr << ",...\n";
else
cerr << ",";
}
return;
}
void debug_out_vvl(vector<vector<ll>> VV) {
cerr << "\033[33m";
if (VV.empty()) {
cerr << "[[]]" << endl;
return;
}
cerr << "[\n";
int MAX_ROW = min((int)VV.size(), MAX_DUBUG_SIZE);
for (int i = 0; i < MAX_ROW; i++) {
const int MAX_COLUMN = min((int)VV[i].size(), MAX_DUBUG_SIZE);
if (VV[i].empty()) {
cerr << "[]" << endl;
continue;
}
cerr << "[";
for (int j = 0; j < MAX_COLUMN; j++) {
if (VV[i][j] == LINF)
cerr << "INF";
else
cerr << VV[i][j];
if (j == (int)VV[i].size() - 1)
cerr << "]\n";
else if (j == MAX_DUBUG_SIZE - 1)
cerr << ",...\n";
else
cerr << ",";
}
if (i != (int)VV.size() - 1 and i == MAX_DUBUG_SIZE - 1) {
cerr << ":\n:\033[m\n";
return;
}
}
cerr << "]\033[m\n";
return;
}
template <class Head, class... Tail> void debug_out(Head H, Tail... T) {
if constexpr (std::is_same_v<Head, vector<ll>>) {
debug_out_vl(H);
}
else if constexpr (std::is_same_v<Head, vector<vector<ll>>>) {
debug_out_vvl(H);
}
else {
cerr << "\033[33m" << H << "\033[m ";
}
debug_out(T...);
}
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 (b < a) {
a = b;
return true;
}
return false;
}
template <class T> T pwr(T x, ll n) {
T res = 1;
for (int i = 0; i < n; i++) {
res *= x;
}
return res;
}
ll fact(ll n) {
ll res = 1;
for (ll i = 1; i <= n; i++) res *= i;
return res;
}
ll comb(ll n, ll r) { // comb(60, 30)までオーバーフローなし
ll res = 1;
for (int i = 1; i <= r; i++) {
res *= n--;
res /= i;
}
return res;
}
ll ctoll(char c) {
if (c < '0' or '9' < c) {
cerr << "\n\033[33m ctoll に '0'~'9' 以外の文字が入りました．\033[m\n" << endl;
}
return ll(c - '0');
}
char lltoc(ll n) {
if (n < 0 or 9 < n) {
cerr << "\n\033[33m lltoc に 0 ~ 9 以外の数字が入りました．\033[m\n" << endl;
}
return char(n + '0');
}