#870337 (C++23) No.2308 [Cherry 5th Tune B] もしかして、真?

提出ソース

結果

問題	No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー	hitonanode
提出日時	2023-05-19 21:42:32
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	918 ms / 2,000 ms
コード長	8,602 bytes
コンパイル時間	4,840 ms
コンパイル使用メモリ	227,168 KB
実行使用メモリ	40,784 KB
最終ジャッジ日時	2024-12-18 02:28:09
合計ジャッジ時間	31,828 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	568 ms 14,452 KB
testcase_02	AC	702 ms 22,076 KB
testcase_03	AC	626 ms 22,272 KB
testcase_04	AC	649 ms 23,704 KB
testcase_05	AC	666 ms 24,728 KB
testcase_06	AC	770 ms 31,596 KB
testcase_07	AC	729 ms 29,868 KB
testcase_08	AC	809 ms 34,408 KB
testcase_09	AC	833 ms 34,496 KB
testcase_10	AC	654 ms 22,668 KB
testcase_11	AC	740 ms 22,236 KB
testcase_12	AC	732 ms 22,124 KB
testcase_13	AC	733 ms 22,124 KB
testcase_14	AC	723 ms 22,128 KB
testcase_15	AC	725 ms 22,252 KB
testcase_16	AC	720 ms 22,156 KB
testcase_17	AC	720 ms 22,252 KB
testcase_18	AC	732 ms 22,252 KB
testcase_19	AC	732 ms 22,124 KB
testcase_20	AC	736 ms 22,120 KB
testcase_21	AC	918 ms 40,560 KB
testcase_22	AC	903 ms 40,684 KB
testcase_23	AC	874 ms 40,616 KB
testcase_24	AC	897 ms 40,760 KB
testcase_25	AC	903 ms 40,784 KB
testcase_26	AC	883 ms 40,748 KB
testcase_27	AC	894 ms 40,704 KB
testcase_28	AC	912 ms 40,576 KB
testcase_29	AC	907 ms 40,692 KB
testcase_30	AC	883 ms 40,704 KB
testcase_31	AC	423 ms 40,576 KB
testcase_32	AC	426 ms 40,700 KB
testcase_33	AC	428 ms 40,576 KB
testcase_34	AC	455 ms 40,704 KB
testcase_35	AC	452 ms 40,612 KB
testcase_36	AC	450 ms 40,548 KB
testcase_37	AC	11 ms 5,248 KB
testcase_38	AC	721 ms 22,256 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template <typename TK>
using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename TK, typename TV>
using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;


const string True = "True", False = "False";

bool solve() {
    int N;
    cin >> N;
    pbds_set<pair<int, bool>> se;
    pbds_set<pair<int, string>> sgn;
    REP(i, N) {
        string s;
        cin >> s;
        se.insert(make_pair(i, s == "True"));
    }
    // dbg(se);
    for (auto p : se) dbg(p);

    vector<string> Y(N - 1);
    cin >> Y;
    REP(q, Y.size()) sgn.insert(make_pair(q, Y.at(q)));
    dbg(make_tuple(Y));
    REP(q, N - 1) {
        int s;
        cin >> s;
        --s;
        auto lhs = *se.find_by_order(s);
        bool lval = lhs.second;
        se.erase(lhs);
        auto rhs = *se.find_by_order(s);
        bool rval = rhs.second;
        se.erase(rhs);
        dbg(make_tuple(lhs, rhs, Y.at(q)));

        auto [p, tp] = *sgn.find_by_order(s);
        sgn.erase(make_pair(p, tp));
        if (tp == "and") se.insert(make_pair(lhs.first, lval and rval));
        else if (tp == "or") se.insert(make_pair(lhs.first, lval or rval));
        else if (tp == "xor") se.insert(make_pair(lhs.first, lval xor rval));
        else if (tp == "imp") se.insert(make_pair(lhs.first, (!lval) or rval));
        else assert(false);
    }
    return se.begin()->second;
}

int main() {
    int T;
    cin >> T;
    while (T--) cout << (solve() ? True : False) << '\n';
}

yukicoder

結果

テストケース

ソースコード