-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCIRCUITS.cpp
More file actions
50 lines (43 loc) · 1.02 KB
/
Copy pathCIRCUITS.cpp
File metadata and controls
50 lines (43 loc) · 1.02 KB
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
#include <cstdio>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100;
const double EPS = 1e-10;
//type: 0 - input, 1 - or, 2 - and
int prev[MAXN][2], type[MAXN];
double prob[MAXN];
double eval(int n, double p) {
// cout<<"Hello"<<n<<"P"<<p;
for (int i = 0; i < n; ++i) {
if (type[i] == 0) prob[i] = p;
else if (type[i] == 1) prob[i] = 1-(1-prob[prev[i][0]])*(1-prob[prev[i][1]]);
else prob[i] = prob[prev[i][0]]*prob[prev[i][1]];
}
return prob[n-1];
}
double solve(int n) {
double lo = 0, hi = 1;
while (lo+EPS < hi) {
double mid = (lo+hi)*0.5;
if (eval(n,mid) < 0.5) lo = mid;
else hi = mid;
}
return lo;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &type[i]);
if (type[i]) {
scanf("%d%d", &prev[i][0], &prev[i][1]);
--prev[i][0]; --prev[i][1];
}
}
printf("%.5lf\n", double(solve(n)));
}
}