oj.uz

Submission #885904

# Submission time Handle Problem Language Result Execution time Memory
885904 2023-12-11T02:54:40 Z dimashhh Bigger segments (IZhO19_segments) C++17
100 / 100
 262 ms 58240 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 1e6 + 1,MOD = 998244353;
typedef long long ll;
#define int long long
int n,a[N];
ll dp[N],mn[N],pref[N];
mt19937 rng(123321);

struct node{
    node *l = 0,*r = 0;
    ll mx,val,prior,key;
    node(ll key,ll val):key(key),val(val),mx(val),prior(rng()){}
};
using pnode = node *;
ll mx(pnode f){
    return (f ? f->mx : 0);
}
void upd(pnode &f){
    f->mx = max({f->val,mx(f->l),mx(f->r)});
}
pnode merge(pnode a,pnode b){
    if(!a) return b;
    if(!b) return a;
    if(a->prior > b->prior){
        a->r = merge(a->r,b);
        upd(a);
        return a;
    }else{
        b->l = merge(a,b->l);
        upd(b);
        return b;
    }
}
pair<pnode,pnode> split(pnode x,int val){
    if(!x) return {0,0};
    if(x->key <= val){
        auto [a,b] = split(x->r,val);
        x->r = a;
        upd(x);
        return {x,b};
    }else{
        auto [a,b] = split(x->l,val);
        x->l = b;
        upd(x);
        return {a,x};
    }
}
pnode root = NULL;
void insert(ll key,ll val){
    pnode nv = new node(key,val);
    auto [x,y] = split(root,key);
    root = merge(x,merge(nv,y));
}
void test(){
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }
    insert(0,0);    
    for(int i = 1;i <=n;i++){
        ll cur = 0;
        auto [x,y] = split(root,pref[i]);
        // if(!x) continue;
        ll val = x->mx;
        dp[i] = dp[val] + 1;
        mn[i] = pref[i] - pref[val];
        root = merge(x,y);
        insert(mn[i] + pref[i],i);
        // for(int j = i;j >= 1;j--){
        //     if(mn[j - 1] + pref[j - 1] <= pref[i]){
        //         if(dp[j - 1] + 1 > dp[i]){
        //             dp[i] = dp[j - 1] +1;
        //             mn[i] = pref[i] - pref[j - 1];
        //         }
        //     }
        // }
    }
    cout << dp[n];
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    // cin >> T;
    test();
}

Compilation message

segments.cpp: In constructor 'node::node(ll, ll)':
segments.cpp:13:21: warning: 'node::key' will be initialized after [-Wreorder]
   13 |     ll mx,val,prior,key;
      |                     ^~~
segments.cpp:13:11: warning:   'll node::val' [-Wreorder]
   13 |     ll mx,val,prior,key;
      |           ^~~
segments.cpp:14:5: warning:   when initialized here [-Wreorder]
   14 |     node(ll key,ll val):key(key),val(val),mx(val),prior(rng()){}
      |     ^~~~
segments.cpp:13:11: warning: 'node::val' will be initialized after [-Wreorder]
   13 |     ll mx,val,prior,key;
      |           ^~~
segments.cpp:13:8: warning:   'll node::mx' [-Wreorder]
   13 |     ll mx,val,prior,key;
      |        ^~
segments.cpp:14:5: warning:   when initialized here [-Wreorder]
   14 |     node(ll key,ll val):key(key),val(val),mx(val),prior(rng()){}
      |     ^~~~
segments.cpp: In function 'void test()':
segments.cpp:64:12: warning: unused variable 'cur' [-Wunused-variable]
   64 |         ll cur = 0;
      |            ^~~
segments.cpp: In function 'int main()':
segments.cpp:87:9: warning: unused variable 'T' [-Wunused-variable]
   87 |     int T = 1;
      |         ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 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 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 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 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 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 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 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 4444 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 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4596 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 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 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 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 4444 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 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4596 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 2 ms 4952 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 5 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 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 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 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 4444 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 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4596 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 2 ms 4952 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 5 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 38 ms 15708 KB Output is correct
47 Correct 50 ms 16212 KB Output is correct
48 Correct 44 ms 16464 KB Output is correct
49 Correct 41 ms 16720 KB Output is correct
50 Correct 35 ms 16996 KB Output is correct
51 Correct 47 ms 16792 KB Output is correct
52 Correct 22 ms 10576 KB Output is correct
53 Correct 13 ms 9052 KB Output is correct
54 Correct 44 ms 15956 KB Output is correct
55 Correct 47 ms 16720 KB Output is correct
56 Correct 28 ms 16212 KB Output is correct
57 Correct 33 ms 16728 KB Output is correct
58 Correct 35 ms 16208 KB Output is correct
59 Correct 28 ms 16208 KB Output is correct
60 Correct 39 ms 16216 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 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 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 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 4444 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 4440 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4440 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4596 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 2 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 2 ms 4952 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 5 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 38 ms 15708 KB Output is correct
47 Correct 50 ms 16212 KB Output is correct
48 Correct 44 ms 16464 KB Output is correct
49 Correct 41 ms 16720 KB Output is correct
50 Correct 35 ms 16996 KB Output is correct
51 Correct 47 ms 16792 KB Output is correct
52 Correct 22 ms 10576 KB Output is correct
53 Correct 13 ms 9052 KB Output is correct
54 Correct 44 ms 15956 KB Output is correct
55 Correct 47 ms 16720 KB Output is correct
56 Correct 28 ms 16212 KB Output is correct
57 Correct 33 ms 16728 KB Output is correct
58 Correct 35 ms 16208 KB Output is correct
59 Correct 28 ms 16208 KB Output is correct
60 Correct 39 ms 16216 KB Output is correct
61 Correct 209 ms 55344 KB Output is correct
62 Correct 218 ms 55184 KB Output is correct
63 Correct 262 ms 55708 KB Output is correct
64 Correct 236 ms 58192 KB Output is correct
65 Correct 153 ms 58240 KB Output is correct
66 Correct 249 ms 58196 KB Output is correct
67 Correct 193 ms 48728 KB Output is correct
68 Correct 95 ms 28240 KB Output is correct
69 Correct 225 ms 54224 KB Output is correct
70 Correct 245 ms 58196 KB Output is correct
71 Correct 140 ms 55120 KB Output is correct
72 Correct 209 ms 55636 KB Output is correct
73 Correct 164 ms 56152 KB Output is correct
74 Correct 162 ms 56656 KB Output is correct
75 Correct 166 ms 56700 KB Output is correct