結果

問題 No.1196 A lazy student
ユーザー haruki_Kharuki_K
提出日時 2020-08-22 16:46:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 142 ms / 1,000 ms
コード長 5,690 bytes
コンパイル時間 2,155 ms
コンパイル使用メモリ 203,324 KB
実行使用メモリ 150,500 KB
最終ジャッジ日時 2024-10-15 10:47:37
合計ジャッジ時間 2,961 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 7 ms
5,248 KB
testcase_09 AC 15 ms
5,248 KB
testcase_10 AC 15 ms
5,248 KB
testcase_11 AC 14 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 142 ms
150,500 KB
testcase_16 AC 31 ms
27,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<

int n;
double p,q,r;
string s;

using P = pair<double,double>;

P change(P x) {
    P y;
    y.fst = (1-r)*x.fst + r*x.snd;
    y.snd = r*x.fst + (1-r)*x.snd;
    return y;
}

P OR(P x, P y) {
    P z;
    z.snd = x.snd * y.snd;
    z.fst = 1-z.snd;
    return z;
}

P AND(P x, P y) {
    P z;
    z.fst = x.fst * y.fst;
    z.snd = 1-z.fst;
    return z;
}

P Random(P x, P y) {
    P z;
    z.fst = x.fst*y.fst * p + (1-x.fst*y.fst) * q;
    z.snd = 1-z.fst;
    return z;
}

P expr(int&);
P term(int&);
P fact(int&);

P expr(int &i) {
    auto x = term(i);
    while (i < n && s[i] == 'o') {
        assert(s.substr(i,2) == "or");
        i += 2;
        auto y = term(i);
        x = change(OR(x,y));
    }
    return x;
}

P term(int &i) {
    auto x = fact(i);
    while (i < n && s[i] == 'a') {
        assert(s.substr(i,3) == "and");
        i += 3;
        auto y = fact(i);
        x = change(AND(x,y));
    }
    return x;
}

P fact(int &i) {
    if (s[i] == 'r') {
        assert(s.substr(i,7) == "random(");
        i += 7;
        auto x = expr(i);
        auto y = expr(i);
        assert(s[i] == ')');
        i++;
        return Random(x,y);
    } else if (s[i] == '(') {
        i++;
        auto x = expr(i);
        assert(s[i] == ')');
        i++;
        return x;
    } else if (s[i] == 'Y') {
        assert(s.substr(i,3) == "YES");
        i += 3;
        return {1,0};
    } else if (s[i] == 'N') {
        assert(s.substr(i,2) == "NO");
        i += 2;
        return {0,1};
    } else {
        assert(0);
        return {};
    }
}


int32_t main() {
    cin >> n >> p >> q >> r >> s;

    int i = 0;
    auto x = expr(i);
    cout << int(x.fst*100) << endl;

}
0