oj.uz

Submission #1059118

# Submission time Handle Problem Language Result Execution time Memory
1059118 2024-08-14T17:25:22 Z vjudge1 Bigger segments (IZhO19_segments) C++17
73 / 100
 303 ms 262144 KB 
#include <bits/stdc++.h>
#ifdef LOCAL
    #include "/home/trcmai/code/tools.h"
    #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
    #define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define int long long
#define endl '\n'
const int N = 5e5 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;
int n;

struct dynamic_segment_tree
{
    struct node {ll v, l, r; node() {v = 0; l = -1, r = -1;}};
    vector<node> st;
    dynamic_segment_tree() {st.clear(); st.push_back(node());};
    void update(long long id, long long l, long long r, long long i, ll x)
    {
        if (l == r) {st[id].v = max(st[id].v,x); return;}
        long long m = (r+l)>>1; st[id].v = max(st[id].v,x);
        if (l <= i && i <= m)
        {
            if (st[id].l == -1) {st[id].l = st.size(); st.push_back(node());}
            update(st[id].l,l,m,i,x);
        }
        if (m < i && i <= r)
        {
            if (st[id].r == -1) {st[id].r = st.size(); st.push_back(node());}
            update(st[id].r,m+1,r,i,x);
        }
    }
    ll get(long long id, long long l, long long r, long long u, long long v)
    {
        if (r < u || v < l) return 0;
        if (u <= l && r <= v) return st[id].v;
        long long m = (r+l)>>1; ll val = 0;
        if (st[id].l != -1) val = max(val,get(st[id].l,l,m,u,v));
        if (st[id].r != -1) val = max(val,get(st[id].r,m+1,r,u,v));
        return val;
    }
    void update(long long i, ll x) {update(0,0,1e17,i,x);}
    ll get(long long u, long long v) {return get(0,0,1e17,u,v);}
}st;
ll a[N],dp[N],opt[N];
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin>>n; 
    for(int i = 1;i <= n;++i){
        cin>>a[i];
        a[i] += a[i - 1];
    }
    for(int i = 1;i <= n;++i){
        int j = st.get(0,a[i]);
        dp[i] = dp[j] + 1; 
        opt[i] = a[i] - a[j]; 
        st.update(opt[i] + a[i],i);
    }
    cout<<dp[n]<<endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2844 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 1 ms 2904 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2844 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2904 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2844 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 1 ms 2904 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2844 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2904 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 2 ms 4052 KB Output is correct
33 Correct 3 ms 6672 KB Output is correct
34 Correct 3 ms 5812 KB Output is correct
35 Correct 4 ms 7120 KB Output is correct
36 Correct 3 ms 7120 KB Output is correct
37 Correct 3 ms 6096 KB Output is correct
38 Correct 2 ms 4052 KB Output is correct
39 Correct 2 ms 2952 KB Output is correct
40 Correct 3 ms 6864 KB Output is correct
41 Correct 1 ms 3100 KB Output is correct
42 Correct 2 ms 3416 KB Output is correct
43 Correct 2 ms 3100 KB Output is correct
44 Correct 2 ms 4052 KB Output is correct
45 Correct 2 ms 4144 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2844 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 1 ms 2904 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2844 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2904 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 2 ms 4052 KB Output is correct
33 Correct 3 ms 6672 KB Output is correct
34 Correct 3 ms 5812 KB Output is correct
35 Correct 4 ms 7120 KB Output is correct
36 Correct 3 ms 7120 KB Output is correct
37 Correct 3 ms 6096 KB Output is correct
38 Correct 2 ms 4052 KB Output is correct
39 Correct 2 ms 2952 KB Output is correct
40 Correct 3 ms 6864 KB Output is correct
41 Correct 1 ms 3100 KB Output is correct
42 Correct 2 ms 3416 KB Output is correct
43 Correct 2 ms 3100 KB Output is correct
44 Correct 2 ms 4052 KB Output is correct
45 Correct 2 ms 4144 KB Output is correct
46 Correct 51 ms 57116 KB Output is correct
47 Correct 59 ms 57412 KB Output is correct
48 Correct 93 ms 108604 KB Output is correct
49 Correct 91 ms 108764 KB Output is correct
50 Correct 104 ms 108684 KB Output is correct
51 Correct 91 ms 108764 KB Output is correct
52 Correct 48 ms 54692 KB Output is correct
53 Correct 22 ms 28100 KB Output is correct
54 Correct 40 ms 22208 KB Output is correct
55 Correct 105 ms 108688 KB Output is correct
56 Correct 63 ms 57260 KB Output is correct
57 Correct 58 ms 59172 KB Output is correct
58 Correct 57 ms 59048 KB Output is correct
59 Correct 65 ms 59044 KB Output is correct
60 Correct 63 ms 59048 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2844 KB Output is correct
17 Correct 1 ms 2904 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 1 ms 2904 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2844 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2904 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 2 ms 4052 KB Output is correct
33 Correct 3 ms 6672 KB Output is correct
34 Correct 3 ms 5812 KB Output is correct
35 Correct 4 ms 7120 KB Output is correct
36 Correct 3 ms 7120 KB Output is correct
37 Correct 3 ms 6096 KB Output is correct
38 Correct 2 ms 4052 KB Output is correct
39 Correct 2 ms 2952 KB Output is correct
40 Correct 3 ms 6864 KB Output is correct
41 Correct 1 ms 3100 KB Output is correct
42 Correct 2 ms 3416 KB Output is correct
43 Correct 2 ms 3100 KB Output is correct
44 Correct 2 ms 4052 KB Output is correct
45 Correct 2 ms 4144 KB Output is correct
46 Correct 51 ms 57116 KB Output is correct
47 Correct 59 ms 57412 KB Output is correct
48 Correct 93 ms 108604 KB Output is correct
49 Correct 91 ms 108764 KB Output is correct
50 Correct 104 ms 108684 KB Output is correct
51 Correct 91 ms 108764 KB Output is correct
52 Correct 48 ms 54692 KB Output is correct
53 Correct 22 ms 28100 KB Output is correct
54 Correct 40 ms 22208 KB Output is correct
55 Correct 105 ms 108688 KB Output is correct
56 Correct 63 ms 57260 KB Output is correct
57 Correct 58 ms 59172 KB Output is correct
58 Correct 57 ms 59048 KB Output is correct
59 Correct 65 ms 59044 KB Output is correct
60 Correct 63 ms 59048 KB Output is correct
61 Correct 227 ms 210264 KB Output is correct
62 Correct 252 ms 210244 KB Output is correct
63 Correct 303 ms 210216 KB Output is correct
64 Runtime error 298 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -