oj.uz

Submission #878141

# Submission time Handle Problem Language Result Execution time Memory
878141 2023-11-24T06:01:39 Z vjudge1 Sequence (APIO23_sequence) C++17
100 / 100
 1245 ms 70684 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);
                assert(mx_sum >= mn_sum);
                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 23132 KB Output is correct
3 Correct 4 ms 23164 KB Output is correct
4 Correct 5 ms 23140 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 22984 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 5 ms 23128 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23164 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 23132 KB Output is correct
3 Correct 4 ms 23164 KB Output is correct
4 Correct 5 ms 23140 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 22984 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 5 ms 23128 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23164 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 7 ms 23232 KB Output is correct
15 Correct 7 ms 23132 KB Output is correct
16 Correct 7 ms 23132 KB Output is correct
17 Correct 6 ms 23132 KB Output is correct
18 Correct 6 ms 23176 KB Output is correct
19 Correct 6 ms 23132 KB Output is correct
20 Correct 7 ms 23132 KB Output is correct
21 Correct 7 ms 23172 KB Output is correct
22 Correct 6 ms 23132 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 755 ms 65172 KB Output is correct
3 Correct 751 ms 64948 KB Output is correct
4 Correct 687 ms 54788 KB Output is correct
5 Correct 738 ms 63920 KB Output is correct
6 Correct 718 ms 63768 KB Output is correct
7 Correct 706 ms 55572 KB Output is correct
8 Correct 697 ms 55716 KB Output is correct
9 Correct 653 ms 54796 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23132 KB Output is correct
2 Correct 772 ms 54924 KB Output is correct
3 Correct 799 ms 54796 KB Output is correct
4 Correct 853 ms 54792 KB Output is correct
5 Correct 708 ms 55036 KB Output is correct
6 Correct 763 ms 54868 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 976 ms 70684 KB Output is correct
2 Correct 950 ms 70480 KB Output is correct
3 Correct 941 ms 70076 KB Output is correct
4 Correct 926 ms 70072 KB Output is correct
5 Correct 878 ms 66660 KB Output is correct
6 Correct 944 ms 66664 KB Output is correct
7 Correct 798 ms 65604 KB Output is correct
8 Correct 800 ms 65324 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 23132 KB Output is correct
3 Correct 4 ms 23164 KB Output is correct
4 Correct 5 ms 23140 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 22984 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 5 ms 23128 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23164 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 7 ms 23232 KB Output is correct
15 Correct 7 ms 23132 KB Output is correct
16 Correct 7 ms 23132 KB Output is correct
17 Correct 6 ms 23132 KB Output is correct
18 Correct 6 ms 23176 KB Output is correct
19 Correct 6 ms 23132 KB Output is correct
20 Correct 7 ms 23132 KB Output is correct
21 Correct 7 ms 23172 KB Output is correct
22 Correct 6 ms 23132 KB Output is correct
23 Correct 155 ms 31832 KB Output is correct
24 Correct 149 ms 31836 KB Output is correct
25 Correct 153 ms 31824 KB Output is correct
26 Correct 158 ms 30900 KB Output is correct
27 Correct 157 ms 30808 KB Output is correct
28 Correct 158 ms 30808 KB Output is correct
29 Correct 125 ms 30516 KB Output is correct
30 Correct 144 ms 30580 KB Output is correct
31 Correct 99 ms 30932 KB Output is correct
32 Correct 115 ms 32920 KB Output is correct
33 Correct 142 ms 31836 KB Output is correct
34 Correct 143 ms 31836 KB Output is correct
35 Correct 152 ms 31824 KB Output is correct
36 Correct 145 ms 31580 KB Output is correct
37 Correct 146 ms 31580 KB Output is correct
38 Correct 149 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 23132 KB Output is correct
3 Correct 4 ms 23164 KB Output is correct
4 Correct 5 ms 23140 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 22984 KB Output is correct
8 Correct 5 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 5 ms 23128 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23164 KB Output is correct
13 Correct 7 ms 23132 KB Output is correct
14 Correct 7 ms 23232 KB Output is correct
15 Correct 7 ms 23132 KB Output is correct
16 Correct 7 ms 23132 KB Output is correct
17 Correct 6 ms 23132 KB Output is correct
18 Correct 6 ms 23176 KB Output is correct
19 Correct 6 ms 23132 KB Output is correct
20 Correct 7 ms 23132 KB Output is correct
21 Correct 7 ms 23172 KB Output is correct
22 Correct 6 ms 23132 KB Output is correct
23 Correct 755 ms 65172 KB Output is correct
24 Correct 751 ms 64948 KB Output is correct
25 Correct 687 ms 54788 KB Output is correct
26 Correct 738 ms 63920 KB Output is correct
27 Correct 718 ms 63768 KB Output is correct
28 Correct 706 ms 55572 KB Output is correct
29 Correct 697 ms 55716 KB Output is correct
30 Correct 653 ms 54796 KB Output is correct
31 Correct 772 ms 54924 KB Output is correct
32 Correct 799 ms 54796 KB Output is correct
33 Correct 853 ms 54792 KB Output is correct
34 Correct 708 ms 55036 KB Output is correct
35 Correct 763 ms 54868 KB Output is correct
36 Correct 976 ms 70684 KB Output is correct
37 Correct 950 ms 70480 KB Output is correct
38 Correct 941 ms 70076 KB Output is correct
39 Correct 926 ms 70072 KB Output is correct
40 Correct 878 ms 66660 KB Output is correct
41 Correct 944 ms 66664 KB Output is correct
42 Correct 798 ms 65604 KB Output is correct
43 Correct 800 ms 65324 KB Output is correct
44 Correct 155 ms 31832 KB Output is correct
45 Correct 149 ms 31836 KB Output is correct
46 Correct 153 ms 31824 KB Output is correct
47 Correct 158 ms 30900 KB Output is correct
48 Correct 157 ms 30808 KB Output is correct
49 Correct 158 ms 30808 KB Output is correct
50 Correct 125 ms 30516 KB Output is correct
51 Correct 144 ms 30580 KB Output is correct
52 Correct 99 ms 30932 KB Output is correct
53 Correct 115 ms 32920 KB Output is correct
54 Correct 142 ms 31836 KB Output is correct
55 Correct 143 ms 31836 KB Output is correct
56 Correct 152 ms 31824 KB Output is correct
57 Correct 145 ms 31580 KB Output is correct
58 Correct 146 ms 31580 KB Output is correct
59 Correct 149 ms 31836 KB Output is correct
60 Correct 1199 ms 65152 KB Output is correct
61 Correct 1211 ms 64944 KB Output is correct
62 Correct 1202 ms 65028 KB Output is correct
63 Correct 1245 ms 56796 KB Output is correct
64 Correct 1228 ms 56788 KB Output is correct
65 Correct 1218 ms 56772 KB Output is correct
66 Correct 884 ms 54932 KB Output is correct
67 Correct 881 ms 55092 KB Output is correct
68 Correct 561 ms 57220 KB Output is correct
69 Correct 685 ms 70684 KB Output is correct
70 Correct 1128 ms 64036 KB Output is correct
71 Correct 1147 ms 63852 KB Output is correct
72 Correct 1148 ms 63364 KB Output is correct
73 Correct 1143 ms 63660 KB Output is correct
74 Correct 1166 ms 63484 KB Output is correct
75 Correct 1142 ms 63704 KB Output is correct