oj.uz

Submission #931692

# Submission time Handle Problem Language Result Execution time Memory
931692 2024-02-22T09:27:25 Z irmuun Sequence (APIO23_sequence) C++17
0 / 100
 469 ms 50772 KB 
#include<bits/stdc++.h>
#include "sequence.h"
 
using namespace std;
 
#define ll int
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

const int INF=1e9;

struct lazySegtree{
    ll n;
    vector<ll>t,lazy;
    lazySegtree(ll n) : n(n) {
        t.resize(4*n,0);
        lazy.resize(4*n,0);
        build(1,0,n);
    }
    void push(ll node){
        t[node*2]+=lazy[node];
        lazy[node*2]+=lazy[node];
        t[node*2+1]+=lazy[node];
        lazy[node*2+1]+=lazy[node];
        lazy[node]=0;
    }
    void build(ll node,ll l,ll r){
        if(l==r){
            t[node]=0;
            return;
        }
        ll mid=(l+r)/2;
        build(node*2,l,mid);
        build(node*2+1,mid+1,r);
    }
    void update(ll node,ll l,ll r,ll L,ll R,ll val){
        if(L>R) return;
        if(L==l&&R==r){
            t[node]+=val;
            lazy[node]+=val;
        }
        else{
            push(node);
            ll mid=(l+r)/2;
            update(node*2,l,mid,L,min(R,mid),val);
            update(node*2+1,mid+1,r,max(L,mid+1),R,val);
            t[node]=max(t[node*2],t[node*2+1]);
        }
    }
    ll query(ll node,ll l,ll r,ll L,ll R){
        if(L>R) return -INF;
        if(L==l&&R==r) return t[node];
        push(node);
        ll mid=(l+r)/2;
        return max(query(node*2,l,mid,L,min(R,mid)),query(node*2+1,mid+1,r,max(L,mid+1),R));
    }
};
 
int sequence(int N,vector<int>A){//sub5
    vector<int>pos[N+5];
    for(int i=0;i<N;i++){
        pos[A[i]].pb(i+1);
    }
    lazySegtree sg(N);
    for(int i=1;i<=N;i++){
        sg.update(1,0,N,i,N,1);
    }
    int ans=1;
    for(int i=1;i<=N;i++){
        for(int j:pos[i]){
            sg.update(1,0,N,j,N,-1);
        }
        for(int j:pos[i]){
            sg.update(1,0,N,j,N,-1);
        }
        if(pos[i].size()==2){
            int l=pos[i][0],r=pos[i][1];
            int mn=sg.query(1,0,N,0,l-1),mx=sg.query(1,0,N,r,N);
            if(mx<-2||mn>2){
                ans=max(ans,1);
            }
            else{
                ans=max(ans,2);
            }
        }
    }
    return ans;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 405 ms 44992 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 50756 KB Output is correct
2 Correct 465 ms 50772 KB Output is correct
3 Correct 464 ms 50112 KB Output is correct
4 Correct 468 ms 50112 KB Output is correct
5 Correct 437 ms 46696 KB Output is correct
6 Incorrect 446 ms 46524 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -