Submission #650223

#	Time	Username	Problem	Language	Result	Execution time	Memory
650223		inksamurai	Prosjek (COCI18_prosjek)	C++17	40 / 50	1093 ms	46480 KiB

prosjek

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3yqVz8E;
	using ld=long double;
	std::map<vec(ld),int> mp;
	ld ans=0;
	auto dfs=[&](auto self,vec(ld) a)->void{
		sort(a.begin(), a.end());
		if(mp.find(a)!=mp.end())return;
		mp[a]=1;
		if(sz(a)==1){
			ans=max(ans,a[0]);
			return;
		}
		int n=sz(a);
		rep(i,n){
			rng(j,i+1,n){
				vec(ld) na;
				na.pb((a[i]+a[j])/2.0);
				rep(k,n)if(k!=i and k!=j)na.pb(a[k]);
				self(self,na);
			}
		}
	};
	int n;cin>>n;
	vec(ld) a;
	rep(i,n){
		int v;
		cin>>v;
		a.pb(v);
	}
	dfs(dfs,a);
	cout<<fixed<<setprecision(6);
	cout<<ans<<"\n";
}

• Subtask 1: 40 / 50