ds/removable_queue.hpp

• View this file on GitHub
• Last update: 2024-02-24 23:26:31+09:00
• Include: #include "ds/removable_queue.hpp"

Required by

• ds/slide_split_sum.hpp

Verified with

• test/library_checker/datastructure/double_ended_pq.test.cpp
• test/yukicoder/2654.test.cpp
• test/yukicoder/772.test.cpp
• test/yukicoder/902.test.cpp
• test_atcoder/abc281e.test.cpp
• test_atcoder/abc312f.test.cpp
• test_atcoder/abc314g.test.cpp

Code

#pragma once

template <typename QUE_TYPE>
struct Removable_Queue {
  using QUE = QUE_TYPE;
  using T = typename QUE::value_type;

  QUE que, rm_que;

  Removable_Queue() {}
  Removable_Queue(vc<T>& dat) : que(all(dat)) {}

  void push(T x) { que.push(x); }
  int size() { return len(que) - len(rm_que); }
  bool empty() { return size() == 0; }

  T pop() {
    refresh();
    return POP(que);
  }
  T top() {
    refresh();
    return que.top();
  }

  void remove(T x) { rm_que.push(x); }

private:
  void refresh() {
    while (len(rm_que) && rm_que.top() == que.top()) {
      rm_que.pop(), que.pop();
    }
  }
};

#line 2 "ds/removable_queue.hpp"

template <typename QUE_TYPE>
struct Removable_Queue {
  using QUE = QUE_TYPE;
  using T = typename QUE::value_type;

  QUE que, rm_que;

  Removable_Queue() {}
  Removable_Queue(vc<T>& dat) : que(all(dat)) {}

  void push(T x) { que.push(x); }
  int size() { return len(que) - len(rm_que); }
  bool empty() { return size() == 0; }

  T pop() {
    refresh();
    return POP(que);
  }
  T top() {
    refresh();
    return que.top();
  }

  void remove(T x) { rm_que.push(x); }

private:
  void refresh() {
    while (len(rm_que) && rm_que.top() == que.top()) {
      rm_que.pop(), que.pop();
    }
  }
};

Back to top page