Submission #1033205

#TimeUsernameProblemLanguageResultExecution timeMemory
1033205MarwenElarbiSure Bet (CEOI17_sure)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define fi first #define se second #define ll long long #define pb push_back #define ii pair<int,int> template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int nax=1e5+5; #define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int main() { optimise; int n; cin>>n; vector<double> tab(n*2); for (int i = 0; i < n; ++i) { cin>>tab[i]>>tab[n+i]; } double ans=0; for (int mask = 0; mask < (1<<(2*n)); ++mask) { pair<double,double> cnt={0,0}; for (int i = 0; i < n; ++i) { if((1<<i)&mask){ (i>=n ? cnt.se : cnt.fi)+=tab[i]; } } ans=max(ans,min(cnt.fi,cnt.se)-__builtin_popcount(mask)); } cout <<fixed<<setprecision(4)<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...