oj.uz

Submission #958117

# Submission time Handle Problem Language Result Execution time Memory
958117 2024-04-05T00:38:48 Z zeta7532 Sequence (APIO23_sequence) C++17
40 / 100
 2000 ms 57168 KB 
#include "sequence.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = int;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)
 
pair<int,int> f(pair<int,int> a,pair<int,int> b){
    return {min(a.fi,b.fi),max(a.se,b.se)};
}
 
template<typename T>
struct RMQ{
    const T INF={1LL<<30,-1LL<<30};
    ll N;
    vector<T> dat;
    RMQ(ll N_):N(),dat(N_*4,INF){
        ll x=1;
        while(N_>x) x*=2;
        N=x;
    }
    void update(ll i,int x){
        i+=N-1;
        dat[i]={x,x};
        while(i>0){
            i=(i-1)/2;
            dat[i]=f(dat[i*2+1],dat[i*2+2]);
        }
    }
    T query(ll a,ll b){return query_sub(a,b,0,0,N);}
    T query_sub(ll a,ll b,ll k,ll l,ll r){
        if(r<=a||b<=l){
            return INF;
        }else if(a<=l&&r<=b){
            return dat[k];
        }else{
            T vl=query_sub(a,b,k*2+1,l,(l+r)/2);
            T vr=query_sub(a,b,k*2+2,(l+r)/2,r);
            return f(vl,vr);
        }
    }
};
 
int f(int N,vector<int> A){
    vector<int> B=A;
    sort(all(B));
    B.erase(unique(all(B)),B.end());
    vector<int> C(N,1);
    vector<vector<int>> G(N+1);
    rep(i,N) G[A[i]].push_back(i);
    int ans=0;
    rep(i,(int)B.size()){
        RMQ<pair<int,int>> seg(N+1);
        vector<int> cum(N+1,0);
        rep(j,N) cum[j+1]=cum[j]+C[j];
        rep(j,N+1) seg.update(j,cum[j]);
        int l=0,r=0;
        while(1){
            if(r+1==(int)G[B[i]].size()) break;
            auto e1=seg.query(0,G[B[i]][l]+1);
            auto e2=seg.query(G[B[i]][r+1]+1,N+1);
            if(e1.fi<=e2.se&&e2.fi<=e1.se){
                r++;
            }else{
                l++;
            }    
            if(r<l) r++;
            ans=max(ans,r-l+1);
        }
        for(int j:G[B[i]]){
            C[j]=-1;
        }
    }
    return ans;
}
 
int sequence(int N, std::vector<int> A) {
    int ans=0;
    vector<int> B=A;
    sort(all(B));
    rep(j,2){
        int cnt=0;
        rep(i,N) if(A[i]==B[(N-1+j)/2]) cnt++;
        ans=max(ans,cnt);
    }
    ans=max(ans,f(N,A));
    rep(i,N) A[i]=N+1-A[i];
    ans=max(ans,f(N,A));
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 111 ms 612 KB Output is correct
14 Correct 114 ms 612 KB Output is correct
15 Correct 5 ms 600 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 173 ms 604 KB Output is correct
19 Correct 93 ms 600 KB Output is correct
20 Correct 90 ms 604 KB Output is correct
21 Correct 90 ms 604 KB Output is correct
22 Correct 89 ms 604 KB Output is correct

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Execution timed out 2065 ms 51432 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 507 ms 44396 KB Output is correct
3 Correct 505 ms 44676 KB Output is correct
4 Correct 534 ms 44896 KB Output is correct
5 Correct 527 ms 44396 KB Output is correct
6 Correct 450 ms 44852 KB Output is correct

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2073 ms 57168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 111 ms 612 KB Output is correct
14 Correct 114 ms 612 KB Output is correct
15 Correct 5 ms 600 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 173 ms 604 KB Output is correct
19 Correct 93 ms 600 KB Output is correct
20 Correct 90 ms 604 KB Output is correct
21 Correct 90 ms 604 KB Output is correct
22 Correct 89 ms 604 KB Output is correct
23 Execution timed out 2017 ms 8784 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 111 ms 612 KB Output is correct
14 Correct 114 ms 612 KB Output is correct
15 Correct 5 ms 600 KB Output is correct
16 Correct 5 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 173 ms 604 KB Output is correct
19 Correct 93 ms 600 KB Output is correct
20 Correct 90 ms 604 KB Output is correct
21 Correct 90 ms 604 KB Output is correct
22 Correct 89 ms 604 KB Output is correct
23 Execution timed out 2065 ms 51432 KB Time limit exceeded
24 Halted 0 ms 0 KB -