Submission #1182787

#TimeUsernameProblemLanguageResultExecution timeMemory
1182787william889Let's Win the Election (JOI22_ho_t3)C++20
100 / 100
99 ms480 KiB
# include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n,k; cin>>n>>k; double cnt=2e18; vector<pair<double,double>>v(n); for(int i=0;i<n;i++){ cin>>v[i].second>>v[i].first; if(v[i].first==-1) v[i].first=1e9; } sort(v.begin(),v.end()); for(int i=0;i<k;i++){ int x=k-i; vector<double>dp(x+1,1e18); dp[0]=0; for(int j=0;j<n;j++){ for(int ii=x;ii>=0;ii--){ if(ii!=x) dp[ii+1]=min(dp[ii+1],dp[ii]+v[j].second/(1+i)); int pos=j+1-ii; if(pos<=0) continue; if(pos<=i) dp[ii]+=v[j].first/(double)pos; } } cnt=min(cnt,dp[x]); } cout<<fixed<<setprecision(10)<<cnt;; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...