# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100986 | KLPP | 새로운 문제 (COCI19_akvizna) | C++14 | 1570 ms | 1024 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<bits/stdc++.h>
using namespace std;
typedef long long int lld;
double DP[1000001];
int partitions[1000001];
int main(){
int n,k;
scanf("%d %d",&n,&k);
double lo,hi;
lo=-1000000;
hi=1000000;
while(hi-lo>1E-12){
double mid=(hi+lo)/2;
DP[0]=0;
partitions[0]=0;
for(int i=1;i<=n;i++){
DP[i]=-10000000000000;
for(int j=0;j<i;j++){
if(DP[i]<DP[j]+(double)(i-j)/i+mid){
partitions[i]=partitions[j]+1;
DP[i]=DP[j]+(double)(i-j)/i+mid;
}
}
}
//for(int i=0;i<=n;i++)cout<<partitions[i]<<" ";
//cout<<endl;
//cout<<lo<<" "<<hi<<" "<<endl;
if(partitions[n]<k){
lo=mid;
}else hi=mid;
}
//printf("%lf %lf\n",lo,hi);
DP[0]=0;
partitions[0]=0;
for(int i=1;i<=n;i++){
DP[i]=-10000000000000;
for(int j=0;j<i;j++){
if(DP[i]<DP[j]+(double)(i-j)/i+lo){
partitions[i]=partitions[j]+1;
DP[i]=DP[j]+(double)(i-j)/i+lo;
}
}
}
//cout<<DP[n]<<endl;
printf("%.10lf\n",DP[n]-k*lo);
return 0;
}
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... |
# | 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... |
# | 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... |
# | 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... |