Submission #3943534

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

#ifdef DEBUG
#define debug(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(fmt, ...)
#endif

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


double solve(int N, vd& p) {
    vector<vd> dp(N+1, vd(N+1, 0));
    // dp[i][j] : j枚やってi枚表
    dp[0][0] = 1.0;
    rep1(i,N){
        double pi = p[i-1];
        rep(j, N) {
            dp[i][j]   += dp[i-1][j] * (1.0 - pi);
            dp[i][j+1] += dp[i-1][j] * pi;
        }
    }
    double ans = 0;
    int h = (N+1)/2;
    for (int i=h; i<=N; ++i) ans += dp[N][i];
    return ans;
}

int main() {
    int N; cin >> N;
    vd p(N);
    rep(i,N) cin >> p[i];
    printf("%.10f\n", solve(N,p));
    return 0;
}

Submission Info

Submission Time
Task I - Coins
User naoya_t
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2557 Byte
Status
Exec Time 52 ms
Memory 70656 KB

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18, 1_19, 1_20, 1_21, 1_22, 1_23, 1_24, 1_25, 1_26, 1_27, 1_28, 1_29
Case Name Status Exec Time Memory
0_00 1 ms 256 KB
0_01 1 ms 256 KB
0_02 1 ms 256 KB
1_00 1 ms 256 KB
1_01 1 ms 256 KB
1_02 1 ms 256 KB
1_03 48 ms 70656 KB
1_04 51 ms 70656 KB
1_05 48 ms 70656 KB
1_06 51 ms 70016 KB
1_07 51 ms 70400 KB
1_08 50 ms 68992 KB
1_09 51 ms 69504 KB
1_10 50 ms 68992 KB
1_11 50 ms 68352 KB
1_12 48 ms 65792 KB
1_13 51 ms 70400 KB
1_14 51 ms 68992 KB
1_15 50 ms 68992 KB
1_16 51 ms 69760 KB
1_17 52 ms 70656 KB
1_18 51 ms 69120 KB
1_19 51 ms 69120 KB
1_20 50 ms 68352 KB
1_21 51 ms 69760 KB
1_22 51 ms 69760 KB
1_23 51 ms 69632 KB
1_24 51 ms 69376 KB
1_25 51 ms 69248 KB
1_26 49 ms 66688 KB
1_27 51 ms 70400 KB
1_28 50 ms 68352 KB
1_29 50 ms 68480 KB