#include<cstdio>
int P[25],D[25];
double DP[1048576];
int N;
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++) scanf("%d%d",P+i,D+i);
for(int i=0;i<N;i++)
DP[1<<i]=P[i]*D[i]/100.;
for(int i=1;i<(1<<N);i++)
{
if(DP[i]>0.001) continue;
int btcnt=0;
for(int j=0;j<N;j++)
{
if(i&(1<<j))
{
btcnt++;
DP[i]+=P[j]*D[j]/100.+(100-P[j])*DP[i-(1<<j)]/100.;
}
}
DP[i]/=btcnt;
}
double maxv=0;
for(int i=1;i<(1<<N);i++)
{
if(maxv<DP[i]) maxv=DP[i];
}
printf("%.12lf",maxv);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9276 KB |
Output is correct |
2 |
Correct |
0 ms |
9276 KB |
Output is correct |
3 |
Correct |
0 ms |
9276 KB |
Output is correct |
4 |
Correct |
0 ms |
9276 KB |
Output is correct |
5 |
Correct |
0 ms |
9276 KB |
Output is correct |
6 |
Correct |
0 ms |
9276 KB |
Output is correct |
7 |
Correct |
0 ms |
9276 KB |
Output is correct |
8 |
Correct |
0 ms |
9276 KB |
Output is correct |
9 |
Correct |
0 ms |
9276 KB |
Output is correct |
10 |
Correct |
0 ms |
9276 KB |
Output is correct |
11 |
Correct |
0 ms |
9276 KB |
Output is correct |
12 |
Correct |
0 ms |
9276 KB |
Output is correct |
13 |
Correct |
0 ms |
9276 KB |
Output is correct |
14 |
Correct |
0 ms |
9276 KB |
Output is correct |
15 |
Correct |
0 ms |
9276 KB |
Output is correct |
16 |
Correct |
0 ms |
9276 KB |
Output is correct |
17 |
Correct |
0 ms |
9276 KB |
Output is correct |
18 |
Correct |
0 ms |
9276 KB |
Output is correct |
19 |
Correct |
0 ms |
9276 KB |
Output is correct |
20 |
Correct |
0 ms |
9276 KB |
Output is correct |
21 |
Correct |
0 ms |
9276 KB |
Output is correct |
22 |
Correct |
0 ms |
9276 KB |
Output is correct |
23 |
Correct |
0 ms |
9276 KB |
Output is correct |
24 |
Correct |
0 ms |
9276 KB |
Output is correct |
25 |
Correct |
0 ms |
9276 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
227 ms |
9276 KB |
Output is correct |
2 |
Correct |
227 ms |
9276 KB |
Output is correct |
3 |
Correct |
219 ms |
9276 KB |
Output is correct |
4 |
Correct |
226 ms |
9276 KB |
Output is correct |
5 |
Correct |
226 ms |
9276 KB |
Output is correct |
6 |
Correct |
226 ms |
9276 KB |
Output is correct |
7 |
Correct |
226 ms |
9276 KB |
Output is correct |
8 |
Correct |
226 ms |
9276 KB |
Output is correct |
9 |
Correct |
223 ms |
9276 KB |
Output is correct |
10 |
Correct |
214 ms |
9276 KB |
Output is correct |
11 |
Correct |
218 ms |
9276 KB |
Output is correct |
12 |
Correct |
205 ms |
9276 KB |
Output is correct |
13 |
Correct |
227 ms |
9276 KB |
Output is correct |
14 |
Correct |
222 ms |
9276 KB |
Output is correct |
15 |
Correct |
226 ms |
9276 KB |
Output is correct |
16 |
Correct |
171 ms |
9276 KB |
Output is correct |
17 |
Correct |
184 ms |
9276 KB |
Output is correct |
18 |
Correct |
207 ms |
9276 KB |
Output is correct |
19 |
Correct |
221 ms |
9276 KB |
Output is correct |
20 |
Correct |
223 ms |
9276 KB |
Output is correct |