Submission #1108499

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

#define pb         push_back
#define mp         make_pair
#define ll         long long
#define PI         acos(-1.0)
#define ALL(A)     ((A).begin(), (A).end())
#define vsort(v)   sort(v.begin(),v.end())
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)

int main(){
    int N, K;
    cin >> N >> K;
    int R[N];
    FOR(i, 0, N){
        cin >> R[i];
    }

    int ratemax = 4000 * N;
    double dp[N+1][N+1][ratemax+1];
    double INF = 1000000;
    FOR(i, 0, N+1){
        FOR(j, 0, N+1){
            FOR(k, 0, ratemax+1) dp[i][j][k] = INF;
        }
    }
    cout << "WWW" << endl;
    FOR(i, 0, N+1){
        dp[i][0][0] = 0.0;
    }

    FOR(i, 0, N){
        FOR(j, 0, i+1){
            FOR(k, 0, ratemax+1){
                if(dp[i][j][k]==INF) continue;
                //no watch
                dp[i+1][j][k] = min(dp[i+1][j][k], dp[i][j][k]);
                //watch
                dp[i+1][j+1][k+R[i]] = min(dp[i+1][j+1][k+R[i]], (dp[i][j][k]+(double)R[i])/2);
            }
        }
    }

    double ans = INF;
    FOR(k, 0, ratemax+1){
        if(dp[N][K][k]==INF) continue;
        ans = min(ans, dp[N][K][k]); 
    }
    printf("%.09lf\n" ,ans);
}

Submission Info

Judge Result