提出 #9958496

ソースコード 拡げる

#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

template<typename T>
class AVLTree {
  struct Node {
    Node *left, *right, *prt;
    T key;
    int height, size;

    Node(T x) {
      left = right = prt = nullptr;
      height = 1;
      key = x;
      size = 1;
    }

    inline int factor() const {
      int lv = (this->left ? this->left->height : 0);
      int rv = (this->right ? this->right->height : 0);
      return (rv - lv);
    }

    inline int update_height() {
      return this->height = max(
        (this->left ? this->left->height : 0),
        (this->right ? this->right->height : 0)
      ) + 1;
    }

    inline bool is_left(Node *node) const {
      return left == node;
    }

    inline void assign(Node *node) {
      this->key = node->key;
    }

    inline Node* rotate_left() {
      Node *r = this->right, *m = r->left, *p = this->prt;
      if(r->prt = p) {
        if(p->left == this) p->left = r;
        else p->right = r;
      }
      if(this->right = m) m->prt = this;
      r->left = this; this->prt = r;

      int sz = this->size;
      this->size += (m ? m->size : 0) - r->size;
      r->size = sz;

      this->update_height();
      r->update_height();
      return r;
    }

    inline Node* rotate_right() {
      Node *l = this->left, *m = l->right, *p = this->prt;
      if(l->prt = p) {
        if(p->left == this) p->left = l;
        else p->right = l;
      }
      if(this->left = m) m->prt = this;
      l->right = this; this->prt = l;

      int sz = this->size;
      this->size += (m ? m->size : 0) - l->size;
      l->size = sz;

      this->update_height();
      l->update_height();
      return l;
    }

    inline Node* rotate_double_right() {
      Node *l = this->left, *p = this->prt,
           *m = l->right, *ml = m->left, *mr = m->right;
      if(m->prt = p) {
        if(p->left == this) p->left = m;
        else p->right = m;
      }
      if(l->right = ml) ml->prt = l;
      if(this->left = mr) mr->prt = this;
      m->left = l; l->prt = m;
      m->right = this; this->prt = m;

      int sz = this->size;
      this->size += (mr ? mr->size : 0) - l->size;
      l->size += (ml ? ml->size : 0) - m->size;
      m->size = sz;

      this->update_height();
      l->update_height();
      m->update_height();

      return m;
    }

    inline Node* rotate_double_left() {
      Node *r = this->right, *p = this->prt,
           *m = r->left, *ml = m->left, *mr = m->right;
      if(m->prt = p) {
        if(p->left == this) p->left = m;
        else p->right = m;
      }
      if(this->right = ml) ml->prt = this;
      if(r->left = mr) mr->prt = r;
      m->left = this; this->prt = m;
      m->right = r; r->prt = m;

      int sz = this->size;
      this->size += (ml ? ml->size : 0) - r->size;
      r->size += (mr ? mr->size : 0) - m->size;
      m->size = sz;

      this->update_height();
      r->update_height();
      m->update_height();

      return m;
    }
  };

  Node *root;

  inline Node* find_node(Node *node, T x) {
    if(node == nullptr) return nullptr;
    while(node->key != x) {
      if(x < node->key) {
        if(!node->left) break;
        node = node->left;
      } else {
        if(!node->right) break;
        node = node->right;
      }
    }
    return node;
  }

  inline void remove_node(Node *node) {
    T x = node->key;
    Node *prt = node->prt;

    if(!node->left || !node->right) {
      Node *n_node = (node->left ? node->left : node->right);
      if(prt) {
        if(x < prt->key) {
          prt->left = n_node;
        } else {
          prt->right = n_node;
        }
      }
      if((node = n_node)) node->prt = prt;
    } else {
      Node *c_node = find_node(node->right, x), *n_node = c_node->right;
      Node *c_prt = c_node->prt;
      if(node->right == c_node) {
        if((node->right = n_node)) n_node->prt = c_prt;
      } else {
        if((c_prt->left = n_node)) n_node->prt = c_prt;
      }
      node->assign(c_node);
      node = n_node; prt = c_prt;
    }

    while(prt) {
      --prt->size;
      prt->update_height();
      if(prt->is_left(node)) {
        if(prt->factor() == 2) {
          Node *sib = prt->right;
          if(sib->factor() < 0) {
            node = prt->rotate_double_left();
          } else {
            node = prt->rotate_left();
          }
        } else {
          if(prt->factor() == 1) break;
          node = prt;
        }
        prt = node->prt;
      } else {
        if(prt->factor() == -2) {
          Node *sib = prt->left;
          if(sib->factor() > 0) {
            node = prt->rotate_double_right();
          } else {
            node = prt->rotate_right();
          }
        } else {
          if(prt->factor() == -1) break;
          node = prt;
        }
        prt = node->prt;
      }
    }
    if(prt) {
      node = prt; prt = prt->prt;
      while(prt) {
        --prt->size;
        prt->update_height();
        node = prt; prt = node->prt;
      }
    }
    this->root = node;
  }

public:
  AVLTree() {
    root = nullptr;
  }

  inline bool find(T x) {
    if(!this->root) {
      return false;
    }

    Node *node = find_node(this->root, x);
    return (node->key == x);
  }

  inline T at(int k) {
    if(!this->root) {
      return 0;
    }
    // assert(0 <= k < size);

    Node *node = this->root;
    ++k;
    while(1) {
      int l_size = (node->left ? node->left->size : 0) + 1;
      if(l_size == k) break;

      if(k < l_size) {
        node = node->left;
      } else {
        node = node->right;
        k -= l_size;
      }
    }
    return node->key;
  }

  inline bool insert(T x) {
    if(!this->root) {
      this->root = new Node(x);
      return true;
    }

    Node *node = find_node(this->root, x);
    if(node->key == x) {
      return false;
    }

    Node *new_node = new Node(x);
    new_node->prt = node;
    if(x < node->key) {
      node->left = new_node;
    } else {
      node->right = new_node;
    }
    node = new_node;

    while(node->prt) {
      Node *prt = node->prt;
      ++prt->size;
      prt->update_height();
      if(prt->is_left(node)) {
        if(prt->factor() == -2) {
          if(node->factor() > 0) {
            node = prt->rotate_double_right();
          } else {
            node = prt->rotate_right();
          }
        } else {
          if(prt->factor() >= 0) break;
          node = prt;
        }
      } else {
        if(prt->factor() == 2) {
          if(node->factor() < 0) {
            node = prt->rotate_double_left();
          } else {
            node = prt->rotate_left();
          }
        } else {
          if(prt->factor() <= 0) break;
          node = prt;
        }
      }
    }
    if(node->prt) {
      node = node->prt;
      Node *prt = node->prt;
      while(prt) {
        ++prt->size;
        prt->update_height();
        node = prt; prt = node->prt;
      }
    }
    this->root = node;
    return true;
  }

  inline bool remove(T x) {
    if(!this->root) {
      return false;
    }

    Node *node = find_node(this->root, x);
    if(node->key != x) {
      return false;
    }

    remove_node(node);
    return true;
  }

  int size() {
    return (this->root ? this->root->size : 0);
  }
};

int main() {
  AVLTree<int> tree;
  cin.tie(0); ios_base::sync_with_stdio(false);
  int q; cin >> q;
  while(q--) {
    int t, x; cin >> t >> x;
    switch(t) {
    case 1:
      tree.insert(x);
      break;
    case 2:
      x = tree.at(x-1);
      tree.remove(x);
      cout << x << "\n";
      break;
    }
  }
  return 0;
}

提出情報

提出日時
問題 C - データ構造
ユーザ yaketake08
言語 C++14 (GCC 5.4.1)
得点 100
コード長 9244 Byte
結果 AC
実行時間 113 ms
メモリ 9600 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 100 / 100
結果
AC × 2
AC × 18
セット名 テストケース
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt
ケース名 結果 実行時間 メモリ
sample_01.txt AC 1 ms 256 KiB
sample_02.txt AC 1 ms 256 KiB
subtask1_01.txt AC 1 ms 256 KiB
subtask1_02.txt AC 1 ms 256 KiB
subtask1_03.txt AC 1 ms 256 KiB
subtask1_04.txt AC 5 ms 640 KiB
subtask1_05.txt AC 10 ms 1024 KiB
subtask1_06.txt AC 1 ms 256 KiB
subtask1_07.txt AC 63 ms 4736 KiB
subtask1_08.txt AC 65 ms 5632 KiB
subtask1_09.txt AC 62 ms 5632 KiB
subtask1_10.txt AC 112 ms 7552 KiB
subtask1_11.txt AC 112 ms 7552 KiB
subtask1_12.txt AC 109 ms 9600 KiB
subtask1_13.txt AC 113 ms 5632 KiB
subtask1_14.txt AC 113 ms 5632 KiB
subtask1_15.txt AC 63 ms 5632 KiB
subtask1_16.txt AC 79 ms 7552 KiB