oj.uz

Submission #831334

# Submission time Handle Problem Language Result Execution time Memory
831334 2023-08-20T05:57:42 Z maomao90 Seesaw (JOI22_seesaw) C++17
67 / 100
 2000 ms 4564 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n;
int a[MAXN];
ll psm[MAXN];

ld solve(int l, int r, ld mn, ld mx) {
    if (l == r) {
        return mx - mn;
    }
    ld lsm = (ld) (psm[r] - psm[l]) / (r - l);
    if (lsm <= mx) {
        return solve(l + 1, r, mn, mx);
    }
    ld rsm = (ld) (psm[r - 1] - psm[l - 1]) / (r - l);
    if (mn <= rsm) {
        return solve(l, r - 1, mn, mx);
    }
    return min(solve(l + 1, r, mn, lsm), solve(l, r - 1, rsm, mx));
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> a[i];
        psm[i] = a[i] + psm[i - 1];
    }
    cout << setprecision(15) << solve(1, n, (ld) psm[n] / n, (ld) psm[n] / n) << '\n';
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1056 ms 348 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 327 ms 384 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1056 ms 348 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 327 ms 384 KB Output is correct
12 Execution timed out 2075 ms 4564 KB Time limit exceeded
13 Halted 0 ms 0 KB -