結果

問題 No.649 ここでちょっとQK！
ユーザー hashiryo
提出日時 2020-05-02 15:12:09
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 3,454 bytes
コンパイル時間 2,034 ms
コンパイル使用メモリ 173,076 KB
実行使用メモリ 369,920 KB
最終ジャッジ日時 2024-12-30 02:43:03
合計ジャッジ時間 14,015 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3 RE * 1
other AC * 27 RE * 5
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n)                           \
  for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
  cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
template <typename M>
struct SegmentTree_Dynamic {
  using T = typename M::T;
  using ll = long long;
  using U = unsigned long long;
  struct Node {
    T dat;
    U xor_lazy;
    Node *ch[2];
    Node() : dat(M::ti()), xor_lazy(0), ch{nullptr, nullptr} {}
    Node(T v, U b, int p, Node *left, Node *right)
        : dat(v), xor_lazy(b), ch{left, right} {}
    /*
void *operator new(size_t) {
  static Node pool[1 << 23];
  return pool + node_count++;
}
*/
  };
  using np = Node *;
 private:
  const int height;
  const ll n;
  static int node_count;
  np root;
 private:
  inline void push(np t, ll b) {
    if ((t->xor_lazy >> (U)b) & (U)1) swap(t->ch[0], t->ch[1]);
    if (t->ch[0] != nullptr) t->ch[0]->xor_lazy ^= t->xor_lazy;
    if (t->ch[1] != nullptr) t->ch[1]->xor_lazy ^= t->xor_lazy;
    t->xor_lazy = 0;
  }
  T value(np t) { return t ? t->dat : M::ti(); }
  np set_Node(np t, U pos, T val, ll b) {
    if (t == nullptr) t = new Node();
    if (b < 0) {
      t->dat = val;
      return t;
    }
    push(t, b);
    bool f = (pos >> (U)b) & (U)1;
    t->ch[f] = set_Node(t->ch[f], pos, val, b - 1);
    t->dat = M::f(value(t->ch[0]), value(t->ch[1]));
    return t;
  }
  T query_Node(ll l, ll r, np t, ll lb, ll ub, ll b) {
    if (t == nullptr || ub <= l || r <= lb) return M::ti();
    push(t, b);
    if (l <= lb && ub <= r) return t->dat;
    ll c = (lb + ub) / 2;
    T vl = query_Node(l, r, t->ch[0], lb, c, b - 1);
    T vr = query_Node(l, r, t->ch[1], c, ub, b - 1);
    return M::f(vl, vr);
  }
  template <typename C>
  ll find(np t, C &check, U bias) {
    ll ret = 0;
    T acc = M::ti();
    for (ll b = height - 1; b >= 0; b--) {
      push(t, b);
      bool f = (bias >> (U)b) & (U)1;
      if (!check(M::f(acc, value(t->ch[f]))))
        acc = M::f(acc, value(t->ch[f])), f = !f;
      t = t->ch[f];
      if (!t) return -1;
      ret |= (U)f << (U)b;
    }
    return ret;
  }
 public:
  SegmentTree_Dynamic() {}
  SegmentTree_Dynamic(ll n_)
      : height(ceil(log2(n_))), n(1LL << height), root(nullptr) {}
  void clear() {
    Node::node_count = 0;
    root = nullptr;
  }
  void xor_all(U key) {
    if (root != nullptr) root->lazy ^= key;
  }
  void set_val(ll k, T x) { root = set_Node(root, k, x, height - 1); }
  //[a,b)
  T query(ll a, ll b) { return query_Node(a, b, root, 0, n, height - 1); }
  T operator[](ll k) { return query(k, k + 1); }
  // min { i : check(query(0,i+1)) = true }
  template <typename C>
  ll find_first(C &check, U bias = 0) {
    return find(root, check, bias);
  }
};
template <typename M>
int SegmentTree_Dynamic<M>::node_count = 0;
struct RsumQ {
  using T = int;
  static T ti() { return 0; }
  static T f(const T &l, const T &r) { return l + r; }
};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int Q, K;
  cin >> Q >> K;
  debug(K);
  K--;
  SegmentTree_Dynamic<RsumQ> seg((long long)1e18 + 10);
  while (Q--) {
    long long v;
    cin >> v;
    if (v == 1) {
      cin >> v;
      seg.set_val(v, seg[v] + 1);
    } else {
      auto check = [&](int x) { return x > K; };
      v = seg.find_first(check);
      cout << v << endl;
      if (v >= 0) seg.set_val(v, seg[v] - 1);
    }
  }
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0