oj.uz

Submission #919880

# Submission time Handle Problem Language Result Execution time Memory
919880 2024-02-01T18:42:43 Z JakobZorz Sequence (APIO23_sequence) C++17
63 / 100
 2000 ms 43880 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;
            while(l1<r&&mx1[l1]<mn2[r])
                l1++;
            while(l2<r&&mx2[r]<mn1[l2])
                l2++;
            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 4 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 5 ms 15960 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15960 KB Output is correct
7 Correct 5 ms 16164 KB Output is correct
8 Correct 4 ms 16116 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15964 KB Output is correct
11 Correct 4 ms 15960 KB Output is correct
12 Correct 4 ms 15964 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 15960 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15960 KB Output is correct
7 Correct 5 ms 16164 KB Output is correct
8 Correct 4 ms 16116 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15964 KB Output is correct
11 Correct 4 ms 15960 KB Output is correct
12 Correct 4 ms 15964 KB Output is correct
13 Correct 8 ms 16216 KB Output is correct
14 Correct 8 ms 16216 KB Output is correct
15 Correct 8 ms 16216 KB Output is correct
16 Correct 9 ms 16216 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 9 ms 16216 KB Output is correct
19 Correct 9 ms 16216 KB Output is correct
20 Correct 9 ms 16216 KB Output is correct
21 Correct 8 ms 16216 KB Output is correct
22 Correct 8 ms 16216 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15960 KB Output is correct
2 Correct 1284 ms 37960 KB Output is correct
3 Correct 1304 ms 38128 KB Output is correct
4 Execution timed out 2037 ms 31728 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15960 KB Output is correct
2 Execution timed out 2021 ms 39328 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1366 ms 43880 KB Output is correct
2 Correct 1407 ms 43572 KB Output is correct
3 Correct 1372 ms 43344 KB Output is correct
4 Correct 1381 ms 43272 KB Output is correct
5 Correct 1384 ms 39896 KB Output is correct
6 Correct 1363 ms 39804 KB Output is correct
7 Correct 1289 ms 38536 KB Output is correct
8 Correct 1308 ms 38416 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 15960 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15960 KB Output is correct
7 Correct 5 ms 16164 KB Output is correct
8 Correct 4 ms 16116 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15964 KB Output is correct
11 Correct 4 ms 15960 KB Output is correct
12 Correct 4 ms 15964 KB Output is correct
13 Correct 8 ms 16216 KB Output is correct
14 Correct 8 ms 16216 KB Output is correct
15 Correct 8 ms 16216 KB Output is correct
16 Correct 9 ms 16216 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 9 ms 16216 KB Output is correct
19 Correct 9 ms 16216 KB Output is correct
20 Correct 9 ms 16216 KB Output is correct
21 Correct 8 ms 16216 KB Output is correct
22 Correct 8 ms 16216 KB Output is correct
23 Correct 225 ms 19968 KB Output is correct
24 Correct 221 ms 19792 KB Output is correct
25 Correct 235 ms 19972 KB Output is correct
26 Correct 213 ms 19056 KB Output is correct
27 Correct 213 ms 19024 KB Output is correct
28 Correct 216 ms 19108 KB Output is correct
29 Correct 363 ms 19056 KB Output is correct
30 Correct 371 ms 19080 KB Output is correct
31 Correct 194 ms 20936 KB Output is correct
32 Correct 174 ms 21076 KB Output is correct
33 Correct 213 ms 19972 KB Output is correct
34 Correct 232 ms 19852 KB Output is correct
35 Correct 234 ms 20048 KB Output is correct
36 Correct 259 ms 20052 KB Output is correct
37 Correct 224 ms 20052 KB Output is correct
38 Correct 246 ms 20048 KB Output is correct

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 15960 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15960 KB Output is correct
7 Correct 5 ms 16164 KB Output is correct
8 Correct 4 ms 16116 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 4 ms 15964 KB Output is correct
11 Correct 4 ms 15960 KB Output is correct
12 Correct 4 ms 15964 KB Output is correct
13 Correct 8 ms 16216 KB Output is correct
14 Correct 8 ms 16216 KB Output is correct
15 Correct 8 ms 16216 KB Output is correct
16 Correct 9 ms 16216 KB Output is correct
17 Correct 8 ms 16216 KB Output is correct
18 Correct 9 ms 16216 KB Output is correct
19 Correct 9 ms 16216 KB Output is correct
20 Correct 9 ms 16216 KB Output is correct
21 Correct 8 ms 16216 KB Output is correct
22 Correct 8 ms 16216 KB Output is correct
23 Correct 1284 ms 37960 KB Output is correct
24 Correct 1304 ms 38128 KB Output is correct
25 Execution timed out 2037 ms 31728 KB Time limit exceeded
26 Halted 0 ms 0 KB -