結果

問題 No.1196 A lazy student
ユーザー 👑 hitonanodehitonanode
提出日時 2020-08-22 16:53:49
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 31 ms / 1,000 ms
コード長 6,265 bytes
コンパイル時間 1,704 ms
コンパイル使用メモリ 201,308 KB
実行使用メモリ 35,028 KB
最終ジャッジ日時 2023-08-05 13:50:16
合計ジャッジ時間 2,727 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 10 ms
5,792 KB
testcase_10 AC 10 ms
5,792 KB
testcase_11 AC 10 ms
5,832 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 1 ms
4,376 KB
testcase_15 AC 31 ms
35,028 KB
testcase_16 AC 9 ms
9,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif

using Float = long double;
Float P, Q, R;

Float K(Float r)
{
    return r * (1 - R) + (1 - r) * R;
}

template<typename T>
struct Parser
{
    using State = string::const_iterator;

    T tinit;
    Parser() {}
    Parser(T tzero): tinit(tzero) {}

    T expr(State &begin)
    {
        T ret = term(begin);
        while (true)
        {
            if (*begin == '+')
            {
                begin++;
                ret = K(1.0l - (1.0l - ret) * (1.0l - term(begin)));
            }
            else if (*begin == '-')
            {
                begin++;
                ret -= term(begin);
            }
            else break;
        }
        return ret;
    }

    T term(State &begin)
    {
        T ret = factor(begin);
        while (true)
        {
            if (*begin == '*')
            {
                begin++;
                ret = K(ret * factor(begin));
            }
            else break;
        }
        return ret;
    }

    T value(State &begin)
    {
        T ret = *begin - '0';
        begin++;
        return ret;
    }

    T factor(State &begin)
    {
        if (*begin == '(')
        {
            begin++;
            T ret = expr(begin);
            begin++;
            return ret;
        }
        else if (*begin == '[')
        {
            begin++;
            T ret1 = expr(begin);
            T ret2 = expr(begin);
            assert(*begin == ')');
            begin++;
            return ret1 * ret2 * P + (1.0l - ret1 * ret2) * Q;
        }
        else return value(begin);
    }
};

string Translator(string S)
{
    string ret;
    REP(i, S.length())
    {
        if (S[i] == 'Y')
        {
            ret += '1';
            i += 2;
        }
        else if (S[i] == 'N')
        {
            ret += '0';
            i += 1;
        }
        else if (S[i] == 'a')
        {
            ret += '*';
            i += 2;
        }
        else if (S[i] == 'o')
        {
            ret += '+';
            i += 1;
        }
        else if (S[i] == 'r')
        {
            ret += '[';
            i += 6;
        }
        else if (S[i] == '(')
        {
            ret += '(';
        }
        else if (S[i] == ')')
        {
            ret += ')';
        }
        else exit(8);
    }
    return ret;
}
int main()
{
    int N;
    cin >> N;
    cin >> P >> Q >> R;
    string S;
    cin >> S;
    Parser<Float> parser(0.0);
    S = Translator(S);
    dbg(S);
    string::const_iterator iter = S.begin();
    cout << int(parser.expr(iter) * 100) << '\n';
}
0