oj.uz

Submission #899038

# Submission time Handle Problem Language Result Execution time Memory
899038 2024-01-05T11:38:14 Z efedmrlr Sequence (APIO23_sequence) C++17
100 / 100
 984 ms 83992 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

#include "sequence.h"
using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)



void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int N,m,q;

struct Node {
    int mn, mx, tag;
    Node() : mn(INF), mx(-INF), tag(0) {};
    Node(int v) : mn(v), mx(v), tag(0) {};
    Node merge(Node &oth) {
        Node ret;
        ret.mx = max(oth.mx, mx);
        ret.mn = min(oth.mn, mn);
        return ret;
    }
    void add(int x) {   
        mn += x;
        mx += x;
        tag += x;
    }
};

struct SegTree {
    vector<Node> data;
    int sz;
    SegTree() : sz(0) {}
    void reset(int s) {
        sz = s;
        data.assign(4*(sz + 3), Node());
    }
    void push(int v) {
        data[v<<1].add(data[v].tag);
        data[v<<1^1].add(data[v].tag);
        data[v].tag = 0;
    }

    void build(int tl, int tr, int v, vector<int> &vec) {
        if(tl == tr) {
            data[v] = Node(vec[tl]);
            return;
        }
        int tm = (tl + tr) >> 1;

        build(tl, tm, v<<1, vec);
        build(tm + 1, tr, v<<1^1, vec);
        data[v] = data[v<<1].merge(data[v<<1^1]);
    }

    int getMin(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) {
            return data[v].mn;
        }
        if(tl > r || tr < l) return INF;
        int tm = (tl + tr) >> 1;
        push(v);
        return min(getMin(tl, tm, v<<1, l, r), getMin(tm + 1, tr, v<<1^1, l, r));
    }
    int getMin(int l, int r) {
        l = max(0, l); r = min(sz, r);
        if(l > r) {
          // cout<<"MIN:"<<l<<" "<<r<<" val:"<<0<<"\n";
          return 0;
        }
        // cout<<"MIN:"<<l<<" "<<r<<" val:"<<getMin(0, sz, 1, l, r)<<"\n";
        return getMin(0, sz, 1, l, r);
    }

    int getMax(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) {
            return data[v].mx;
        }
        if(tl > r || tr < l) return -INF;
        int tm = (tl + tr) >> 1;
        push(v);
        return max(getMax(tl, tm, v<<1, l, r), getMax(tm + 1, tr, v<<1^1, l, r));
    } 
    int getMax(int l, int r) {
        l = max(0, l); r = min(sz, r);
        if(l > r) {
          // cout<<"MAX:"<<l<<" "<<r<<" val:"<<0<<"\n";
          return 0;
        }
        // cout<<"MAX:"<<l<<" "<<r<<" val:"<<getMax(0, sz, 1, l, r)<<"\n";
        return getMax(0, sz, 1, l, r);
    }

    void update(int tl, int tr, int v, int l, int r, int val) {
        if(tl >= l && tr <= r) {
            data[v].add(val);
            return;
        }
        if(tl > r || tr < l) {
            return;
        }
        int tm = (tl + tr) >> 1;
        push(v);
        update(tl, tm, v<<1, l, r, val);
        update(tm + 1, tr, v<<1^1, l, r, val);
        data[v] = data[v<<1].merge(data[v<<1^1]);
    }
    void update(int l, int r, int val) {
        l = max(0, l); r = min(sz, r);
        if(l > r) return;
        update(0, sz, 1, l, r, val);
    }
};

SegTree st, st2;
vector<vector<int> > occ; 
vector<int> pr;

int sequence(int n, vector<int> a) {
    N = n;
    st.reset(n - 1); st2.reset(n - 1);
    occ.assign(n + 1, vector<int>());
    pr.assign(n, 0);
    for(int i = 0; i<n; i++) {
        occ[a[i]].pb(i);
    } 
    pr[0] = 1;
    for(int i = 1; i<n; i++) pr[i] = pr[i - 1] + 1;
    st.build(0, n - 1, 1, pr);   
    st2.build(0, n - 1, 1, pr); 
    int ans = 1;

    for(int v = 1; v<=n; v++) {
        for(auto c : occ[v]) {
            st2.update(c, n - 1, -2);
        }
        int l  = 0;
        for(int r = 0; r<occ[v].size(); r++) {
            while(l <= r) {
            int fir = occ[v][l], sec = occ[v][r];
            int v1 = st.getMax(sec, n - 1) - min(0, st.getMin(0, fir - 1));
            int v2 = st2.getMin(sec, n - 1) - max(0, st2.getMax(0, fir - 1));
            if(1ll * v1 * v2 <= 0ll) {
                ans = max(ans , r - l + 1);
                break;
            }
            l++;
            }
        }
        // cout<<"i:"<<i<<" mn: "<<mn<<" mx:"<<mx<<"\n";
 
        for(auto c : occ[v])  {
            st.update(c, n - 1, -2);
        }
    }
    return ans;
}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:154:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |         for(int r = 0; r<occ[v].size(); r++) {
      |                        ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 565 ms 75096 KB Output is correct
3 Correct 589 ms 78164 KB Output is correct
4 Correct 541 ms 67860 KB Output is correct
5 Correct 586 ms 77228 KB Output is correct
6 Correct 561 ms 77228 KB Output is correct
7 Correct 511 ms 68880 KB Output is correct
8 Correct 560 ms 68944 KB Output is correct
9 Correct 552 ms 68584 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 661 ms 68116 KB Output is correct
3 Correct 638 ms 68040 KB Output is correct
4 Correct 693 ms 68100 KB Output is correct
5 Correct 573 ms 68984 KB Output is correct
6 Correct 623 ms 68176 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 737 ms 80672 KB Output is correct
2 Correct 735 ms 80468 KB Output is correct
3 Correct 744 ms 79956 KB Output is correct
4 Correct 732 ms 80084 KB Output is correct
5 Correct 700 ms 76752 KB Output is correct
6 Correct 739 ms 76756 KB Output is correct
7 Correct 634 ms 75560 KB Output is correct
8 Correct 668 ms 75340 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 114 ms 12632 KB Output is correct
24 Correct 115 ms 12636 KB Output is correct
25 Correct 120 ms 12824 KB Output is correct
26 Correct 131 ms 11724 KB Output is correct
27 Correct 127 ms 11724 KB Output is correct
28 Correct 126 ms 11716 KB Output is correct
29 Correct 100 ms 11332 KB Output is correct
30 Correct 104 ms 11356 KB Output is correct
31 Correct 59 ms 11736 KB Output is correct
32 Correct 79 ms 13736 KB Output is correct
33 Correct 108 ms 12636 KB Output is correct
34 Correct 129 ms 12636 KB Output is correct
35 Correct 104 ms 12376 KB Output is correct
36 Correct 124 ms 12632 KB Output is correct
37 Correct 121 ms 12380 KB Output is correct
38 Correct 125 ms 12880 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 565 ms 75096 KB Output is correct
24 Correct 589 ms 78164 KB Output is correct
25 Correct 541 ms 67860 KB Output is correct
26 Correct 586 ms 77228 KB Output is correct
27 Correct 561 ms 77228 KB Output is correct
28 Correct 511 ms 68880 KB Output is correct
29 Correct 560 ms 68944 KB Output is correct
30 Correct 552 ms 68584 KB Output is correct
31 Correct 661 ms 68116 KB Output is correct
32 Correct 638 ms 68040 KB Output is correct
33 Correct 693 ms 68100 KB Output is correct
34 Correct 573 ms 68984 KB Output is correct
35 Correct 623 ms 68176 KB Output is correct
36 Correct 737 ms 80672 KB Output is correct
37 Correct 735 ms 80468 KB Output is correct
38 Correct 744 ms 79956 KB Output is correct
39 Correct 732 ms 80084 KB Output is correct
40 Correct 700 ms 76752 KB Output is correct
41 Correct 739 ms 76756 KB Output is correct
42 Correct 634 ms 75560 KB Output is correct
43 Correct 668 ms 75340 KB Output is correct
44 Correct 114 ms 12632 KB Output is correct
45 Correct 115 ms 12636 KB Output is correct
46 Correct 120 ms 12824 KB Output is correct
47 Correct 131 ms 11724 KB Output is correct
48 Correct 127 ms 11724 KB Output is correct
49 Correct 126 ms 11716 KB Output is correct
50 Correct 100 ms 11332 KB Output is correct
51 Correct 104 ms 11356 KB Output is correct
52 Correct 59 ms 11736 KB Output is correct
53 Correct 79 ms 13736 KB Output is correct
54 Correct 108 ms 12636 KB Output is correct
55 Correct 129 ms 12636 KB Output is correct
56 Correct 104 ms 12376 KB Output is correct
57 Correct 124 ms 12632 KB Output is correct
58 Correct 121 ms 12380 KB Output is correct
59 Correct 125 ms 12880 KB Output is correct
60 Correct 954 ms 78260 KB Output is correct
61 Correct 984 ms 78420 KB Output is correct
62 Correct 956 ms 78264 KB Output is correct
63 Correct 972 ms 70104 KB Output is correct
64 Correct 979 ms 70096 KB Output is correct
65 Correct 968 ms 70080 KB Output is correct
66 Correct 794 ms 68232 KB Output is correct
67 Correct 728 ms 68364 KB Output is correct
68 Correct 415 ms 70580 KB Output is correct
69 Correct 602 ms 83992 KB Output is correct
70 Correct 888 ms 77348 KB Output is correct
71 Correct 939 ms 77380 KB Output is correct
72 Correct 913 ms 76768 KB Output is correct
73 Correct 913 ms 77256 KB Output is correct
74 Correct 924 ms 76660 KB Output is correct
75 Correct 928 ms 77260 KB Output is correct