Submission #4680302

---

Source Code Expand

#include <iostream>

#define N_MAX 200000

using namespace std;

typedef long long ll;

ll x[N_MAX];

long cost(int n){
    if(n == 1) return 5;
    else return n*2+1;
}

int main(){
    int N, X;
    cin >> N >> X;
    ll ans = __LONG_MAX__;
    if(N > 2000) return 0;
    for(int i = 0; i < N ; i++){
        cin >> x[i];
    }
    for(int i = 1; i <= N; i++){
        ll tmp = X*i + X*N;
        for(int j = 0; j < N; j++){
            tmp += x[j]*(cost((N-j-1)/i+1));
        }
        //cout << tmp << endl;
        ans = min(ans, tmp);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result