oj.uz

답안 #920570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920570 2024-02-02T17:58:52 Z amirhoseinfar1385 Seesaw (JOI22_seesaw) C++17
100 / 100
 115 ms 22712 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=2000000+10;
long long all[maxn],ps[maxn],n;
long double md;
pair<long double,long double>stf[maxn];

long double calmian(int len,int l){
	int r=l+len-1;
	if(r>n){
		return 1e9+5;
	}
	long double ret=ps[r]-ps[l-1];
	ret/=len;
	return ret;
}

void calstf(int ind){
	int low=1,high=n+1,mid;
	while(high-low>1){
		mid=(high+low)>>1;
		if(calmian(ind,mid)<=md){
			low=mid;
		}
		else{
			high=mid;
		}
	}
	stf[ind].first=calmian(ind,low);
	stf[ind].second=calmian(ind,high);
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>all[i];
		ps[i]=ps[i-1]+all[i];
	}
	md=(long double)ps[n]/n;
	long double mx=md;
	vector<pair<long double,int>>v;
	for(int i=1;i<=n;i++){
		calstf(i);
		v.push_back(make_pair(stf[i].first,i));
	}
	sort(v.rbegin(),v.rend());
	long double res=1e9;
	while((int)v.size()>0){
		//cout<<mx<<" "<<v.back().first<<" "<<v.back().second<<endl;
		res=min(res,mx-v.back().first);
		mx=max(mx,stf[v.back().second].second);
		v.pop_back();
	}
	cout<<setprecision(10)<<fixed<<res<<endl;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4596 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4596 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4596 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4596 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 98 ms 22020 KB Output is correct
13 Correct 96 ms 21344 KB Output is correct
14 Correct 100 ms 22712 KB Output is correct
15 Correct 115 ms 22684 KB Output is correct
16 Correct 99 ms 22544 KB Output is correct