oj.uz

Submission #914562

# Submission time Handle Problem Language Result Execution time Memory
914562 2024-01-22T10:37:48 Z Ghetto Hacker (BOI15_hac) C++17
100 / 100
 261 ms 12364 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 5e5 + 5;

int n;
int arr[MAX_N];

int segtree[4 * MAX_N];
void update(int i, int x, int u = 1, int lo = 1, int hi = n) {
    if (lo == hi) {
        segtree[u] = x;
        return;
    }

    int mid = (lo + hi) / 2;
    if (i <= mid)
        update(i, x, 2 * u, lo, mid);
    else
        update(i, x, 2 * u + 1, mid + 1, hi);
    segtree[u] = max(segtree[2 * u], segtree[2 * u + 1]);
}
int query(int l, int r, int u = 1, int lo = 1, int hi = n) {
    if (l <= lo && hi <= r)
        return segtree[u];
    
    int mid = (lo + hi) / 2, ans = 0; // arr[i] >= 1
    if (l <= mid) 
        ans = max(ans, query(l, r, 2 * u, lo, mid));
    if (r > mid)
        ans = max(ans, query(l, r, 2 * u + 1, mid + 1, hi));
    return ans;
}

int subarray_sum[MAX_N];
int tot_sum;
void precomp() {
    int s = n / 2;

    for (int i = 1; i <= s; i++)
        subarray_sum[1] += arr[i];
    for (int i = 2; i <= n; i++) {
        int j = i + s - 1;
        if (j > n) 
            j -= n;
        subarray_sum[i] = subarray_sum[i - 1] - arr[i - 1] + arr[j];
        // cout << subarray_sum[i] << " ";
    }
    for (int i = 1; i <= n; i++)
        update(i, subarray_sum[i]);
    
    for (int i = 1; i <= n; i++)
        tot_sum += arr[i];
}

int main() {
    // freopen("hacker.in", "r", stdin);

    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> arr[i];
    
    precomp();
    
    int s = n / 2;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        int j = i - s;
        if (j >= 1)
            ans = max(ans, tot_sum - max(query(i + 1, n), query(1, j)));
        else {
            j += n;
            ans = max(ans, tot_sum - query(i + 1, j));
        }
    }
    cout << ans << '\n';
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4456 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4456 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 3 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 4 ms 4700 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 4 ms 4444 KB Output is correct
31 Correct 3 ms 4444 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 3 ms 4448 KB Output is correct
4 Correct 38 ms 6752 KB Output is correct
5 Correct 85 ms 6876 KB Output is correct
6 Correct 138 ms 8132 KB Output is correct
7 Correct 136 ms 10572 KB Output is correct
8 Correct 236 ms 12320 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4456 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 2 ms 4440 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 3 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 4 ms 4700 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 4 ms 4444 KB Output is correct
31 Correct 3 ms 4444 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 3 ms 4448 KB Output is correct
35 Correct 38 ms 6752 KB Output is correct
36 Correct 85 ms 6876 KB Output is correct
37 Correct 138 ms 8132 KB Output is correct
38 Correct 136 ms 10572 KB Output is correct
39 Correct 236 ms 12320 KB Output is correct
40 Correct 6 ms 4444 KB Output is correct
41 Correct 10 ms 4700 KB Output is correct
42 Correct 13 ms 4700 KB Output is correct
43 Correct 88 ms 7764 KB Output is correct
44 Correct 228 ms 12216 KB Output is correct
45 Correct 48 ms 7068 KB Output is correct
46 Correct 135 ms 10528 KB Output is correct
47 Correct 261 ms 12204 KB Output is correct
48 Correct 235 ms 12364 KB Output is correct
49 Correct 215 ms 11676 KB Output is correct
50 Correct 221 ms 11444 KB Output is correct