oj.uz

Submission #786551

# Submission time Handle Problem Language Result Execution time Memory
786551 2023-07-18T09:04:02 Z Dan4Life Seesaw (JOI22_seesaw) C++17
0 / 100
 0 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)1e3+10;
int n;
double a[mxN], pr[mxN], dp[mxN][mxN];
const double INF = 1e18;

double chk(double L){
	for(int i = 0; i <= n; i++){
		for(int j = 0; j <= n; j++){
			dp[i][j] = INF;
		}
	}
	for(int i = 0; i < n; i++)
		if(a[i]>=L) dp[i][i] = a[i];
	for(int l = 2; l <= n; l++){
		for(int i = 0; i+l-1 < n; i++){
			int j = i+l-1;
			if(pr[j+1]-pr[i] < L*(j-i+1)) continue;
			dp[i][j] = (pr[j+1]-pr[i])/(j-i+1);
			dp[i][j] = max(dp[i][j], min(dp[i+1][j],dp[i][j-1]));
		}
	}
	return dp[0][n-1];
}

int main()
{
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	sort(a,a+n); double ans = a[n-1]-a[0];
	for(int i = 0; i < n; i++) pr[i+1] = pr[i]+a[i];
	for(int i = 0; i < n; i++){
		for(int j = i; j < n; j++){
			double L = (pr[j+1]-pr[i])/(j-i+1);
			ans = min(ans, chk(L)-L);
			L = (pr[n]-pr[j])/(n-i);
			ans = min(ans, chk(L)-L);
		}
		break;
	}
	cout << fixed << setprecision(9) << ans;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -