#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> p(N), d(N);
for (int i=0; i<N; i++)
cin >> p[i] >> d[i];
vector<double> res(1<<N);
double ret = 0.0;
for (int i=1; i<(1<<N); i++) {
int cnt = 0;
double sum = 0.0;
for (int j=0; j<N; j++) {
if (i&(1<<j)) {
sum += 0.01 * p[j] * d[j] + (1.0 - 0.01 * p[j]) * res[i-(1<<j)];
cnt ++;
}
}
res[i] = sum / cnt;
ret = max(ret, res[i]);
}
cout << setprecision(15) << ret << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
7 |
Correct |
0 ms |
1720 KB |
Output is correct |
8 |
Correct |
0 ms |
1720 KB |
Output is correct |
9 |
Correct |
0 ms |
1720 KB |
Output is correct |
10 |
Correct |
0 ms |
1720 KB |
Output is correct |
11 |
Correct |
0 ms |
1720 KB |
Output is correct |
12 |
Correct |
0 ms |
1720 KB |
Output is correct |
13 |
Correct |
0 ms |
1720 KB |
Output is correct |
14 |
Correct |
0 ms |
1720 KB |
Output is correct |
15 |
Correct |
0 ms |
1720 KB |
Output is correct |
16 |
Correct |
0 ms |
1720 KB |
Output is correct |
17 |
Correct |
0 ms |
1720 KB |
Output is correct |
18 |
Correct |
0 ms |
1720 KB |
Output is correct |
19 |
Correct |
0 ms |
1720 KB |
Output is correct |
20 |
Correct |
0 ms |
1720 KB |
Output is correct |
21 |
Correct |
0 ms |
1720 KB |
Output is correct |
22 |
Correct |
0 ms |
1720 KB |
Output is correct |
23 |
Correct |
0 ms |
1720 KB |
Output is correct |
24 |
Correct |
0 ms |
1720 KB |
Output is correct |
25 |
Correct |
0 ms |
1720 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
103 ms |
9916 KB |
Output is correct |
2 |
Correct |
103 ms |
9916 KB |
Output is correct |
3 |
Correct |
106 ms |
9916 KB |
Output is correct |
4 |
Correct |
104 ms |
9916 KB |
Output is correct |
5 |
Correct |
107 ms |
9916 KB |
Output is correct |
6 |
Correct |
107 ms |
9916 KB |
Output is correct |
7 |
Correct |
106 ms |
9916 KB |
Output is correct |
8 |
Correct |
106 ms |
9916 KB |
Output is correct |
9 |
Correct |
107 ms |
9916 KB |
Output is correct |
10 |
Correct |
103 ms |
9916 KB |
Output is correct |
11 |
Correct |
103 ms |
9916 KB |
Output is correct |
12 |
Correct |
107 ms |
9916 KB |
Output is correct |
13 |
Correct |
103 ms |
9916 KB |
Output is correct |
14 |
Correct |
107 ms |
9916 KB |
Output is correct |
15 |
Correct |
103 ms |
9916 KB |
Output is correct |
16 |
Correct |
106 ms |
9916 KB |
Output is correct |
17 |
Correct |
106 ms |
9916 KB |
Output is correct |
18 |
Correct |
103 ms |
9916 KB |
Output is correct |
19 |
Correct |
103 ms |
9916 KB |
Output is correct |
20 |
Correct |
103 ms |
9916 KB |
Output is correct |