oj.uz

Submission #752640

# Submission time Handle Problem Language Result Execution time Memory
752640 2023-06-03T10:57:57 Z IBory Seesaw (JOI22_seesaw) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int MAX = 200007;
ll S[MAX], on[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N;
	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> S[i];
		S[i] += S[i - 1];
	}

	int g = N / 2;
	vector<pair<double, int>> P;
	for (int d = 1; d <= N; ++d) {
		if ((N - d) % 2 == 0) {
			P.emplace_back((S[N - g] - S[N - g - d]) / (double)d, d);
		}
		else {
			P.emplace_back((S[N - g] - S[N - g - d]) / (double)d, d);
			P.emplace_back((S[N - g + 1] - S[N - g + 1 - d]) / (double)d, d);
			g--;
		}
	}
	sort(P.begin(), P.end());

	double ans = 1e18;
	int cnt = 0, R = 0;
	on[P[0].second] = 1;
	for (int L = 0; L < P.size(); ++L) {
		while (R + 1 < P.size() && cnt != N - 1) {
			int t = P[++R].second;
			if (t != 1 && on[t - 1] && !on[t]) cnt++;
			if (t != N && on[t + 1] && !on[t]) cnt++;
			on[t]++;
		}
		if (cnt == N - 1) ans = min(ans, P[R].first - P[L].first);
		int t = P[L].second;
		on[t]--;
		if (t != 1 && on[t - 1] && !on[t]) cnt--;
		if (t != N && on[t + 1] && !on[t]) cnt--;
	}

	cout.precision(12);
	cout << fixed << ans;
	return 0;
}

Compilation message

seesaw.cpp: In function 'int main()':
seesaw.cpp:34:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |  for (int L = 0; L < P.size(); ++L) {
      |                  ~~^~~~~~~~~~
seesaw.cpp:35:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   while (R + 1 < P.size() && cnt != N - 1) {
      |          ~~~~~~^~~~~~~~~~

Subtask #1
0 / 1.0

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

Subtask #2
0 / 33.0

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

Subtask #3
0 / 33.0

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

Subtask #4
0 / 33.0

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