oj.uz

Submission #877748

# Submission time Handle Problem Language Result Execution time Memory
877748 2023-11-23T13:54:58 Z dimashhh Sequence (APIO23_sequence) C++17
100 / 100
 1237 ms 70676 KB 
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
const int N = 5e5 + 1;
typedef long long ll;

int n;
struct segtree{
    int mn[N * 4],mx[N * 4],add[N * 4];
    void build(int v = 1,int tl = 1,int tr = n){
        add[v] = mn[v] = mx[v] = 0;
        if(tl == tr) return;
        int tm = (tl + tr) >> 1;
        build(v + v,tl,tm);build(v + v + 1,tm + 1,tr);
    }
    void inc(int v,int val){
        add[v] += val;
        mn[v] += val;
        mx[v] += val;
    }
    void push(int v){
        if(add[v]){
            inc(v + v,add[v]);
            inc(v + v +1,add[v]);
            add[v] = 0;
        }
    }
    void upd(int l,int r,int val,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr){
            return;
        }
        if(tl >= l && tr <= r){
            inc(v,val);
        }else{
            push(v);
            int tm = (tl + tr) >> 1;
            upd(l,r,val,v+v,tl,tm);
            upd(l,r,val,v+v+1,tm+1,tr);
            mn[v] = min(mn[v + v],mn[v + v + 1]);
            mx[v] = max(mx[v + v],mx[v + v + 1]);
        }
    }
    int get_min(int l,int r,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr) return 1e9;
        if(tl >= l && tr <= r) return mn[v];
        push(v);
        int tm = (tl + tr) >> 1;
        mn[v] = min(mn[v + v],mn[v + v + 1]);
        mx[v] = max(mx[v + v],mx[v + v + 1]);
        return min(get_min(l,r,v+v,tl,tm),get_min(l,r,v+v+1,tm+1,tr));
    }
    int get_max(int l,int r,int v = 1,int tl = 1,int tr = n){
        if(l > r || tl > r || l > tr) return -1e9;
        if(tl >= l && tr <= r) return mx[v];
        push(v);
        int tm = (tl + tr) >> 1;
        mn[v] = min(mn[v + v],mn[v + v + 1]);
        mx[v] = max(mx[v + v],mx[v + v + 1]);
        return max(get_max(l,r,v+v,tl,tm),get_max(l,r,v+v+1,tm+1,tr));
    }
}T,T1;
vector<int> pos[N];
bool inter(int l,int r,int l1,int r1){
    return (min(r,r1) - max(l,l1) >= 0);
}
int sequence(int nn, std::vector<int> a) {
    n = nn;
    int mn = 1e9;
    for(int i = 0;i < nn;i++){
        mn = min(mn,a[i]);
        pos[a[i]].push_back(i + 1);
    }
    T.build();
    T1.build();
    for(int i = 1;i <= n;i++){
        T.upd(i,n,1);
        T1.upd(i,n,1);
    }
    int res = 1;
    for(int i = 1;i <= n;i++){
        for(int j:pos[i - 1]){
            T.upd(j,n,-2);
        }
        for(int j:pos[i]){
            T1.upd(j,n,-2);
        }
        int it = 0;
        for(int j = 0;j < (int)pos[i].size();j++){
            while(it < (int)pos[i].size()){
                ll mn_sum = T1.get_min(pos[i][it],n) - max(0,T1.get_max(1,pos[i][j] - 1));
                ll mx_sum = T.get_max(pos[i][it],n) - min(0,T.get_min(1,pos[i][j] - 1));
                int len = (it - j + 1);
                if(mn_sum * mx_sum <=0 ){
                    it++;
                }else{
                    break;  
                }
            }
            res = max(res,it - j);
        }
    }
    return res;

}

// int main() {
//   int N;
//   assert(1 == scanf("%d", &N));

//   std::vector<int> A(N);
//   for (int i = 0; i < N; ++i) {
//     assert(1 == scanf("%d", &A[i]));
//   }

//   int result = sequence(N, A);
//   printf("%d\n", result);
//   return 0;
// }

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:92:21: warning: unused variable 'len' [-Wunused-variable]
   92 |                 int len = (it - j + 1);
      |                     ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23384 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23128 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 5 ms 23160 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 5 ms 23128 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23384 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23128 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 5 ms 23160 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 5 ms 23128 KB Output is correct
13 Correct 7 ms 23128 KB Output is correct
14 Correct 7 ms 23132 KB Output is correct
15 Correct 8 ms 23132 KB Output is correct
16 Correct 7 ms 23168 KB Output is correct
17 Correct 7 ms 23132 KB Output is correct
18 Correct 6 ms 23132 KB Output is correct
19 Correct 6 ms 23224 KB Output is correct
20 Correct 6 ms 23132 KB Output is correct
21 Correct 6 ms 23132 KB Output is correct
22 Correct 7 ms 23244 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 744 ms 61648 KB Output is correct
3 Correct 749 ms 61632 KB Output is correct
4 Correct 692 ms 53812 KB Output is correct
5 Correct 732 ms 60692 KB Output is correct
6 Correct 725 ms 60692 KB Output is correct
7 Correct 652 ms 54184 KB Output is correct
8 Correct 697 ms 54328 KB Output is correct
9 Correct 640 ms 53612 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23384 KB Output is correct
2 Correct 781 ms 53948 KB Output is correct
3 Correct 803 ms 53688 KB Output is correct
4 Correct 835 ms 54968 KB Output is correct
5 Correct 734 ms 54780 KB Output is correct
6 Correct 765 ms 54876 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 920 ms 67368 KB Output is correct
2 Correct 941 ms 67412 KB Output is correct
3 Correct 934 ms 66804 KB Output is correct
4 Correct 919 ms 66788 KB Output is correct
5 Correct 880 ms 63460 KB Output is correct
6 Correct 879 ms 63452 KB Output is correct
7 Correct 796 ms 62252 KB Output is correct
8 Correct 804 ms 61936 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23384 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23128 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 5 ms 23160 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 5 ms 23128 KB Output is correct
13 Correct 7 ms 23128 KB Output is correct
14 Correct 7 ms 23132 KB Output is correct
15 Correct 8 ms 23132 KB Output is correct
16 Correct 7 ms 23168 KB Output is correct
17 Correct 7 ms 23132 KB Output is correct
18 Correct 6 ms 23132 KB Output is correct
19 Correct 6 ms 23224 KB Output is correct
20 Correct 6 ms 23132 KB Output is correct
21 Correct 6 ms 23132 KB Output is correct
22 Correct 7 ms 23244 KB Output is correct
23 Correct 150 ms 32008 KB Output is correct
24 Correct 155 ms 32012 KB Output is correct
25 Correct 150 ms 32012 KB Output is correct
26 Correct 157 ms 30808 KB Output is correct
27 Correct 170 ms 30808 KB Output is correct
28 Correct 156 ms 30808 KB Output is correct
29 Correct 126 ms 30300 KB Output is correct
30 Correct 127 ms 30588 KB Output is correct
31 Correct 83 ms 30676 KB Output is correct
32 Correct 103 ms 32860 KB Output is correct
33 Correct 139 ms 31836 KB Output is correct
34 Correct 146 ms 31836 KB Output is correct
35 Correct 138 ms 31760 KB Output is correct
36 Correct 145 ms 31580 KB Output is correct
37 Correct 152 ms 31576 KB Output is correct
38 Correct 146 ms 31836 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23128 KB Output is correct
2 Correct 4 ms 23384 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 5 ms 23132 KB Output is correct
5 Correct 6 ms 23128 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 5 ms 23160 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 5 ms 23132 KB Output is correct
10 Correct 4 ms 23132 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 5 ms 23128 KB Output is correct
13 Correct 7 ms 23128 KB Output is correct
14 Correct 7 ms 23132 KB Output is correct
15 Correct 8 ms 23132 KB Output is correct
16 Correct 7 ms 23168 KB Output is correct
17 Correct 7 ms 23132 KB Output is correct
18 Correct 6 ms 23132 KB Output is correct
19 Correct 6 ms 23224 KB Output is correct
20 Correct 6 ms 23132 KB Output is correct
21 Correct 6 ms 23132 KB Output is correct
22 Correct 7 ms 23244 KB Output is correct
23 Correct 744 ms 61648 KB Output is correct
24 Correct 749 ms 61632 KB Output is correct
25 Correct 692 ms 53812 KB Output is correct
26 Correct 732 ms 60692 KB Output is correct
27 Correct 725 ms 60692 KB Output is correct
28 Correct 652 ms 54184 KB Output is correct
29 Correct 697 ms 54328 KB Output is correct
30 Correct 640 ms 53612 KB Output is correct
31 Correct 781 ms 53948 KB Output is correct
32 Correct 803 ms 53688 KB Output is correct
33 Correct 835 ms 54968 KB Output is correct
34 Correct 734 ms 54780 KB Output is correct
35 Correct 765 ms 54876 KB Output is correct
36 Correct 920 ms 67368 KB Output is correct
37 Correct 941 ms 67412 KB Output is correct
38 Correct 934 ms 66804 KB Output is correct
39 Correct 919 ms 66788 KB Output is correct
40 Correct 880 ms 63460 KB Output is correct
41 Correct 879 ms 63452 KB Output is correct
42 Correct 796 ms 62252 KB Output is correct
43 Correct 804 ms 61936 KB Output is correct
44 Correct 150 ms 32008 KB Output is correct
45 Correct 155 ms 32012 KB Output is correct
46 Correct 150 ms 32012 KB Output is correct
47 Correct 157 ms 30808 KB Output is correct
48 Correct 170 ms 30808 KB Output is correct
49 Correct 156 ms 30808 KB Output is correct
50 Correct 126 ms 30300 KB Output is correct
51 Correct 127 ms 30588 KB Output is correct
52 Correct 83 ms 30676 KB Output is correct
53 Correct 103 ms 32860 KB Output is correct
54 Correct 139 ms 31836 KB Output is correct
55 Correct 146 ms 31836 KB Output is correct
56 Correct 138 ms 31760 KB Output is correct
57 Correct 145 ms 31580 KB Output is correct
58 Correct 152 ms 31576 KB Output is correct
59 Correct 146 ms 31836 KB Output is correct
60 Correct 1224 ms 64944 KB Output is correct
61 Correct 1231 ms 64932 KB Output is correct
62 Correct 1223 ms 65128 KB Output is correct
63 Correct 1229 ms 56800 KB Output is correct
64 Correct 1225 ms 56780 KB Output is correct
65 Correct 1237 ms 56772 KB Output is correct
66 Correct 893 ms 54924 KB Output is correct
67 Correct 877 ms 55056 KB Output is correct
68 Correct 568 ms 57224 KB Output is correct
69 Correct 694 ms 70676 KB Output is correct
70 Correct 1163 ms 64036 KB Output is correct
71 Correct 1153 ms 63860 KB Output is correct
72 Correct 1148 ms 63376 KB Output is correct
73 Correct 1167 ms 63708 KB Output is correct
74 Correct 1136 ms 63348 KB Output is correct
75 Correct 1165 ms 63692 KB Output is correct