oj.uz

Submission #15310

# Submission time Handle Problem Language Result Execution time Memory
15310 2015-07-12T05:36:36 Z gs13068 최적의 능력 구성 (kriii3_C) C++
62 / 62
 100 ms 9764 KB 
#include<cstdio>
#include<algorithm>

double d[1111111];
double p[22],q[22];

int main()
{
    double max=0;
    int i,j,t,n;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%lf%lf",&p[i],&q[i]);
        p[i]/=100;
    }
    for(i=1;i<(1<<n);i++)
    {
        t=0;
        for(j=0;j<n;j++)if((i>>j)&1)
        {
            t++;
            d[i]+=p[j]*q[j]+(1-p[j])*d[i^(1<<j)];
        }
        d[i]/=t;
        max=std::max(max,d[i]);
    }
    printf("%.12lf\n",max);
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9764 KB Output is correct
2 Correct 0 ms 9764 KB Output is correct
3 Correct 0 ms 9764 KB Output is correct
4 Correct 0 ms 9764 KB Output is correct
5 Correct 0 ms 9764 KB Output is correct
6 Correct 0 ms 9764 KB Output is correct
7 Correct 0 ms 9764 KB Output is correct
8 Correct 0 ms 9764 KB Output is correct
9 Correct 0 ms 9764 KB Output is correct
10 Correct 0 ms 9764 KB Output is correct
11 Correct 0 ms 9764 KB Output is correct
12 Correct 0 ms 9764 KB Output is correct
13 Correct 0 ms 9764 KB Output is correct
14 Correct 0 ms 9764 KB Output is correct
15 Correct 0 ms 9764 KB Output is correct
16 Correct 0 ms 9764 KB Output is correct
17 Correct 0 ms 9764 KB Output is correct
18 Correct 0 ms 9764 KB Output is correct
19 Correct 0 ms 9764 KB Output is correct
20 Correct 0 ms 9764 KB Output is correct
21 Correct 0 ms 9764 KB Output is correct
22 Correct 0 ms 9764 KB Output is correct
23 Correct 0 ms 9764 KB Output is correct
24 Correct 0 ms 9764 KB Output is correct
25 Correct 0 ms 9764 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9764 KB Output is correct
2 Correct 97 ms 9764 KB Output is correct
3 Correct 100 ms 9764 KB Output is correct
4 Correct 99 ms 9764 KB Output is correct
5 Correct 100 ms 9764 KB Output is correct
6 Correct 95 ms 9764 KB Output is correct
7 Correct 100 ms 9764 KB Output is correct
8 Correct 90 ms 9764 KB Output is correct
9 Correct 100 ms 9764 KB Output is correct
10 Correct 91 ms 9764 KB Output is correct
11 Correct 100 ms 9764 KB Output is correct
12 Correct 96 ms 9764 KB Output is correct
13 Correct 96 ms 9764 KB Output is correct
14 Correct 99 ms 9764 KB Output is correct
15 Correct 99 ms 9764 KB Output is correct
16 Correct 100 ms 9764 KB Output is correct
17 Correct 95 ms 9764 KB Output is correct
18 Correct 99 ms 9764 KB Output is correct
19 Correct 92 ms 9764 KB Output is correct
20 Correct 100 ms 9764 KB Output is correct