oj.uz

Submission #240103

# Submission time Handle Problem Language Result Execution time Memory
240103 2020-06-18T05:03:11 Z MrRobot_28 Prosjek (COCI18_prosjek) C++17
50 / 50
 76 ms 8576 KB 
#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;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 13 ms 1408 KB Output is correct
10 Correct 76 ms 8576 KB Output is correct