#536787 (D) No.1196 A lazy student

• 問題: No.1196 A lazy student
• ユーザー: 👑 hos.lyric
• 提出日時: 2020-08-22 13:27:07
• 言語: D (dmd 2.109.1)
• 結果: AC
• 実行時間: 167 ms / 1,000 ms
• コード長: 2,742 bytes
• コンパイル時間: 866 ms
• コンパイル使用メモリ: 120,992 KB
• 実行使用メモリ: 198,404 KB
• 最終ジャッジ日時: 2024-06-22 08:12:55
• 合計ジャッジ時間: 2,517 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std
    .typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
int N;
real P, Q, R;
string S;
real Or(real x, real y) {
  real z = 1.0L - (1.0L - x) * (1.0L - y);
  z = (1.0L - R) * z + R * (1.0L - z);
  debug {
    writefln("Or %s %s = %s", x, y, z);
  }
  return z;
}
real And(real x, real y) {
  real z = x * y;
  z = (1.0L - R) * z + R * (1.0L - z);
  debug {
    writefln("And %s %s = %s", x, y, z);
  }
  return z;
}
real Random(real x, real y) {
  real z = P * x * y + Q * (1.0L - x * y);
  debug {
    writefln("Random %s %s = %s", x, y, z);
  }
  return z;
}
int cur;
real expr() {
  real ret = term();
  for (; S[cur] == 'o'; ) {
    cur += 2;
    const res = term();
    ret = Or(ret, res);
  }
  return ret;
}
real term() {
  real ret = factor();
  for (; S[cur] == 'a'; ) {
    cur += 3;
    const res = factor();
    ret = And(ret, res);
  }
  return ret;
}
real factor() {
  real ret;
  if (S[cur] == 'Y') {
    cur += 3;
    ret = 1.0L;
  } else if (S[cur] == 'N') {
    cur += 2;
    ret = 0.0L;
  } else if (S[cur] == 'r') {
    cur += 7;
    const x = expr();
    const y = expr();
    ret = Random(x, y);
    assert(S[cur] == ')');
    cur += 1;
  } else if (S[cur] == '(') {
    cur += 1;
    ret = expr();
    assert(S[cur] == ')');
    cur += 1;
  } else {
    assert(false);
  }
  return ret;
}
void main() {
  try {
    for (; ; ) {
      N = readInt();
      P = readReal();
      Q = readReal();
      R = readReal();
      S = readToken();
      S ~= '$';
      
      cur = 0;
      const ans = expr();
      writeln(cast(int)(floor(ans * 100.0L + 1e-12L)));
    }
  } catch (EOFException e) {
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX