# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240103 | MrRobot_28 | Prosjek (COCI18_prosjek) | C++17 | 76 ms | 8576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector <double> x(n);
for(int i = 0; i< n; i++)
{
cin >> x[i];
}
vector <double> dp((1 << n), 0);
for(int i = 0; i < n; i++)
{
dp[(1 << i)] = x[i];
}
for(int i = 1; i < (1 << n) - 1; i++)
{
for(int j = 0; j < n; j++)
{
if(((1 << j) & i) == 0)
{
dp[i | (1 << j)] = max(dp[i | (1 << j)], (dp[i] + x[j]) / 2);
}
}
}
cout << fixed << setprecision(10) << dp[(1 << n) - 1];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |