oj.uz

Submission #1097363

# Submission time Handle Problem Language Result Execution time Memory
1097363 2024-10-07T02:50:10 Z anhthi Bigger segments (IZhO19_segments) C++14
73 / 100
 621 ms 262144 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 5e5 + 5, M = 2e5 + 5, BASE = 307, LOG = 23;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n;
int a[N];

pair<ll, ll> f[N];

const ll L = 0, R = 1e16;
struct dynamic {
    struct node {
        int value;
        int lc, rc;
        node() {
            value = 0;
            lc = rc = -1;
        }
    };
    vector<node> st;
    dynamic() { create(); }
    void create() {
        st.pb(node());
    }   

    void fix(int i) {
        if (st[i].lc == -1) {
            create();
            st[i].lc = sz(st) - 1;
        }
        if (st[i].rc == -1) {
            create();
            st[i].rc = sz(st) - 1;
        }
    } 

    void upd(int i, ll l, ll r, ll p, int val) {
        if (l > p || r < p) return;
        if (l == r) {
            maximize(st[i].value, val);
            return;
        }
        fix(i);
        ll m = (l + r) >> 1;
        upd(st[i].lc, l, m, p, val);
        upd(st[i].rc, m + 1, r, p, val);
        st[i].value = max(st[ st[i].lc ].value, st[ st[i].rc ].value);
    }

    void upd(ll p, int val) {
        return upd(0, L, R, p, val);
    }

    int get(int i, ll l, ll r, ll u, ll v) {
        if (i == -1) return 0;
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return st[i].value;
        ll m = (l + r) >> 1;
        return max(get(st[i].lc, l, m, u, v), get(st[i].rc, m + 1, r, u, v));
    }

    int get(ll u, ll v) { return get(0, L, R, u, v); }

};
ll pf[N];
int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n;
    rep(i, n) cin >> a[i];
    rep(i, n) pf[i] = pf[i - 1] + a[i];

    dynamic dn;
    forn(i, 1, n) {
        int pos = dn.get(0, pf[i]);
        f[i] = {f[pos].first + 1, pf[i] - pf[pos]};
        dn.upd(f[i].second + pf[i], i);
    }

    cout << f[n].first;

    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 796 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 924 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 920 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 796 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 796 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 924 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 920 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 796 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 4 ms 2260 KB Output is correct
32 Correct 4 ms 2004 KB Output is correct
33 Correct 5 ms 3684 KB Output is correct
34 Correct 5 ms 3788 KB Output is correct
35 Correct 5 ms 3792 KB Output is correct
36 Correct 5 ms 3792 KB Output is correct
37 Correct 4 ms 3792 KB Output is correct
38 Correct 3 ms 2004 KB Output is correct
39 Correct 3 ms 1052 KB Output is correct
40 Correct 5 ms 3788 KB Output is correct
41 Correct 3 ms 1052 KB Output is correct
42 Correct 3 ms 1368 KB Output is correct
43 Correct 3 ms 796 KB Output is correct
44 Correct 4 ms 2248 KB Output is correct
45 Correct 5 ms 2260 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 796 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 924 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 920 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 796 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 4 ms 2260 KB Output is correct
32 Correct 4 ms 2004 KB Output is correct
33 Correct 5 ms 3684 KB Output is correct
34 Correct 5 ms 3788 KB Output is correct
35 Correct 5 ms 3792 KB Output is correct
36 Correct 5 ms 3792 KB Output is correct
37 Correct 4 ms 3792 KB Output is correct
38 Correct 3 ms 2004 KB Output is correct
39 Correct 3 ms 1052 KB Output is correct
40 Correct 5 ms 3788 KB Output is correct
41 Correct 3 ms 1052 KB Output is correct
42 Correct 3 ms 1368 KB Output is correct
43 Correct 3 ms 796 KB Output is correct
44 Correct 4 ms 2248 KB Output is correct
45 Correct 5 ms 2260 KB Output is correct
46 Correct 103 ms 27504 KB Output is correct
47 Correct 127 ms 52872 KB Output is correct
48 Correct 160 ms 102304 KB Output is correct
49 Correct 174 ms 101972 KB Output is correct
50 Correct 198 ms 102212 KB Output is correct
51 Correct 165 ms 101928 KB Output is correct
52 Correct 83 ms 51332 KB Output is correct
53 Correct 43 ms 26068 KB Output is correct
54 Correct 97 ms 15700 KB Output is correct
55 Correct 174 ms 102428 KB Output is correct
56 Correct 124 ms 52696 KB Output is correct
57 Correct 108 ms 27180 KB Output is correct
58 Correct 125 ms 52864 KB Output is correct
59 Correct 140 ms 52360 KB Output is correct
60 Correct 127 ms 52348 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 796 KB Output is correct
17 Correct 1 ms 856 KB Output is correct
18 Correct 1 ms 924 KB Output is correct
19 Correct 1 ms 856 KB Output is correct
20 Correct 1 ms 920 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 1 ms 796 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 4 ms 2260 KB Output is correct
32 Correct 4 ms 2004 KB Output is correct
33 Correct 5 ms 3684 KB Output is correct
34 Correct 5 ms 3788 KB Output is correct
35 Correct 5 ms 3792 KB Output is correct
36 Correct 5 ms 3792 KB Output is correct
37 Correct 4 ms 3792 KB Output is correct
38 Correct 3 ms 2004 KB Output is correct
39 Correct 3 ms 1052 KB Output is correct
40 Correct 5 ms 3788 KB Output is correct
41 Correct 3 ms 1052 KB Output is correct
42 Correct 3 ms 1368 KB Output is correct
43 Correct 3 ms 796 KB Output is correct
44 Correct 4 ms 2248 KB Output is correct
45 Correct 5 ms 2260 KB Output is correct
46 Correct 103 ms 27504 KB Output is correct
47 Correct 127 ms 52872 KB Output is correct
48 Correct 160 ms 102304 KB Output is correct
49 Correct 174 ms 101972 KB Output is correct
50 Correct 198 ms 102212 KB Output is correct
51 Correct 165 ms 101928 KB Output is correct
52 Correct 83 ms 51332 KB Output is correct
53 Correct 43 ms 26068 KB Output is correct
54 Correct 97 ms 15700 KB Output is correct
55 Correct 174 ms 102428 KB Output is correct
56 Correct 124 ms 52696 KB Output is correct
57 Correct 108 ms 27180 KB Output is correct
58 Correct 125 ms 52864 KB Output is correct
59 Correct 140 ms 52360 KB Output is correct
60 Correct 127 ms 52348 KB Output is correct
61 Correct 546 ms 211864 KB Output is correct
62 Correct 544 ms 211944 KB Output is correct
63 Correct 621 ms 210452 KB Output is correct
64 Runtime error 479 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -