oj.uz

Submission #919883

# Submission time Handle Problem Language Result Execution time Memory
919883 2024-02-01T18:47:57 Z JakobZorz Sequence (APIO23_sequence) C++17
100 / 100
 1669 ms 46856 KB 
#include"sequence.h"
#include<vector>
#include<iostream>
using namespace std;

const int TREE_SIZE=1<<19;

int n;
vector<int>arr[500000];
int tree_lazy[2*TREE_SIZE];
int tree_min[2*TREE_SIZE];
int tree_max[2*TREE_SIZE];

void push_lazy(int node){
    if(tree_lazy[node]!=0){
        tree_min[node]+=tree_lazy[node];
        tree_max[node]+=tree_lazy[node];
        if(node<TREE_SIZE){
            tree_lazy[2*node]+=tree_lazy[node];
            tree_lazy[2*node+1]+=tree_lazy[node];
        }
        tree_lazy[node]=0;
    }
}

int get_min(int node,int rl,int rr,int l,int r){
    push_lazy(node);
    if(r<=rl||rr<=l)
        return 1e8;
    if(l<=rl&&rr<=r)
        return tree_min[node];
    int mid=(rl+rr)/2;
    return min(get_min(2*node,rl,mid,l,r),get_min(2*node+1,mid,rr,l,r));
}

int get_max(int node,int rl,int rr,int l,int r){
    push_lazy(node);
    if(r<=rl||rr<=l)
        return -1e8;
    if(l<=rl&&rr<=r)
        return tree_max[node];
    int mid=(rl+rr)/2;
    return max(get_max(2*node,rl,mid,l,r),get_max(2*node+1,mid,rr,l,r));
}

int get_min(int l,int r){
    return get_min(1,0,TREE_SIZE,l,r);
}

int get_max(int l,int r){
    return get_max(1,0,TREE_SIZE,l,r);
}

void add(int node,int rl,int rr,int l,int r,int v){
    push_lazy(node);
    if(r<=rl||rr<=l)
        return;
    if(l<=rl&&rr<=r){
        tree_lazy[node]+=v;
        push_lazy(node);
        return;
    }
    int mid=(rl+rr)/2;
    add(2*node,rl,mid,l,r,v);
    add(2*node+1,mid,rr,l,r,v);
    tree_min[node]=min(tree_min[2*node],tree_min[2*node+1]);
    tree_max[node]=max(tree_max[2*node],tree_max[2*node+1]);
}

void add(int l,int r,int v){
    add(1,0,TREE_SIZE,l,r,v);
}

int sequence(int N,vector<int>A){
    n=N;
    for(int i=0;i<n;i++)
        arr[A[i]-1].push_back(i);
    for(int i=0;i<=n;i++)
        add(i,i+1,-i);
    
    int res=1;
    for(int v=0;v<n;v++){
        for(int idx:arr[v])
            add(idx+1,n+1,1);
        
        vector<int>mn1,mn2,mx1,mx2;
        int idx=0;
        int prev_mn1=1e8;
        int prev_mx1=-1e8;
        for(int i:arr[v]){
            mn1.push_back(min(prev_mn1,get_min(0,i+1)+idx));
            prev_mn1=mn1.back();
            mn2.push_back(get_min(i,n+1)-idx);
            mx1.push_back(max(prev_mx1,get_max(0,i+1)-idx+1));
            prev_mx1=mx1.back();
            mx2.push_back(get_max(i,n+1)+idx+1);
            idx++;
        }
        
        for(int r=0;r<(int)arr[v].size();r++){
            int l1=0,l2=0;
            {
                int rl=-1,rr=r;
                while(rl<rr-1){
                    int m=(rl+rr)/2;
                    if(mx1[m]<mn2[r])
                        rl=m;
                    else
                        rr=m;
                }
                l1=rr;
            }
            //while(l2<r&&mx2[r]<mn1[l2])
            //    l2++;
            {
                int rl=-1,rr=r;
                while(rl<rr-1){
                    int m=(rl+rr)/2;
                    if(mx2[r]<mn1[m])
                        rl=m;
                    else
                        rr=m;
                }
                l2=rr;
            }
            
            int l=max(l1,l2);
            res=max(res,r-l+1);
        }
        
        for(int idx:arr[v])
            add(idx+1,n+1,1);
    }
    
    return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15960 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 6 ms 16416 KB Output is correct
8 Correct 4 ms 15960 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15960 KB Output is correct
11 Correct 4 ms 15964 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15960 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 6 ms 16416 KB Output is correct
8 Correct 4 ms 15960 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15960 KB Output is correct
11 Correct 4 ms 15964 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct
13 Correct 9 ms 16216 KB Output is correct
14 Correct 9 ms 16216 KB Output is correct
15 Correct 10 ms 16472 KB Output is correct
16 Correct 8 ms 16220 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 8 ms 16216 KB Output is correct
19 Correct 10 ms 16216 KB Output is correct
20 Correct 8 ms 16216 KB Output is correct
21 Correct 9 ms 16216 KB Output is correct
22 Correct 9 ms 16216 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15960 KB Output is correct
2 Correct 1256 ms 38160 KB Output is correct
3 Correct 1277 ms 37896 KB Output is correct
4 Correct 1167 ms 32832 KB Output is correct
5 Correct 1264 ms 38640 KB Output is correct
6 Correct 1246 ms 38764 KB Output is correct
7 Correct 1175 ms 32060 KB Output is correct
8 Correct 1164 ms 31964 KB Output is correct
9 Correct 1207 ms 34996 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15960 KB Output is correct
2 Correct 1102 ms 39456 KB Output is correct
3 Correct 1098 ms 35132 KB Output is correct
4 Correct 1195 ms 36172 KB Output is correct
5 Correct 1218 ms 40252 KB Output is correct
6 Correct 1189 ms 36924 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1363 ms 43728 KB Output is correct
2 Correct 1348 ms 43856 KB Output is correct
3 Correct 1369 ms 43156 KB Output is correct
4 Correct 1370 ms 43280 KB Output is correct
5 Correct 1354 ms 40028 KB Output is correct
6 Correct 1366 ms 39820 KB Output is correct
7 Correct 1249 ms 38404 KB Output is correct
8 Correct 1268 ms 38260 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15960 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 6 ms 16416 KB Output is correct
8 Correct 4 ms 15960 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15960 KB Output is correct
11 Correct 4 ms 15964 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct
13 Correct 9 ms 16216 KB Output is correct
14 Correct 9 ms 16216 KB Output is correct
15 Correct 10 ms 16472 KB Output is correct
16 Correct 8 ms 16220 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 8 ms 16216 KB Output is correct
19 Correct 10 ms 16216 KB Output is correct
20 Correct 8 ms 16216 KB Output is correct
21 Correct 9 ms 16216 KB Output is correct
22 Correct 9 ms 16216 KB Output is correct
23 Correct 231 ms 19856 KB Output is correct
24 Correct 203 ms 19972 KB Output is correct
25 Correct 229 ms 19920 KB Output is correct
26 Correct 204 ms 19056 KB Output is correct
27 Correct 205 ms 19056 KB Output is correct
28 Correct 199 ms 19032 KB Output is correct
29 Correct 197 ms 19388 KB Output is correct
30 Correct 191 ms 19100 KB Output is correct
31 Correct 189 ms 20948 KB Output is correct
32 Correct 168 ms 20824 KB Output is correct
33 Correct 196 ms 20048 KB Output is correct
34 Correct 220 ms 20048 KB Output is correct
35 Correct 217 ms 20028 KB Output is correct
36 Correct 220 ms 20048 KB Output is correct
37 Correct 195 ms 19856 KB Output is correct
38 Correct 224 ms 20304 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15960 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 4 ms 15964 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 5 ms 15964 KB Output is correct
7 Correct 6 ms 16416 KB Output is correct
8 Correct 4 ms 15960 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15960 KB Output is correct
11 Correct 4 ms 15964 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct
13 Correct 9 ms 16216 KB Output is correct
14 Correct 9 ms 16216 KB Output is correct
15 Correct 10 ms 16472 KB Output is correct
16 Correct 8 ms 16220 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 8 ms 16216 KB Output is correct
19 Correct 10 ms 16216 KB Output is correct
20 Correct 8 ms 16216 KB Output is correct
21 Correct 9 ms 16216 KB Output is correct
22 Correct 9 ms 16216 KB Output is correct
23 Correct 1256 ms 38160 KB Output is correct
24 Correct 1277 ms 37896 KB Output is correct
25 Correct 1167 ms 32832 KB Output is correct
26 Correct 1264 ms 38640 KB Output is correct
27 Correct 1246 ms 38764 KB Output is correct
28 Correct 1175 ms 32060 KB Output is correct
29 Correct 1164 ms 31964 KB Output is correct
30 Correct 1207 ms 34996 KB Output is correct
31 Correct 1102 ms 39456 KB Output is correct
32 Correct 1098 ms 35132 KB Output is correct
33 Correct 1195 ms 36172 KB Output is correct
34 Correct 1218 ms 40252 KB Output is correct
35 Correct 1189 ms 36924 KB Output is correct
36 Correct 1363 ms 43728 KB Output is correct
37 Correct 1348 ms 43856 KB Output is correct
38 Correct 1369 ms 43156 KB Output is correct
39 Correct 1370 ms 43280 KB Output is correct
40 Correct 1354 ms 40028 KB Output is correct
41 Correct 1366 ms 39820 KB Output is correct
42 Correct 1249 ms 38404 KB Output is correct
43 Correct 1268 ms 38260 KB Output is correct
44 Correct 231 ms 19856 KB Output is correct
45 Correct 203 ms 19972 KB Output is correct
46 Correct 229 ms 19920 KB Output is correct
47 Correct 204 ms 19056 KB Output is correct
48 Correct 205 ms 19056 KB Output is correct
49 Correct 199 ms 19032 KB Output is correct
50 Correct 197 ms 19388 KB Output is correct
51 Correct 191 ms 19100 KB Output is correct
52 Correct 189 ms 20948 KB Output is correct
53 Correct 168 ms 20824 KB Output is correct
54 Correct 196 ms 20048 KB Output is correct
55 Correct 220 ms 20048 KB Output is correct
56 Correct 217 ms 20028 KB Output is correct
57 Correct 220 ms 20048 KB Output is correct
58 Correct 195 ms 19856 KB Output is correct
59 Correct 224 ms 20304 KB Output is correct
60 Correct 1657 ms 41632 KB Output is correct
61 Correct 1602 ms 41352 KB Output is correct
62 Correct 1669 ms 41324 KB Output is correct
63 Correct 1409 ms 33180 KB Output is correct
64 Correct 1285 ms 33336 KB Output is correct
65 Correct 1434 ms 33012 KB Output is correct
66 Correct 1250 ms 33624 KB Output is correct
67 Correct 1227 ms 33724 KB Output is correct
68 Correct 1084 ms 43676 KB Output is correct
69 Correct 1203 ms 46856 KB Output is correct
70 Correct 1609 ms 41852 KB Output is correct
71 Correct 1567 ms 42444 KB Output is correct
72 Correct 1522 ms 42084 KB Output is correct
73 Correct 1608 ms 42228 KB Output is correct
74 Correct 1532 ms 41672 KB Output is correct
75 Correct 1494 ms 42756 KB Output is correct