oj.uz

Submission #870812

# Submission time Handle Problem Language Result Execution time Memory
870812 2023-11-09T07:59:12 Z salmon Sequence (APIO23_sequence) C++17
100 / 100
 772 ms 70792 KB 
#include "sequence.h"

#include <bits/stdc++.h>
using namespace std;
int N;
int miin[500100 * 4];
int maax[500100 * 4];
int lazy[500100 * 4];
int miin1[500100 * 4];
int maax1[500100 * 4];
int lazy1[500100 * 4];
vector<int> in[500100];
vector<int> sat;

void build(int i, int s, int e, int *miin, int *maax, int *lazy){
    miin[i] = - e - 1;
    maax[i] = - s - 1;
    lazy[i] = 0;

    if(s != e){
        int m = (s + e + 2)/2 - 1;

        build(i * 2, s, m, miin, maax, lazy);
        build(i * 2 + 1, m + 1, e, miin, maax, lazy);
    }
}

void update(int i, int s, int e, int S, int *miin, int *maax, int *lazy){
    if(S <= s){
        miin[i] += 2;
        maax[i] += 2;
        lazy[i] += 2;
        return;
    }

    int m = (s + e + 2)/2 - 1;

    update(i * 2 + 1, m + 1, e, S, miin, maax, lazy);
    if(S <= m){
        update(i * 2, s, m, S, miin, maax, lazy);
    }

    miin[i] = min(miin[i * 2], miin[i * 2 + 1]) + lazy[i];
    maax[i] = max(maax[i * 2], maax[i * 2 + 1]) + lazy[i];
}

pair<int,int> query(int i, int s, int e, int S, int E, int *miin, int *maax, int *lazy){
    if(S <= s && e <= E){
        return make_pair(miin[i],maax[i]);
    }

    int m = (s + e + 2)/2 - 1;

    pair<int,int> ii,ii1;

    if(S <= m && m < E){
        ii = query(i * 2, s, m, S, E, miin, maax, lazy);
        ii1 = query(i * 2 + 1, m + 1, e, S, E, miin, maax, lazy);

        ii.first = min(ii.first, ii1.first) + lazy[i];
        ii.second = max(ii.second, ii1.second) + lazy[i];
    }
    else if(S <= m){
        ii = query(i * 2, s, m, S, E, miin, maax, lazy);

        ii.first = ii.first + lazy[i];
        ii.second = ii.second + lazy[i];
    }
    else{
        ii = query(i * 2 + 1, m + 1, e, S, E, miin, maax, lazy);

        ii.first = ii.first + lazy[i];
        ii.second = ii.second + lazy[i];
    }

    return ii;
}

int sequence(int N, std::vector<int> lst) {
    for(int i = 0; i < N; i++){
        in[lst[i]].push_back(i);
    }

    build(1,-1,N-1,miin1,maax1,lazy1);
    build(1,-1,N-1,miin,maax,lazy);

    bool flag = false;

    int ans = 0;

    for(int i = 1; i <= N; i++){
        sat.clear();

        sat.push_back(-1);
        for(int j = 0; j < in[i].size(); j++){
            sat.push_back(in[i][j]);
        }
        sat.push_back(N);

        for(int j = 0; j < in[i].size() ; j++){
            update(1,-1,N-1,in[i][j],miin,maax,lazy);
        }

        for(int j = 1; j <= in[i].size(); j++){

            int small = query(1, -1, N - 1, -1, sat[j] - 1, miin, maax, lazy).first;
            int big1 = query(1, -1, N - 1, -1, sat[j] - 1, miin1, maax1, lazy1).second;

            int l,r,m,s,e;
            int eye;

            eye = 1;
            l = sat[j];
            r = N - 1;

            s = -1;
            e = N - 1;

            int lacy = 0;
            int lacy1 = 0;

            while(s != e){
                m = (s + e)/2;

                lacy += lazy[eye];
                lacy1 += lazy1[eye];

                if(m < l){
                    s = m + 1;
                    eye = eye * 2 + 1;
                    continue;
                }

                if((maax[eye * 2 + 1] + lacy - small) * (long long int)(miin1[eye * 2 + 1] + lacy1 - big1) <= 0){
                    s = m + 1;
                    eye = eye * 2 + 1;
                    continue;
                }
                else{
                    e = m;
                    eye = eye * 2;
                }
            }

            auto it = upper_bound(sat.begin(),sat.end(),s);
            it--;

            ans = max(ans,(int)(it - sat.begin()) - j + 1);
       }

        for(int j = 0; j < in[i].size() ; j++){
            update(1,-1,N-1,in[i][j],miin1,maax1,lazy1);
        }
    }

    return ans;

}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:95:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for(int j = 0; j < in[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~
sequence.cpp:100:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |         for(int j = 0; j < in[i].size() ; j++){
      |                        ~~^~~~~~~~~~~~~~
sequence.cpp:104:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         for(int j = 1; j <= in[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~
sequence.cpp:109:19: warning: variable 'r' set but not used [-Wunused-but-set-variable]
  109 |             int l,r,m,s,e;
      |                   ^
sequence.cpp:151:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |         for(int j = 0; j < in[i].size() ; j++){
      |                        ~~^~~~~~~~~~~~~~
sequence.cpp:87:10: warning: unused variable 'flag' [-Wunused-variable]
   87 |     bool flag = false;
      |          ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23128 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23184 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 5 ms 23132 KB Output is correct
14 Correct 6 ms 23244 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 5 ms 23132 KB Output is correct
20 Correct 5 ms 23132 KB Output is correct
21 Correct 5 ms 23128 KB Output is correct
22 Correct 5 ms 23128 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 406 ms 61524 KB Output is correct
3 Correct 431 ms 61644 KB Output is correct
4 Correct 346 ms 54236 KB Output is correct
5 Correct 403 ms 60700 KB Output is correct
6 Correct 400 ms 60704 KB Output is correct
7 Correct 342 ms 54100 KB Output is correct
8 Correct 341 ms 54312 KB Output is correct
9 Correct 400 ms 55104 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23132 KB Output is correct
2 Correct 372 ms 56844 KB Output is correct
3 Correct 377 ms 55228 KB Output is correct
4 Correct 379 ms 55224 KB Output is correct
5 Correct 395 ms 56836 KB Output is correct
6 Correct 379 ms 55176 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 535 ms 67376 KB Output is correct
2 Correct 536 ms 70792 KB Output is correct
3 Correct 573 ms 70080 KB Output is correct
4 Correct 519 ms 69972 KB Output is correct
5 Correct 448 ms 66664 KB Output is correct
6 Correct 481 ms 66720 KB Output is correct
7 Correct 423 ms 65364 KB Output is correct
8 Correct 396 ms 65184 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23128 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23184 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 5 ms 23132 KB Output is correct
14 Correct 6 ms 23244 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 5 ms 23132 KB Output is correct
20 Correct 5 ms 23132 KB Output is correct
21 Correct 5 ms 23128 KB Output is correct
22 Correct 5 ms 23128 KB Output is correct
23 Correct 89 ms 31316 KB Output is correct
24 Correct 82 ms 31320 KB Output is correct
25 Correct 77 ms 31324 KB Output is correct
26 Correct 71 ms 30640 KB Output is correct
27 Correct 73 ms 30632 KB Output is correct
28 Correct 69 ms 30552 KB Output is correct
29 Correct 60 ms 30300 KB Output is correct
30 Correct 58 ms 30296 KB Output is correct
31 Correct 57 ms 30932 KB Output is correct
32 Correct 59 ms 32468 KB Output is correct
33 Correct 76 ms 31472 KB Output is correct
34 Correct 79 ms 31380 KB Output is correct
35 Correct 81 ms 31320 KB Output is correct
36 Correct 76 ms 31336 KB Output is correct
37 Correct 74 ms 31456 KB Output is correct
38 Correct 79 ms 31480 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23128 KB Output is correct
2 Correct 4 ms 23132 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23128 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23184 KB Output is correct
11 Correct 4 ms 23132 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 5 ms 23132 KB Output is correct
14 Correct 6 ms 23244 KB Output is correct
15 Correct 5 ms 23132 KB Output is correct
16 Correct 5 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 5 ms 23132 KB Output is correct
20 Correct 5 ms 23132 KB Output is correct
21 Correct 5 ms 23128 KB Output is correct
22 Correct 5 ms 23128 KB Output is correct
23 Correct 406 ms 61524 KB Output is correct
24 Correct 431 ms 61644 KB Output is correct
25 Correct 346 ms 54236 KB Output is correct
26 Correct 403 ms 60700 KB Output is correct
27 Correct 400 ms 60704 KB Output is correct
28 Correct 342 ms 54100 KB Output is correct
29 Correct 341 ms 54312 KB Output is correct
30 Correct 400 ms 55104 KB Output is correct
31 Correct 372 ms 56844 KB Output is correct
32 Correct 377 ms 55228 KB Output is correct
33 Correct 379 ms 55224 KB Output is correct
34 Correct 395 ms 56836 KB Output is correct
35 Correct 379 ms 55176 KB Output is correct
36 Correct 535 ms 67376 KB Output is correct
37 Correct 536 ms 70792 KB Output is correct
38 Correct 573 ms 70080 KB Output is correct
39 Correct 519 ms 69972 KB Output is correct
40 Correct 448 ms 66664 KB Output is correct
41 Correct 481 ms 66720 KB Output is correct
42 Correct 423 ms 65364 KB Output is correct
43 Correct 396 ms 65184 KB Output is correct
44 Correct 89 ms 31316 KB Output is correct
45 Correct 82 ms 31320 KB Output is correct
46 Correct 77 ms 31324 KB Output is correct
47 Correct 71 ms 30640 KB Output is correct
48 Correct 73 ms 30632 KB Output is correct
49 Correct 69 ms 30552 KB Output is correct
50 Correct 60 ms 30300 KB Output is correct
51 Correct 58 ms 30296 KB Output is correct
52 Correct 57 ms 30932 KB Output is correct
53 Correct 59 ms 32468 KB Output is correct
54 Correct 76 ms 31472 KB Output is correct
55 Correct 79 ms 31380 KB Output is correct
56 Correct 81 ms 31320 KB Output is correct
57 Correct 76 ms 31336 KB Output is correct
58 Correct 74 ms 31456 KB Output is correct
59 Correct 79 ms 31480 KB Output is correct
60 Correct 737 ms 64964 KB Output is correct
61 Correct 728 ms 65176 KB Output is correct
62 Correct 772 ms 64972 KB Output is correct
63 Correct 601 ms 56808 KB Output is correct
64 Correct 601 ms 56804 KB Output is correct
65 Correct 607 ms 56916 KB Output is correct
66 Correct 393 ms 55340 KB Output is correct
67 Correct 387 ms 55396 KB Output is correct
68 Correct 370 ms 60164 KB Output is correct
69 Correct 383 ms 70480 KB Output is correct
70 Correct 717 ms 64340 KB Output is correct
71 Correct 684 ms 64456 KB Output is correct
72 Correct 662 ms 64152 KB Output is correct
73 Correct 665 ms 64492 KB Output is correct
74 Correct 658 ms 63944 KB Output is correct
75 Correct 732 ms 64456 KB Output is correct