| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15721 |
2015-07-16T11:31:15 Z |
cki86201 |
최적의 능력 구성 (kriii3_C) |
C++ |
|
405 ms |
13372 KB |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
double d[1 << 20], ans;
int p[22][2], n, bit[1 << 20];
int main(){
scanf("%d", &n);
for (int i = 0; i < n; i++)scanf("%d%d", p[i], p[i] + 1);
for (int i = 1; i < 1 << n; i++)for (int j = 0; j < n; j++)if ((1 << j) & i)bit[i]++;
for (int i = 0; i < 1 << n; i++){
for (int j = 0; j < n; j++){
if (!((1 << j) & i)){
d[1 << j | i] += 1.0 / bit[1 << j | i] * (p[j][0] / 100.0 * p[j][1] + (100 - p[j][0]) / 100.0 * d[i]);
}
}
if (ans < d[i])ans = d[i];
}
printf("%.10f", ans);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 2 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 3 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 4 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 5 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 6 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 7 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 8 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 9 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 10 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 11 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 12 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 13 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 14 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 15 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 16 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 17 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 18 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 19 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 20 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 21 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 22 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 23 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 24 |
Correct |
0 ms |
13372 KB |
Output is correct |
| 25 |
Correct |
0 ms |
13372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
401 ms |
13372 KB |
Output is correct |
| 2 |
Correct |
397 ms |
13372 KB |
Output is correct |
| 3 |
Correct |
397 ms |
13372 KB |
Output is correct |
| 4 |
Correct |
393 ms |
13372 KB |
Output is correct |
| 5 |
Correct |
397 ms |
13372 KB |
Output is correct |
| 6 |
Correct |
402 ms |
13372 KB |
Output is correct |
| 7 |
Correct |
405 ms |
13372 KB |
Output is correct |
| 8 |
Correct |
402 ms |
13372 KB |
Output is correct |
| 9 |
Correct |
399 ms |
13372 KB |
Output is correct |
| 10 |
Correct |
383 ms |
13372 KB |
Output is correct |
| 11 |
Correct |
394 ms |
13372 KB |
Output is correct |
| 12 |
Correct |
377 ms |
13372 KB |
Output is correct |
| 13 |
Correct |
397 ms |
13372 KB |
Output is correct |
| 14 |
Correct |
398 ms |
13372 KB |
Output is correct |
| 15 |
Correct |
398 ms |
13372 KB |
Output is correct |
| 16 |
Correct |
346 ms |
13372 KB |
Output is correct |
| 17 |
Correct |
358 ms |
13372 KB |
Output is correct |
| 18 |
Correct |
389 ms |
13372 KB |
Output is correct |
| 19 |
Correct |
396 ms |
13372 KB |
Output is correct |
| 20 |
Correct |
398 ms |
13372 KB |
Output is correct |
