oj.uz

Submission #919849

# Submission time Handle Problem Language Result Execution time Memory
919849 2024-02-01T18:06:12 Z JakobZorz Sequence (APIO23_sequence) C++17
63 / 100
 2000 ms 43904 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++)
        tree[i]=-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])
            /*for(int i=idx+1;i<=n;i++)
                tree[i]++;*/
            add(idx+1,n+1,1);
        
        vector<int>mn1,mn2,mx1,mx2;
        for(int i:arr[v]){
            mn1.push_back(get_min(0,i+1));
            mn2.push_back(get_min(i,n+1));
            mx1.push_back(get_max(0,i+1));
            mx2.push_back(get_max(i,n+1));
        }
        
        int l=0;
        for(int r=0;r<(int)arr[v].size();r++){
            l=0;
            int min2=mn2[r];
            int max2=mx2[r];
            int min1=mn1[l];
            int max1=mx1[l];
            while(l<r&&(max1-l+1<min2-r||max2+r+1<min1+l)){
                l++;
                min1=mn1[l];
                max1=mx1[l];
            }
            res=max(res,r-l+1);
        }
        
        for(int idx:arr[v])
            /*for(int i=idx+1;i<=n;i++)
                tree[i]++;*/
            add(idx+1,n+1,1);
    }
    
    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15960 KB Output is correct
2 Correct 1291 ms 37968 KB Output is correct
3 Correct 1314 ms 37900 KB Output is correct
4 Execution timed out 2040 ms 31568 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 15964 KB Output is correct
2 Execution timed out 2033 ms 39224 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1395 ms 43856 KB Output is correct
2 Correct 1413 ms 43904 KB Output is correct
3 Correct 1416 ms 43144 KB Output is correct
4 Correct 1396 ms 43484 KB Output is correct
5 Correct 1385 ms 40068 KB Output is correct
6 Correct 1411 ms 40056 KB Output is correct
7 Correct 1322 ms 38496 KB Output is correct
8 Correct 1290 ms 38200 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15960 KB Output is correct
2 Correct 4 ms 15964 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 5 ms 15960 KB Output is correct
5 Correct 6 ms 15960 KB Output is correct
6 Correct 4 ms 15964 KB Output is correct
7 Correct 4 ms 15960 KB Output is correct
8 Correct 5 ms 15960 KB Output is correct
9 Correct 5 ms 15960 KB Output is correct
10 Correct 5 ms 15964 KB Output is correct
11 Correct 6 ms 16120 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct
13 Correct 8 ms 16216 KB Output is correct
14 Correct 9 ms 16216 KB Output is correct
15 Correct 11 ms 16220 KB Output is correct
16 Correct 9 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 9 ms 16220 KB Output is correct
20 Correct 8 ms 16220 KB Output is correct
21 Correct 9 ms 16216 KB Output is correct
22 Correct 9 ms 16216 KB Output is correct
23 Correct 238 ms 19968 KB Output is correct
24 Correct 210 ms 19796 KB Output is correct
25 Correct 241 ms 19844 KB Output is correct
26 Correct 216 ms 19056 KB Output is correct
27 Correct 229 ms 19280 KB Output is correct
28 Correct 218 ms 19024 KB Output is correct
29 Correct 553 ms 19064 KB Output is correct
30 Correct 535 ms 19128 KB Output is correct
31 Correct 189 ms 20936 KB Output is correct
32 Correct 175 ms 20692 KB Output is correct
33 Correct 198 ms 19976 KB Output is correct
34 Correct 239 ms 20564 KB Output is correct
35 Correct 222 ms 20472 KB Output is correct
36 Correct 294 ms 20496 KB Output is correct
37 Correct 237 ms 20324 KB Output is correct
38 Correct 266 ms 20516 KB Output is correct

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15960 KB Output is correct
2 Correct 4 ms 15964 KB Output is correct
3 Correct 4 ms 15960 KB Output is correct
4 Correct 5 ms 15960 KB Output is correct
5 Correct 6 ms 15960 KB Output is correct
6 Correct 4 ms 15964 KB Output is correct
7 Correct 4 ms 15960 KB Output is correct
8 Correct 5 ms 15960 KB Output is correct
9 Correct 5 ms 15960 KB Output is correct
10 Correct 5 ms 15964 KB Output is correct
11 Correct 6 ms 16120 KB Output is correct
12 Correct 4 ms 15960 KB Output is correct
13 Correct 8 ms 16216 KB Output is correct
14 Correct 9 ms 16216 KB Output is correct
15 Correct 11 ms 16220 KB Output is correct
16 Correct 9 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 9 ms 16220 KB Output is correct
20 Correct 8 ms 16220 KB Output is correct
21 Correct 9 ms 16216 KB Output is correct
22 Correct 9 ms 16216 KB Output is correct
23 Correct 1291 ms 37968 KB Output is correct
24 Correct 1314 ms 37900 KB Output is correct
25 Execution timed out 2040 ms 31568 KB Time limit exceeded
26 Halted 0 ms 0 KB -