# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
100986 | KLPP | 새로운 문제 (COCI19_akvizna) | C++14 | 1570 ms | 1024 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
}
컴파일 시 표준 에러 (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... |