Submission #240103

#TimeUsernameProblemLanguageResultExecution timeMemory
240103MrRobot_28Prosjek (COCI18_prosjek)C++17
50 / 50
76 ms8576 KiB
#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 timeMemoryGrader output
Fetching results...