oj.uz

Submission #151364

# Submission time Handle Problem Language Result Execution time Memory
151364 2019-09-02T14:32:17 Z theboatman Bigger segments (IZhO19_segments) C++17
27 / 100
 234 ms 262148 KB 
#include <bits/stdc++.h>

#define y1 theboatman
#define make_struct(args...) {args}

using namespace std;

typedef long long ll;

const long long INF = 1e18 + 10;
const int inf = 1e9 + 10;
const int N = 1e6 + 10;

struct tree {
    struct node {
        int mx, add;
    };

    int v, tl, tr;
    vector <node> t;

    void build(int n) {
        v = 1;
        tl = 0;
        tr = n - 1;

        t.assign(n * 4, make_struct(-inf, -inf));
    }

    void push(int v) {
        t[v * 2].add = max(t[v * 2].add, t[v].add);
        t[v * 2 + 1].add = max(t[v * 2 + 1].add, t[v].add);
    }

    void modify(int v, int tl, int tr, int l, int r, int x) {
        if (l > r) {
            return;
        }

        if (tl == l && tr == r) {
            t[v].add = max(t[v].add, x);
            return;
        }

        int tm = (tl + tr) / 2;
        modify(v * 2, tl, tm, l, min(r, tm), x);
        modify(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, x);
    }

    int get(int v, int tl, int tr, int pos) {

        if (tl == tr) {
            return t[v].add;
        }

        push(v);

        int tm = (tl + tr) / 2;
        if (pos <= tm) {
            return get(v * 2, tl, tm, pos);
        }
        else {
            return get(v * 2 + 1, tm + 1, tr, pos);
        }
    }

    int get(int pos) {
        return get(v, tl, tr, pos);
    }

    void modify(int l, int r, int x) {
        modify(v, tl, tr, l, r, x);
    }
};

tree dp[3010];
vector <long long> pref;

long long get(int l, int r) {
    long long res = pref[r];

    return (l ? res - pref[l - 1] : res);
}

int32_t main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;

    vector <int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    for(int i = 0; i < n; i++) {
        dp[i].build(n);
    }

    dp[0].modify(0, n - 1, 1);

    pref.resize(n);
    for(int i = 0; i < n; i++) {
        pref[i] = (i ? pref[i - 1] + a[i] : a[i]);
    }


    for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
            int l = j + 1, r = n;
            while(l < r) {
                int c = (l + r) / 2;
                if (get(i, j) > get(j + 1, c)) {
                    l = c + 1;
                }
                else {
                    r = c;
                }
            }

//            l = j + 1;
//            while(l < n && get(i, j) > get(j + 1, l)) {
//                l++;
//            }

            //cout << i << " " << j << " " << dp[i].get(j) + 1 << " " << l << " " << n - 1 << "\n";
            dp[j + 1].modify(l, n - 1, dp[i].get(j) + 1);
        }
    }

    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            ans = max(ans, dp[i].get(j));
        }
    }

    cout << ans << "\n";
    return 0;
}
/*
*/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 45 ms 8380 KB Output is correct
17 Correct 43 ms 8440 KB Output is correct
18 Correct 41 ms 8312 KB Output is correct
19 Correct 38 ms 8312 KB Output is correct
20 Correct 44 ms 8440 KB Output is correct
21 Correct 43 ms 8348 KB Output is correct
22 Correct 27 ms 5500 KB Output is correct
23 Correct 14 ms 3320 KB Output is correct
24 Correct 43 ms 8312 KB Output is correct
25 Correct 43 ms 8312 KB Output is correct
26 Correct 46 ms 8312 KB Output is correct
27 Correct 40 ms 8312 KB Output is correct
28 Correct 48 ms 8316 KB Output is correct
29 Correct 44 ms 8312 KB Output is correct
30 Correct 40 ms 8312 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 45 ms 8380 KB Output is correct
17 Correct 43 ms 8440 KB Output is correct
18 Correct 41 ms 8312 KB Output is correct
19 Correct 38 ms 8312 KB Output is correct
20 Correct 44 ms 8440 KB Output is correct
21 Correct 43 ms 8348 KB Output is correct
22 Correct 27 ms 5500 KB Output is correct
23 Correct 14 ms 3320 KB Output is correct
24 Correct 43 ms 8312 KB Output is correct
25 Correct 43 ms 8312 KB Output is correct
26 Correct 46 ms 8312 KB Output is correct
27 Correct 40 ms 8312 KB Output is correct
28 Correct 48 ms 8316 KB Output is correct
29 Correct 44 ms 8312 KB Output is correct
30 Correct 40 ms 8312 KB Output is correct
31 Runtime error 234 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 45 ms 8380 KB Output is correct
17 Correct 43 ms 8440 KB Output is correct
18 Correct 41 ms 8312 KB Output is correct
19 Correct 38 ms 8312 KB Output is correct
20 Correct 44 ms 8440 KB Output is correct
21 Correct 43 ms 8348 KB Output is correct
22 Correct 27 ms 5500 KB Output is correct
23 Correct 14 ms 3320 KB Output is correct
24 Correct 43 ms 8312 KB Output is correct
25 Correct 43 ms 8312 KB Output is correct
26 Correct 46 ms 8312 KB Output is correct
27 Correct 40 ms 8312 KB Output is correct
28 Correct 48 ms 8316 KB Output is correct
29 Correct 44 ms 8312 KB Output is correct
30 Correct 40 ms 8312 KB Output is correct
31 Runtime error 234 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 45 ms 8380 KB Output is correct
17 Correct 43 ms 8440 KB Output is correct
18 Correct 41 ms 8312 KB Output is correct
19 Correct 38 ms 8312 KB Output is correct
20 Correct 44 ms 8440 KB Output is correct
21 Correct 43 ms 8348 KB Output is correct
22 Correct 27 ms 5500 KB Output is correct
23 Correct 14 ms 3320 KB Output is correct
24 Correct 43 ms 8312 KB Output is correct
25 Correct 43 ms 8312 KB Output is correct
26 Correct 46 ms 8312 KB Output is correct
27 Correct 40 ms 8312 KB Output is correct
28 Correct 48 ms 8316 KB Output is correct
29 Correct 44 ms 8312 KB Output is correct
30 Correct 40 ms 8312 KB Output is correct
31 Runtime error 234 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -