oj.uz

Submission #750307

# Submission time Handle Problem Language Result Execution time Memory
750307 2023-05-29T11:08:09 Z marvinthang Sequence (APIO23_sequence) C++17
100 / 100
 1002 ms 46028 KB 
#include "sequence.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif
 
template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }
template <class InIter, class OutIter>  void compress(InIter first, InIter last, OutIter result) { vector <__typeof(*first)> v(first, last); sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); while (first != last) { *result = lower_bound(v.begin(), v.end(), *first) - v.begin(); ++first; ++result; } }

// end of template

const int MAX = 5e5 + 5;

int N;

int ma[MAX << 2], lazy[MAX << 2], mi[MAX << 2];

void pushDown(int i) {
    if (!lazy[i]) return;
    ma[i << 1] += lazy[i];
    ma[i << 1 | 1] += lazy[i];
    mi[i << 1] += lazy[i];
    mi[i << 1 | 1] += lazy[i];
    lazy[i << 1] += lazy[i];
    lazy[i << 1 | 1] += lazy[i];
    lazy[i] = 0;
}

void update(int i, int l, int r, int u, int v, int add) {
    if (l >= v || r <= u) return;
    if (u <= l && r <= v) {
        ma[i] += add;
        mi[i] += add;
        lazy[i] += add;
        return;
    }
    pushDown(i);
    int m = l + r >> 1;
    update(i << 1, l, m, u, v, add);
    update(i << 1 | 1, m, r, u, v, add);
    ma[i] = max(ma[i << 1], ma[i << 1 | 1]);
    mi[i] = min(mi[i << 1], mi[i << 1 | 1]);
}

int getMax(int i, int l, int r, int u, int v) {
    if (l >= v || r <= u) return -N - N - N;
    if (u <= l && r <= v) return ma[i];
    pushDown(i);
    int m = l + r >> 1;
    return max(getMax(i << 1, l, m, u, v), getMax(i << 1 | 1, m, r, u, v));
}

int getMin(int i, int l, int r, int u, int v) {
    if (l >= v || r <= u) return N + N + N;
    if (u <= l && r <= v) return mi[i];
    pushDown(i);
    int m = l + r >> 1;
    return min(getMin(i << 1, l, m, u, v), getMin(i << 1 | 1, m, r, u, v));
}

int sequence(int n, vector <int> A) {
    N = n;
    vector <int> cnt(N);
    REP(i, N) ++cnt[--A[i]];
    vector <vector <int>> pos(N);
    REP(i, N) pos[A[i]].push_back(i);
    REP(i, N) update(1, 0, N, i, N, 1);
    int res = 1;
    REP(i, N) {
        vector <int> min_pref, max_suff;
        for (int j: pos[i]) {
            min_pref.push_back(min(0, getMin(1, 0, N, 0, j)));
            max_suff.push_back(getMax(1, 0, N, j, N));
        }
        for (int j: pos[i]) update(1, 0, N, j, N, -2);
        vector <int> max_pref, min_suff;
        for (int j: pos[i]) {
            max_pref.push_back(max(0, getMax(1, 0, N, 0, j)));
            min_suff.push_back(getMin(1, 0, N, j, N));
        }
        REP(j, pos[i].size()) {
            while (j + res < (int) pos[i].size()) {
                if (min_pref[j] <= max_suff[j + res] && max_pref[j] >= min_suff[j + res]) ++res;
                else break;
            }
        }
    }
    return res;
}

#ifdef LOCAL
#include "sequence.h"

#include <cassert>
#include <cstdio>

#include <vector>

int main() {
    file("sequence");
  int N;
  assert(1 == scanf("%d", &N));

  std::vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &A[i]));
  }

  int result = sequence(N, A);
  printf("%d\n", result);
  return 0;
}
#endif

Compilation message

sequence.cpp: In function 'void update(int, int, int, int, int, int)':
sequence.cpp:70:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |     int m = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'int getMax(int, int, int, int, int)':
sequence.cpp:81:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |     int m = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'int getMin(int, int, int, int, int)':
sequence.cpp:89:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |     int m = l + r >> 1;
      |             ~~^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 673 ms 40184 KB Output is correct
3 Correct 707 ms 40172 KB Output is correct
4 Correct 578 ms 35160 KB Output is correct
5 Correct 700 ms 39116 KB Output is correct
6 Correct 682 ms 39232 KB Output is correct
7 Correct 580 ms 33168 KB Output is correct
8 Correct 580 ms 33220 KB Output is correct
9 Correct 584 ms 36072 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 606 ms 39352 KB Output is correct
3 Correct 586 ms 36152 KB Output is correct
4 Correct 616 ms 36168 KB Output is correct
5 Correct 592 ms 39520 KB Output is correct
6 Correct 587 ms 37548 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 46028 KB Output is correct
2 Correct 837 ms 45772 KB Output is correct
3 Correct 836 ms 45372 KB Output is correct
4 Correct 826 ms 45408 KB Output is correct
5 Correct 744 ms 41948 KB Output is correct
6 Correct 758 ms 41948 KB Output is correct
7 Correct 653 ms 40780 KB Output is correct
8 Correct 664 ms 40480 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 129 ms 7820 KB Output is correct
24 Correct 124 ms 7820 KB Output is correct
25 Correct 125 ms 7824 KB Output is correct
26 Correct 96 ms 6896 KB Output is correct
27 Correct 98 ms 6904 KB Output is correct
28 Correct 99 ms 6788 KB Output is correct
29 Correct 88 ms 6896 KB Output is correct
30 Correct 88 ms 6888 KB Output is correct
31 Correct 84 ms 8588 KB Output is correct
32 Correct 94 ms 8732 KB Output is correct
33 Correct 117 ms 7756 KB Output is correct
34 Correct 129 ms 7780 KB Output is correct
35 Correct 122 ms 7756 KB Output is correct
36 Correct 115 ms 7884 KB Output is correct
37 Correct 120 ms 7860 KB Output is correct
38 Correct 121 ms 7904 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 673 ms 40184 KB Output is correct
24 Correct 707 ms 40172 KB Output is correct
25 Correct 578 ms 35160 KB Output is correct
26 Correct 700 ms 39116 KB Output is correct
27 Correct 682 ms 39232 KB Output is correct
28 Correct 580 ms 33168 KB Output is correct
29 Correct 580 ms 33220 KB Output is correct
30 Correct 584 ms 36072 KB Output is correct
31 Correct 606 ms 39352 KB Output is correct
32 Correct 586 ms 36152 KB Output is correct
33 Correct 616 ms 36168 KB Output is correct
34 Correct 592 ms 39520 KB Output is correct
35 Correct 587 ms 37548 KB Output is correct
36 Correct 848 ms 46028 KB Output is correct
37 Correct 837 ms 45772 KB Output is correct
38 Correct 836 ms 45372 KB Output is correct
39 Correct 826 ms 45408 KB Output is correct
40 Correct 744 ms 41948 KB Output is correct
41 Correct 758 ms 41948 KB Output is correct
42 Correct 653 ms 40780 KB Output is correct
43 Correct 664 ms 40480 KB Output is correct
44 Correct 129 ms 7820 KB Output is correct
45 Correct 124 ms 7820 KB Output is correct
46 Correct 125 ms 7824 KB Output is correct
47 Correct 96 ms 6896 KB Output is correct
48 Correct 98 ms 6904 KB Output is correct
49 Correct 99 ms 6788 KB Output is correct
50 Correct 88 ms 6896 KB Output is correct
51 Correct 88 ms 6888 KB Output is correct
52 Correct 84 ms 8588 KB Output is correct
53 Correct 94 ms 8732 KB Output is correct
54 Correct 117 ms 7756 KB Output is correct
55 Correct 129 ms 7780 KB Output is correct
56 Correct 122 ms 7756 KB Output is correct
57 Correct 115 ms 7884 KB Output is correct
58 Correct 120 ms 7860 KB Output is correct
59 Correct 121 ms 7904 KB Output is correct
60 Correct 1002 ms 40176 KB Output is correct
61 Correct 1000 ms 40268 KB Output is correct
62 Correct 986 ms 40288 KB Output is correct
63 Correct 723 ms 33472 KB Output is correct
64 Correct 781 ms 33456 KB Output is correct
65 Correct 738 ms 33536 KB Output is correct
66 Correct 596 ms 35012 KB Output is correct
67 Correct 638 ms 34920 KB Output is correct
68 Correct 568 ms 41564 KB Output is correct
69 Correct 640 ms 45900 KB Output is correct
70 Correct 930 ms 40512 KB Output is correct
71 Correct 961 ms 40980 KB Output is correct
72 Correct 881 ms 40528 KB Output is correct
73 Correct 896 ms 40768 KB Output is correct
74 Correct 869 ms 40536 KB Output is correct
75 Correct 908 ms 40836 KB Output is correct