oj.uz

Submission #885108

# Submission time Handle Problem Language Result Execution time Memory
885108 2023-12-09T02:36:10 Z fanwen Sequence (APIO23_sequence) C++17
0 / 100
 61 ms 45860 KB 
#include <bits/stdc++.h>

#define fi first 
#define se second 

using namespace std;

const int MAX = 1e5 + 5;

int A[MAX];
vector <int> pos[MAX], max_pref[MAX], min_pref[MAX], max_suff[MAX], min_suff[MAX];

struct node {
  int ma, mi, lazy;
  node(int ma = 0, int mi = 0) : ma(ma), mi(mi) {}
} it[MAX << 2];

node merge(const node &a, const node &b) {
  return node(max(a.ma, b.ma), min(a.mi, b.mi));
}

void build(int idx, int l, int r) {
  if(l == r) it[idx] = node(l, r);
  else {
    int mid = l + r >> 1;
    build(idx << 1, l, mid);
    build(idx << 1 | 1, mid + 1, r);
    it[idx] = merge(it[idx << 1], it[idx << 1 | 1]);
  }
}

void push(int idx) {
  if(!it[idx].lazy) return;
  it[idx << 1].ma += it[idx].lazy;
  it[idx << 1].mi += it[idx].lazy;
  it[idx << 1 | 1].ma += it[idx].lazy;
  it[idx << 1 | 1].mi += it[idx].lazy;
  it[idx << 1].lazy += it[idx].lazy;
  it[idx << 1 | 1].lazy += it[idx].lazy;
  it[idx].lazy = 0;
}

void update(int idx, int l, int r, int u, int v, int val) {
  if(l > v || r < u) return;
  if(l >= u && r <= v) {
    it[idx].ma += val;
    it[idx].mi += val;
    it[idx].lazy += val;
    return;
  }

  push(idx);

  int mid = l + r >> 1;

  update(idx << 1, l, mid, u, v, val);
  update(idx << 1 | 1, mid + 1, r, u, v, val);

  it[idx] = merge(it[idx << 1], it[idx << 1 | 1]);
}

node get(int idx, int l, int r, int u, int v) {
  if(l > v || r < u) return node(-1e9, 1e9);
  if(l >= u && r <= v) return it[idx];

  push(idx);

  int mid = l + r >> 1;

  return merge(get(idx << 1, l, mid, u, v), get(idx << 1 | 1, mid + 1, r, u, v));
}

int sequence(int n, vector <int> a) {
  for (int i = 0; i < n; ++i) A[i + 1] = a[i];
  for (int i = 1; i <= n; ++i) pos[A[i]].push_back(i);

  build(1, 0, n);
  for (int i = 1; i <= n; ++i) {
    for (auto &j : pos[i]) {
      max_pref[i].push_back(get(1, 0, n, 0, j - 1).ma);
      min_suff[i].push_back(get(1, 0, n, j, n).mi);
    }

    for (auto &j : pos[i]) update(1, 0, n, j, n, -2);

    for (auto &j : pos[i]) {
      min_pref[i].push_back(get(1, 0, n, 0, j - 1).mi);
      max_suff[i].push_back(get(1, 0, n, j, n).ma);
    }
  }
  auto check = [&] (int res) -> bool {
    for (int i = 1; i <= n; ++i) {
      for (int j = 0; j + res - 1 < (int) pos[i].size(); ++j) {
        if(max_pref[i][j] >= min_suff[i][j + res - 1] && max_suff[i][j + res - 1] >= min_pref[i][j]) {
          return true;
        }
      }
    }
    return false;
  };

  int l = 1, r = n + 1;
  // cout << check(3) << '\n';
  while(r - l > 1) {
    int mid = l + r >> 1;
    // cout << mid << endl;
    if(check(mid)) l = mid;
    else r = mid;
  }
  return max(l, 1);
}

#ifdef local 

signed main() {
  freopen("TASK.inp", "r", stdin);
  freopen("TASK.out", "w", stdout);

  int n; cin >> n; vector <int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];

  cout << sequence(n, a); 
}

#endif // local

Compilation message

sequence.cpp: In function 'void build(int, int, int)':
sequence.cpp:25:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |     int mid = l + r >> 1;
      |               ~~^~~
sequence.cpp: In function 'void update(int, int, int, int, int, int)':
sequence.cpp:54:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |   int mid = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'node get(int, int, int, int, int)':
sequence.cpp:68:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |   int mid = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:105:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  105 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 16988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 16988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 16988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 17032 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 61 ms 45860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 16988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 16988 KB Output isn't correct
2 Halted 0 ms 0 KB -