# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938944 | Pacybwoah | Let's Win the Election (JOI22_ho_t3) | C++17 | 816 ms | 4440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<iomanip>
#include<utility>
#include<algorithm>
#define ld long double
using namespace std;
vector<pair<ld,ld>> vec;
int n,k;
ld solve(int m){
vector<vector<ld>> dp(n+1,vector<ld>(k-m+1,1e9+7));
dp[1][0]=(m>0?vec[1].first:0);
if(k-m>0) dp[1][1]=vec[1].second;
for(int i=2;i<=n;i++){
for(int j=0;j<=min(k-m,i);j++){
if(i!=j) dp[i][j]=min(dp[i][j],dp[i-1][j]+(i-j>m?0:vec[i].first/(long double)(i-j)));
if(j>0) dp[i][j]=min(dp[i][j],dp[i-1][j-1]+vec[i].second/(long double)(m+1));
}
}
/*for(int i=1;i<=n;i++){
for(int j=0;j<=k-m;j++) if(m==2) cout<<dp[i][j]<<" ";
cout<<"\n";
}*/
return dp[n][k-m];
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
vec.resize(n+1);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |