oj.uz

Submission #969159

# Submission time Handle Problem Language Result Execution time Memory
969159 2024-04-24T15:48:36 Z Tuanlinh123 Sequence (APIO23_sequence) C++17
20 / 100
 239 ms 52676 KB 
#include "sequence.h"
#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;
 
const ll maxn=500005, inf=1e9;
vector <ll> p[maxn];
ll a[maxn], minp[maxn], maxp[maxn], mins[maxn], maxs[maxn];
 
namespace SegTree
{
    ll n, Max[maxn*4], Min[maxn*4], lz[maxn*4];
 
    void build(ll i, ll Start, ll End)
    {
        if (Start==End) {Min[i]=Max[i]=Start; return;}
        ll mid=(Start+End)/2;
        build(i*2, Start, mid), build(i*2+1, mid+1, End);
        Min[i]=min(Min[i*2], Min[i*2+1]);
        Max[i]=max(Max[i*2], Max[i*2+1]);
    }
    void init(ll sz){n=sz, build(1, 0, n);}
 
    void Move(ll i)
    {
        ll t=lz[i]; lz[i]=0;
        Min[i*2]+=t, Max[i*2]+=t, lz[i*2]+=t;
        Min[i*2+1]+=t, Max[i*2+1]+=t, lz[i*2+1]+=t;
    }
 
    void update(ll i, ll Start, ll End, ll l, ll r, ll x)
    {
        if (Start>r || End<l) return;
        if (Start>=l && End<=r) {Max[i]+=x, Min[i]+=x, lz[i]+=x; return;}
        ll mid=(Start+End)/2; if (lz[i]) Move(i);
        if (mid>=l) update(i*2, Start, mid, l, r, x);
        if (mid+1<=r) update(i*2+1, mid+1, End, l, r, x);
        Min[i]=min(Min[i*2], Min[i*2+1]);
        Max[i]=max(Max[i*2], Max[i*2+1]);
    }
    void update(ll l, ll r, ll x) {update(1, 0, n, l, r, x);}
 
    pll query(ll i, ll Start, ll End, ll l, ll r)
    {
        if (Start>r || End<l) return {1e9, 0};
        if (Start>=l && End<=r) return {Min[i], Max[i]};
        ll mid=(Start+End)/2; if (lz[i]) Move(i);
        if (mid<l) return query(i*2+1, mid+1, End, l, r);
        if (mid+1>r) return query(i*2, Start, mid, l, r);
        pll q1=query(i*2, Start, mid, l, r), q2=query(i*2+1, mid+1, End, l, r);
        return {min(q1.fi, q2.fi), max(q1.se, q2.se)};
    }
    pll query(ll l, ll r){return query(1, 0, n, l, r);}
}
 
int sequence(int n, vector <int> A)
{
    ll ans=0;
	SegTree::init(n);
    for (ll i=1; i<=n; i++) a[i]=A[i-1], p[a[i]].pb(i);
    for (ll i=1; i<=n; i++)
    {
        for (ll z=0; z<sz(p[i]); z++)
        {
            ll j=p[i][z];
            while (z+ans<sz(p[i]))
            {
                ll r=p[i][z+ans], l1, r1, l2, r2;
                tie(l1, r1)=SegTree::query(0, j-1);
                tie(l2, r2)=SegTree::query(r, n);
                if (max(l1, l2-2*(ans+1))-min(r1, r2)<=0) ans++;
                else break;
            }
            SegTree::update(j, n, -2);
        }
    }
    return ans;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20572 KB Output is correct
2 Correct 5 ms 20572 KB Output is correct
3 Correct 5 ms 20416 KB Output is correct
4 Correct 5 ms 20568 KB Output is correct
5 Correct 4 ms 20660 KB Output is correct
6 Incorrect 5 ms 20668 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20572 KB Output is correct
2 Correct 5 ms 20572 KB Output is correct
3 Correct 5 ms 20416 KB Output is correct
4 Correct 5 ms 20568 KB Output is correct
5 Correct 4 ms 20660 KB Output is correct
6 Incorrect 5 ms 20668 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20572 KB Output is correct
2 Correct 151 ms 50084 KB Output is correct
3 Correct 167 ms 49960 KB Output is correct
4 Correct 152 ms 39984 KB Output is correct
5 Correct 147 ms 48996 KB Output is correct
6 Correct 145 ms 49020 KB Output is correct
7 Correct 120 ms 40672 KB Output is correct
8 Correct 138 ms 41040 KB Output is correct
9 Correct 152 ms 40108 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20572 KB Output is correct
2 Incorrect 170 ms 39188 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 52676 KB Output is correct
2 Correct 230 ms 52468 KB Output is correct
3 Correct 239 ms 52048 KB Output is correct
4 Correct 228 ms 52048 KB Output is correct
5 Correct 232 ms 48560 KB Output is correct
6 Correct 215 ms 48960 KB Output is correct
7 Correct 176 ms 47352 KB Output is correct
8 Correct 162 ms 47172 KB Output is correct

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20572 KB Output is correct
2 Correct 5 ms 20572 KB Output is correct
3 Correct 5 ms 20416 KB Output is correct
4 Correct 5 ms 20568 KB Output is correct
5 Correct 4 ms 20660 KB Output is correct
6 Incorrect 5 ms 20668 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 20572 KB Output is correct
2 Correct 5 ms 20572 KB Output is correct
3 Correct 5 ms 20416 KB Output is correct
4 Correct 5 ms 20568 KB Output is correct
5 Correct 4 ms 20660 KB Output is correct
6 Incorrect 5 ms 20668 KB Output isn't correct
7 Halted 0 ms 0 KB -