Submission #878636

#TimeUsernameProblemLanguageResultExecution timeMemory
878636Faisal_SaqibSure Bet (CEOI17_sure)C++17
0 / 100
47 ms412 KiB
#include <iostream> #include <vector> #include <cmath> #include <iomanip> using namespace std; #define int long long const int N=1001; long long p4[N]; signed main() { cout<<fixed<<setprecision(4); int n; cin>>n; p4[0]=1; for(int i=1;i<=n;i++) p4[i]=(p4[i-1]*4ll); vector<int> a,b; for(int i=0;i<n;i++) { double x,y; cin>>x>>y; x*=1e4; y*=1e4; a.push_back(x); b.push_back(y); } int ans=0; for(long long mask=0;mask<p4[n];mask++) { int s1=0,s2=0; int p=0; long long cur=mask; for(int j=0;j<n;j++) { if(cur%4==3) { s1+=a[j]; s2+=b[j]; p+=2; } else if(cur%4==2) { p++; s1+=a[j]; } else if(cur%4==1) { p++; s2+=b[j]; } cur/=4; } p*=(1e4); ans=max(ans,min(s1,s2)-p); } long double x=(long double)ans/(long double)(1e4); cout<<x<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...