#698837 (C++17) No.1677 mæx

提出ソース

結果

問題	No.1677 mæx
ユーザー	satashun
提出日時	2021-09-11 09:45:51
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	68 ms / 2,000 ms
コード長	6,017 bytes
コンパイル時間	2,440 ms
コンパイル使用メモリ	218,908 KB
実行使用メモリ	16,256 KB
最終ジャッジ日時	2024-06-22 16:01:35
合計ジャッジ時間	4,078 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	41 ms 14,336 KB
testcase_05	AC	41 ms 14,464 KB
testcase_06	AC	40 ms 14,208 KB
testcase_07	AC	40 ms 14,336 KB
testcase_08	AC	39 ms 14,464 KB
testcase_09	AC	40 ms 14,336 KB
testcase_10	AC	39 ms 14,336 KB
testcase_11	AC	40 ms 14,464 KB
testcase_12	AC	40 ms 14,208 KB
testcase_13	AC	40 ms 14,336 KB
testcase_14	AC	48 ms 14,464 KB
testcase_15	AC	47 ms 14,336 KB
testcase_16	AC	46 ms 14,336 KB
testcase_17	AC	47 ms 14,464 KB
testcase_18	AC	48 ms 14,464 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	68 ms 16,256 KB

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

ソースコード

raw source code

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    explicit operator int() const { return v; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    friend istream& operator>>(istream& in, M& x) {
        ll v_;
        in >> v_;
        x = M(v_);
        return in;
    }

    bool operator<(const M& r) const { return v < r.v; }
    bool operator>(const M& r) const { return v < *this; }
    bool operator<=(const M& r) const { return !(r < *this); }
    bool operator>=(const M& r) const { return !(*this < r); }
    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }

    static uint get_mod() { return MOD; }
};

// using Mint = ModInt<1000000007>;
using Mint = ModInt<998244353>;

int mx[3][3];

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    rep(i, 3) {
        rep(j, 3) {
            rep(k, 3) {
                if (k != i && k != j) {
                    mx[i][j] = k;
                    break;
                }
            }
        }
    }

    string s;
    cin >> s;
    int n = SZ(s);
    map<pii, V<Mint>> dp;
    V<int> pr(n);
    V<int> bl;
    rep(i, n) {
        if (s[i] == '(') {
            bl.pb(i);
        } else if (s[i] == ')') {
            pr[i] = bl.back();
            bl.pop_back();
        }
    }

    auto rec = [&](auto&& f, int l, int r) -> V<Mint> {
        //  debug(l, r, s[l], s[r]);
        auto rng = mp(l, r);
        if (dp.count(mp(l, r))) return dp[mp(l, r)];
        dp[rng] = V<Mint>(3);
        if (l == r) {
            if (s[l] == '?') {
                rep(i, 3) dp[rng][i] = 1;
            } else {
                dp[rng][s[l] - '0'] = 1;
            }
        } else {
            int com = s[r - 1] == ')' ? pr[r - 1] - 4 : r - 2;
            auto vl = f(f, l + 4, com - 1);
            auto vr = f(f, com + 1, r - 1);
            // max
            if (s[l + 1] != 'e') {
                rep(a, 3) {
                    rep(b, 3) { dp[rng][max(a, b)] += vl[a] * vr[b]; }
                }
            }
            // mex
            if (s[l + 1] != 'a') {
                rep(a, 3) {
                    rep(b, 3) { dp[rng][mx[a][b]] += vl[a] * vr[b]; }
                }
            }
        }
        return dp[rng];
    };

    auto a = rec(rec, 0, n - 1);
    debug(a);
    int x;
    cin >> x;
    cout << a[x] << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード