oj.uz

Submission #749197

# Submission time Handle Problem Language Result Execution time Memory
749197 2023-05-27T14:02:42 Z beepbeepsheep Sequence (APIO23_sequence) C++17
100 / 100
 1448 ms 125516 KB 
#include "sequence.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>

const ll maxn=5e5+5;
ll pref[maxn][2];
ll suff[maxn][2];
vector<int> adj[maxn];
struct node{
    ll s,e,m,mn,mx,flag;
    node *l,*r;
    node(ll _s, ll _e){
        s=_s,e=_e,m=(s+e)>>1,mn=0,mx=0,flag=0;
        if (s!=e){
            l=new node(s,m);
            r=new node(m+1,e);
        }
    }
    void prop(){
        if (!flag) return;
        mn+=flag;
        mx+=flag;
        if (s==e){
            flag=0;
            return;
        }
        l->flag+=flag;
        r->flag+=flag;
        flag=0;
        return;
    }
    void upd(ll x, ll y, ll v){
        if (x<=s && e<=y){
            flag+=v;
            return;
        }
        if (x>m) r->upd(x,y,v);
        else if (y<=m) l->upd(x,y,v);
        else l->upd(x,y,v),r->upd(x,y,v);
        l->prop(),r->prop();
        mn=min(l->mn,r->mn);
        mx=max(l->mx,r->mx);
    }
    ll queryMin(ll x, ll y){
        prop();
        if (x<=s && e<=y) return mn;
        if (x>m) return r->queryMin(x,y);
        if (y<=m) return l->queryMin(x,y);
        return min(l->queryMin(x,y),r->queryMin(x,y));
    }
    ll queryMax(ll x, ll y){
        prop();
        if (x<=s && e<=y) return mx;
        if (x>m) return r->queryMax(x,y);
        if (y<=m) return l->queryMax(x,y);
        return max(l->queryMax(x,y),r->queryMax(x,y));
    }
}*root;
ll n;
bool check(ll m){
    for (int i=1;i<=n;i++){
        for (int j=0;j+m<=adj[i].size();j++){
            ll A=pref[adj[i][j]][0];
            ll B=pref[adj[i][j]][1];
            ll C=suff[adj[i][j+m-1]][0];
            ll D=suff[adj[i][j+m-1]][1];
            if (max(A,C)-m<= min(B,D)) return true;
        }
    }
    return false;
}
int sequence(int N, std::vector<int> A) {
    n=N;
    for (int i=0;i<N;i++){
        adj[A[i]].emplace_back(i+1);
    }
    root=new node(0,N);
    for (int i=1;i<=N;i++){
        root->upd(i,N,1);
    }
    for (int i=1;i<=N;i++){
        for (auto u:adj[i]){
            root->upd(u,N,-1);
        }
        for (int j=0;j<adj[i].size();j++){
            ll u=adj[i][j];
            pref[u][0]=root->queryMin(0,u-1);
            pref[u][1]=root->queryMax(0,u-1);
            if (j!=0){
                pref[u][0]=min(pref[u][0],pref[adj[i][j-1]][0]-1);
                pref[u][1]=max(pref[u][1],pref[adj[i][j-1]][1]+1);
            }

        }
        for (int j=adj[i].size()-1;j>=0;j--){
            ll u=adj[i][j];
            suff[u][0]=root->queryMin(u,N);
            suff[u][1]=root->queryMax(u,N);
            if (j!=adj[i].size()-1){
                suff[u][0]=min(suff[u][0],suff[adj[i][j+1]][0]-1);
                suff[u][1]=max(suff[u][1],suff[adj[i][j+1]][1]+1);
            }
        }
        for (auto u:adj[i]){
            root->upd(u,N,-1);
        }
    }
    ll l=1,r=N+1,m;
    while (l!=r-1){
        m=(l+r)>>1;
        if (check(m)) l=m;
        else r=m;
    }
    return l;
}

Compilation message

sequence.cpp: In function 'bool check(long long int)':
sequence.cpp:66:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for (int j=0;j+m<=adj[i].size();j++){
      |                      ~~~^~~~~~~~~~~~~~~
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:89:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for (int j=0;j<adj[i].size();j++){
      |                      ~^~~~~~~~~~~~~~
sequence.cpp:103:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |             if (j!=adj[i].size()-1){
      |                 ~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12032 KB Output is correct
5 Correct 6 ms 12080 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12080 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12480 KB Output is correct
14 Correct 9 ms 12484 KB Output is correct
15 Correct 9 ms 12456 KB Output is correct
16 Correct 9 ms 12372 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 12 ms 12448 KB Output is correct
20 Correct 9 ms 12372 KB Output is correct
21 Correct 9 ms 12372 KB Output is correct
22 Correct 9 ms 12372 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 709 ms 119900 KB Output is correct
3 Correct 732 ms 119876 KB Output is correct
4 Correct 613 ms 111844 KB Output is correct
5 Correct 703 ms 118952 KB Output is correct
6 Correct 701 ms 118832 KB Output is correct
7 Correct 648 ms 112248 KB Output is correct
8 Correct 615 ms 112328 KB Output is correct
9 Correct 619 ms 111832 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 720 ms 111828 KB Output is correct
3 Correct 731 ms 111972 KB Output is correct
4 Correct 708 ms 111864 KB Output is correct
5 Correct 727 ms 111876 KB Output is correct
6 Correct 681 ms 111880 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1176 ms 125500 KB Output is correct
2 Correct 1122 ms 125516 KB Output is correct
3 Correct 1189 ms 125064 KB Output is correct
4 Correct 1157 ms 125012 KB Output is correct
5 Correct 917 ms 121656 KB Output is correct
6 Correct 941 ms 121536 KB Output is correct
7 Correct 711 ms 120508 KB Output is correct
8 Correct 697 ms 120068 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12032 KB Output is correct
5 Correct 6 ms 12080 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12080 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12480 KB Output is correct
14 Correct 9 ms 12484 KB Output is correct
15 Correct 9 ms 12456 KB Output is correct
16 Correct 9 ms 12372 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 12 ms 12448 KB Output is correct
20 Correct 9 ms 12372 KB Output is correct
21 Correct 9 ms 12372 KB Output is correct
22 Correct 9 ms 12372 KB Output is correct
23 Correct 174 ms 29296 KB Output is correct
24 Correct 176 ms 29296 KB Output is correct
25 Correct 177 ms 29304 KB Output is correct
26 Correct 159 ms 28284 KB Output is correct
27 Correct 172 ms 28300 KB Output is correct
28 Correct 168 ms 28276 KB Output is correct
29 Correct 124 ms 27972 KB Output is correct
30 Correct 119 ms 27976 KB Output is correct
31 Correct 95 ms 27944 KB Output is correct
32 Correct 101 ms 30180 KB Output is correct
33 Correct 167 ms 28988 KB Output is correct
34 Correct 171 ms 29136 KB Output is correct
35 Correct 162 ms 29004 KB Output is correct
36 Correct 174 ms 29068 KB Output is correct
37 Correct 164 ms 29096 KB Output is correct
38 Correct 167 ms 29124 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12032 KB Output is correct
5 Correct 6 ms 12080 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 6 ms 12080 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 11988 KB Output is correct
13 Correct 8 ms 12480 KB Output is correct
14 Correct 9 ms 12484 KB Output is correct
15 Correct 9 ms 12456 KB Output is correct
16 Correct 9 ms 12372 KB Output is correct
17 Correct 8 ms 12372 KB Output is correct
18 Correct 8 ms 12500 KB Output is correct
19 Correct 12 ms 12448 KB Output is correct
20 Correct 9 ms 12372 KB Output is correct
21 Correct 9 ms 12372 KB Output is correct
22 Correct 9 ms 12372 KB Output is correct
23 Correct 709 ms 119900 KB Output is correct
24 Correct 732 ms 119876 KB Output is correct
25 Correct 613 ms 111844 KB Output is correct
26 Correct 703 ms 118952 KB Output is correct
27 Correct 701 ms 118832 KB Output is correct
28 Correct 648 ms 112248 KB Output is correct
29 Correct 615 ms 112328 KB Output is correct
30 Correct 619 ms 111832 KB Output is correct
31 Correct 720 ms 111828 KB Output is correct
32 Correct 731 ms 111972 KB Output is correct
33 Correct 708 ms 111864 KB Output is correct
34 Correct 727 ms 111876 KB Output is correct
35 Correct 681 ms 111880 KB Output is correct
36 Correct 1176 ms 125500 KB Output is correct
37 Correct 1122 ms 125516 KB Output is correct
38 Correct 1189 ms 125064 KB Output is correct
39 Correct 1157 ms 125012 KB Output is correct
40 Correct 917 ms 121656 KB Output is correct
41 Correct 941 ms 121536 KB Output is correct
42 Correct 711 ms 120508 KB Output is correct
43 Correct 697 ms 120068 KB Output is correct
44 Correct 174 ms 29296 KB Output is correct
45 Correct 176 ms 29296 KB Output is correct
46 Correct 177 ms 29304 KB Output is correct
47 Correct 159 ms 28284 KB Output is correct
48 Correct 172 ms 28300 KB Output is correct
49 Correct 168 ms 28276 KB Output is correct
50 Correct 124 ms 27972 KB Output is correct
51 Correct 119 ms 27976 KB Output is correct
52 Correct 95 ms 27944 KB Output is correct
53 Correct 101 ms 30180 KB Output is correct
54 Correct 167 ms 28988 KB Output is correct
55 Correct 171 ms 29136 KB Output is correct
56 Correct 162 ms 29004 KB Output is correct
57 Correct 174 ms 29068 KB Output is correct
58 Correct 164 ms 29096 KB Output is correct
59 Correct 167 ms 29124 KB Output is correct
60 Correct 1430 ms 119808 KB Output is correct
61 Correct 1420 ms 120000 KB Output is correct
62 Correct 1448 ms 119912 KB Output is correct
63 Correct 1411 ms 112768 KB Output is correct
64 Correct 1377 ms 112860 KB Output is correct
65 Correct 1383 ms 112756 KB Output is correct
66 Correct 810 ms 111852 KB Output is correct
67 Correct 825 ms 111864 KB Output is correct
68 Correct 638 ms 111820 KB Output is correct
69 Correct 644 ms 125496 KB Output is correct
70 Correct 1396 ms 118860 KB Output is correct
71 Correct 1369 ms 118816 KB Output is correct
72 Correct 1353 ms 118248 KB Output is correct
73 Correct 1360 ms 118680 KB Output is correct
74 Correct 1351 ms 118180 KB Output is correct
75 Correct 1417 ms 118596 KB Output is correct