oj.uz

Submission #776385

# Submission time Handle Problem Language Result Execution time Memory
776385 2023-07-07T19:23:12 Z Tenis0206 Sequence (APIO23_sequence) C++17
100 / 100
 1112 ms 69840 KB 
#include <bits/stdc++.h>

using namespace std;

const int nmax = 5e5;

int dif;

int n;
int v[nmax + 5];

vector<int> l[nmax + 5];

int st[nmax + 5], dr[nmax + 5];

int pst[nmax + 5], pdr[nmax + 5];

struct arbore_lazy
{
    pair<int,int> ai[4 * nmax + 5];
    int lazy[4 * nmax + 5];
private:
    pair<int,int> Merge(pair<int,int> a, pair<int,int> b)
    {
        pair<int,int> rez;
        rez.first = min(a.first,b.first);
        rez.second = max(a.second,b.second);
        return rez;
    }
    void propag(int nod)
    {
        if(lazy[nod]==0)
        {
            return;
        }
        lazy[nod*2] += lazy[nod];
        lazy[nod*2+1] += lazy[nod];
        ai[nod*2].first += lazy[nod], ai[nod*2].second += lazy[nod];
        ai[nod*2+1].first += lazy[nod], ai[nod*2+1].second += lazy[nod];
        lazy[nod] = 0;
    }
public:
    void update(int ua, int ub, int val, int nod, int a, int b)
    {
        if(ua<=a && ub>=b)
        {
            ai[nod].first += val;
            ai[nod].second += val;
            lazy[nod] += val;
            return;
        }
        propag(nod);
        int mij = (a + b) >> 1;
        if(ua<=mij)
        {
            update(ua,ub,val,nod*2,a,mij);
        }
        if(ub>mij)
        {
            update(ua,ub,val,nod*2+1,mij+1,b);
        }
        ai[nod] = Merge(ai[nod*2],ai[nod*2+1]);
    }
    pair<int,int> query(int qa, int qb, int nod, int a, int b)
    {
        if(qa<=a && qb>=b)
        {
            return ai[nod];
        }
        propag(nod);
        int mij = (a + b) >> 1;
        if(qa<=mij && qb>mij)
        {
            return Merge(query(qa,qb,nod*2,a,mij),query(qa,qb,nod*2+1,mij+1,b));
        }
        if(qa<=mij)
        {
            return query(qa,qb,nod*2,a,mij);
        }
        return query(qa,qb,nod*2+1,mij+1,b);
    }
};

arbore_lazy asp;

struct arbore_de_intervale
{
    int ai[12 * nmax + 5];
    void update(int poz, int val, int nod, int a, int b, bool as = false)
    {
        if(a==b)
        {
            if(as)
            {
                ai[nod] = val;
            }
            ai[nod] = min(ai[nod],val);
            return;
        }
        int mij = (a + b) >> 1;
        if(poz<=mij)
        {
            update(poz,val,nod*2,a,mij,as);
        }
        else
        {
            update(poz,val,nod*2+1,mij+1,b,as);
        }
        ai[nod] = min(ai[nod*2],ai[nod*2+1]);
    }
    int query(int qa, int qb, int nod, int a, int b)
    {
        if(qa<=a && qb>=b)
        {
            return ai[nod];
        }
        int mij = (a + b) >> 1;
        if(qa<=mij && qb>mij)
        {
            return min(query(qa,qb,nod*2,a,mij),query(qa,qb,nod*2+1,mij+1,b));
        }
        if(qa<=mij)
        {
            return query(qa,qb,nod*2,a,mij);
        }
        return query(qa,qb,nod*2+1,mij+1,b);
    }
};

arbore_de_intervale aicnt;

int sequence(int N, vector<int> A)
{
    n = N;
    dif = 2 * n;
    for(int i=1; i<=n; i++)
    {
        v[i] = A[i - 1];
        l[v[i]].push_back(i);
    }
    for(int i=1; i<=n; i++)
    {
        asp.update(i,n,+1,1,1,n);
    }
    int rez = 0;
    for(int i=1;i<=n+dif;i++)
    {
        aicnt.update(i,nmax,1,1,n+dif,1);
    }
    for(int val=1; val<=n; val++)
    {
        int nr = l[val].size();
        if(!nr)
        {
            continue;
        }
        for(auto it : l[val])
        {
            asp.update(it,n,-1,1,1,n);
        }
        if(l[val].front() != 1)
        {
            pair<int,int> sp = asp.query(1,l[val].front()-1,1,1,n);
            st[0] = sp.first;
            dr[0] = sp.second;
            st[0] = min(st[0], 0);
            dr[0] = max(dr[0], 0);
        }
        else
        {
            st[0] = 0;
            dr[0] = 0;
        }
        for(int i=0; i<nr; i++)
        {
            int u = n;
            if(i + 1 < nr)
            {
                u = l[val][i + 1] - 1;
            }
            pair<int,int> sp = asp.query(l[val][i],u,1,1,n);
            st[i + 1] = sp.first;
            dr[i + 1] = sp.second;
        }
        auto cmpst = [](int a, int b)
        {
            return (a + st[a] < b + st[b]);
        };
        auto cmpdr = [](int a, int b)
        {
            return (a + dr[a] < b + dr[b]);
        };
        for(int i=0;i<=nr;i++)
        {
            pst[i] = i, pdr[i] = i;
        }
        sort(pst,pst+nr+1,cmpst);
        sort(pdr,pdr+nr+1,cmpdr);
        int poz = 0;
        for(int p=0;p<=nr;p++)
        {
            int j = pdr[p];
            while(poz <= nr && pst[poz] + st[pst[poz]] <= dr[j] + j)
            {
                int i = pst[poz];
                aicnt.update(dr[i]-i+dif,i,1,1,n+dif);
                ++poz;
            }
            rez = max(rez, j - aicnt.query(st[j]-j+dif,n+dif,1,1,n+dif));
        }
        for(int i=0;i<=nr;i++)
        {
            aicnt.update(dr[i]-i+dif,nmax,1,1,n+dif,1);
        }
        for(auto it : l[val])
        {
            asp.update(it,n,-1,1,1,n);
        }
    }
    return rez;
}

#ifdef home

int main()
{
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    int nn;
    cin>>nn;
    vector<int> vv(nn);
    for(int i=1; i<=nn; i++)
    {
        cin>>vv[i - 1];
    }
    cout<<sequence(nn,vv)<<'\n';
    return 0;
}

#endif // home

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27732 KB Output is correct
2 Correct 11 ms 27680 KB Output is correct
3 Correct 11 ms 27644 KB Output is correct
4 Correct 11 ms 27732 KB Output is correct
5 Correct 11 ms 27732 KB Output is correct
6 Correct 11 ms 27732 KB Output is correct
7 Correct 11 ms 27760 KB Output is correct
8 Correct 11 ms 27676 KB Output is correct
9 Correct 11 ms 27732 KB Output is correct
10 Correct 10 ms 27720 KB Output is correct
11 Correct 10 ms 27732 KB Output is correct
12 Correct 11 ms 27732 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27732 KB Output is correct
2 Correct 11 ms 27680 KB Output is correct
3 Correct 11 ms 27644 KB Output is correct
4 Correct 11 ms 27732 KB Output is correct
5 Correct 11 ms 27732 KB Output is correct
6 Correct 11 ms 27732 KB Output is correct
7 Correct 11 ms 27760 KB Output is correct
8 Correct 11 ms 27676 KB Output is correct
9 Correct 11 ms 27732 KB Output is correct
10 Correct 10 ms 27720 KB Output is correct
11 Correct 10 ms 27732 KB Output is correct
12 Correct 11 ms 27732 KB Output is correct
13 Correct 13 ms 27852 KB Output is correct
14 Correct 13 ms 27860 KB Output is correct
15 Correct 13 ms 27860 KB Output is correct
16 Correct 12 ms 27860 KB Output is correct
17 Correct 12 ms 27860 KB Output is correct
18 Correct 13 ms 27864 KB Output is correct
19 Correct 13 ms 27856 KB Output is correct
20 Correct 13 ms 27860 KB Output is correct
21 Correct 13 ms 27892 KB Output is correct
22 Correct 14 ms 27768 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27732 KB Output is correct
2 Correct 720 ms 64064 KB Output is correct
3 Correct 769 ms 64068 KB Output is correct
4 Correct 583 ms 57696 KB Output is correct
5 Correct 721 ms 63116 KB Output is correct
6 Correct 699 ms 63112 KB Output is correct
7 Correct 597 ms 56824 KB Output is correct
8 Correct 584 ms 56908 KB Output is correct
9 Correct 627 ms 59052 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27680 KB Output is correct
2 Correct 624 ms 60784 KB Output is correct
3 Correct 601 ms 58840 KB Output is correct
4 Correct 590 ms 58932 KB Output is correct
5 Correct 592 ms 60580 KB Output is correct
6 Correct 594 ms 60240 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 937 ms 69708 KB Output is correct
2 Correct 937 ms 69840 KB Output is correct
3 Correct 930 ms 69140 KB Output is correct
4 Correct 927 ms 69204 KB Output is correct
5 Correct 811 ms 65880 KB Output is correct
6 Correct 815 ms 65932 KB Output is correct
7 Correct 738 ms 64588 KB Output is correct
8 Correct 736 ms 64356 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27732 KB Output is correct
2 Correct 11 ms 27680 KB Output is correct
3 Correct 11 ms 27644 KB Output is correct
4 Correct 11 ms 27732 KB Output is correct
5 Correct 11 ms 27732 KB Output is correct
6 Correct 11 ms 27732 KB Output is correct
7 Correct 11 ms 27760 KB Output is correct
8 Correct 11 ms 27676 KB Output is correct
9 Correct 11 ms 27732 KB Output is correct
10 Correct 10 ms 27720 KB Output is correct
11 Correct 10 ms 27732 KB Output is correct
12 Correct 11 ms 27732 KB Output is correct
13 Correct 13 ms 27852 KB Output is correct
14 Correct 13 ms 27860 KB Output is correct
15 Correct 13 ms 27860 KB Output is correct
16 Correct 12 ms 27860 KB Output is correct
17 Correct 12 ms 27860 KB Output is correct
18 Correct 13 ms 27864 KB Output is correct
19 Correct 13 ms 27856 KB Output is correct
20 Correct 13 ms 27860 KB Output is correct
21 Correct 13 ms 27892 KB Output is correct
22 Correct 14 ms 27768 KB Output is correct
23 Correct 145 ms 33228 KB Output is correct
24 Correct 141 ms 33232 KB Output is correct
25 Correct 139 ms 33256 KB Output is correct
26 Correct 112 ms 32368 KB Output is correct
27 Correct 112 ms 32376 KB Output is correct
28 Correct 115 ms 32328 KB Output is correct
29 Correct 97 ms 32300 KB Output is correct
30 Correct 96 ms 32476 KB Output is correct
31 Correct 92 ms 33348 KB Output is correct
32 Correct 116 ms 34272 KB Output is correct
33 Correct 135 ms 33256 KB Output is correct
34 Correct 141 ms 33308 KB Output is correct
35 Correct 134 ms 33292 KB Output is correct
36 Correct 134 ms 33264 KB Output is correct
37 Correct 134 ms 33228 KB Output is correct
38 Correct 149 ms 33288 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27732 KB Output is correct
2 Correct 11 ms 27680 KB Output is correct
3 Correct 11 ms 27644 KB Output is correct
4 Correct 11 ms 27732 KB Output is correct
5 Correct 11 ms 27732 KB Output is correct
6 Correct 11 ms 27732 KB Output is correct
7 Correct 11 ms 27760 KB Output is correct
8 Correct 11 ms 27676 KB Output is correct
9 Correct 11 ms 27732 KB Output is correct
10 Correct 10 ms 27720 KB Output is correct
11 Correct 10 ms 27732 KB Output is correct
12 Correct 11 ms 27732 KB Output is correct
13 Correct 13 ms 27852 KB Output is correct
14 Correct 13 ms 27860 KB Output is correct
15 Correct 13 ms 27860 KB Output is correct
16 Correct 12 ms 27860 KB Output is correct
17 Correct 12 ms 27860 KB Output is correct
18 Correct 13 ms 27864 KB Output is correct
19 Correct 13 ms 27856 KB Output is correct
20 Correct 13 ms 27860 KB Output is correct
21 Correct 13 ms 27892 KB Output is correct
22 Correct 14 ms 27768 KB Output is correct
23 Correct 720 ms 64064 KB Output is correct
24 Correct 769 ms 64068 KB Output is correct
25 Correct 583 ms 57696 KB Output is correct
26 Correct 721 ms 63116 KB Output is correct
27 Correct 699 ms 63112 KB Output is correct
28 Correct 597 ms 56824 KB Output is correct
29 Correct 584 ms 56908 KB Output is correct
30 Correct 627 ms 59052 KB Output is correct
31 Correct 624 ms 60784 KB Output is correct
32 Correct 601 ms 58840 KB Output is correct
33 Correct 590 ms 58932 KB Output is correct
34 Correct 592 ms 60580 KB Output is correct
35 Correct 594 ms 60240 KB Output is correct
36 Correct 937 ms 69708 KB Output is correct
37 Correct 937 ms 69840 KB Output is correct
38 Correct 930 ms 69140 KB Output is correct
39 Correct 927 ms 69204 KB Output is correct
40 Correct 811 ms 65880 KB Output is correct
41 Correct 815 ms 65932 KB Output is correct
42 Correct 738 ms 64588 KB Output is correct
43 Correct 736 ms 64356 KB Output is correct
44 Correct 145 ms 33228 KB Output is correct
45 Correct 141 ms 33232 KB Output is correct
46 Correct 139 ms 33256 KB Output is correct
47 Correct 112 ms 32368 KB Output is correct
48 Correct 112 ms 32376 KB Output is correct
49 Correct 115 ms 32328 KB Output is correct
50 Correct 97 ms 32300 KB Output is correct
51 Correct 96 ms 32476 KB Output is correct
52 Correct 92 ms 33348 KB Output is correct
53 Correct 116 ms 34272 KB Output is correct
54 Correct 135 ms 33256 KB Output is correct
55 Correct 141 ms 33308 KB Output is correct
56 Correct 134 ms 33292 KB Output is correct
57 Correct 134 ms 33264 KB Output is correct
58 Correct 134 ms 33228 KB Output is correct
59 Correct 149 ms 33288 KB Output is correct
60 Correct 1075 ms 64052 KB Output is correct
61 Correct 1074 ms 64040 KB Output is correct
62 Correct 1112 ms 64052 KB Output is correct
63 Correct 769 ms 57292 KB Output is correct
64 Correct 793 ms 57332 KB Output is correct
65 Correct 782 ms 57320 KB Output is correct
66 Correct 603 ms 57932 KB Output is correct
67 Correct 633 ms 57960 KB Output is correct
68 Correct 577 ms 63932 KB Output is correct
69 Correct 753 ms 69840 KB Output is correct
70 Correct 1039 ms 63984 KB Output is correct
71 Correct 1010 ms 63996 KB Output is correct
72 Correct 1004 ms 63724 KB Output is correct
73 Correct 1014 ms 63912 KB Output is correct
74 Correct 982 ms 63820 KB Output is correct
75 Correct 994 ms 63872 KB Output is correct