| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 643750 | Pajaraja | Seesaw (JOI22_seesaw) | C++17 | 49 ms | 8224 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>
#define MAXN 200007
using namespace std;
pair<double,double> db[MAXN];
long long a[MAXN],p[MAXN];
double avg, ry[MAXN],sol=1000000000.0;
double intervalavg(int l,int r) {return (p[r]-p[l-1])/(r-l+1.0);}
int binarna(int l,int r,int k)
{
if(l==r) return l;
int s=(l+r)/2;
if(intervalavg(s,s+k)<avg) return binarna(s+1,r,k);
else return binarna(l,s,k);
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++) p[i]=p[i-1]+a[i];
avg=p[n]/(1.0*n);
for(int i=0;i<n-1;i++)
{
int ind=binarna(1,n-i,i);
db[i]={intervalavg(ind,ind+i)-avg,avg-intervalavg(ind-1,ind+i-1)};
}
db[n-1]={0,0};
sort(db,db+n);
for(int i=n-1;i>=0;i--) ry[i]=max(ry[i+1],db[i].second);
for(int i=0;i<n;i++) sol=min(sol,db[i].first+ry[i+1]);
printf("%.10f",sol);
}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... | ||||
