結果
問題 | No.649 ここでちょっとQK! |
ユーザー | みずくらげ |
提出日時 | 2019-07-23 13:09:30 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,185 bytes |
コンパイル時間 | 1,495 ms |
コンパイル使用メモリ | 123,724 KB |
実行使用メモリ | 12,800 KB |
最終ジャッジ日時 | 2024-06-25 12:17:23 |
合計ジャッジ時間 | 6,928 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | AC | 296 ms
5,376 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 223 ms
12,800 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
ソースコード
#include <iostream> #include <vector> #include <string> #include <cstring> #include <algorithm> #include <cmath> #include <set> #include <map> #include <queue> #include <iomanip> #include <cassert> #include <random> using namespace std; // 参考 // https://www.slideshare.net/iwiwi/2-12188757 // https://qiita.com/drken/items/1b7e6e459c24a83bb7fd typedef long long VAL; struct Tree { // 速い!! unsigned int randInt() { static unsigned int tx = 123456789, ty=362436069, tz=521288629, tw=88675123; unsigned int tt = (tx^(tx<<11)); tx = ty; ty = tz; tz = tw; return ( tw=(tw^(tw>>19))^(tt^(tt>>8)) ); } struct node_t{ VAL val; node_t* lch; node_t* rch; int size; VAL sum; node_t() : val(0), size(1), sum(0) {lch = rch = NULL;} node_t(VAL v) : val(v), size(1), sum(v) {lch = rch = NULL;} }; node_t* root; Tree() : root(NULL) {} Tree(node_t* t) : root(t) {} inline int size(node_t* t) {return !t ?0 :t->size;} inline int size() {return this->size(this->root);} inline VAL sum(node_t* t) {return !t ?0 :t->sum;} inline VAL sum() {return this->sum(this->root);} inline node_t* update(node_t* t) { t->size = size(t->lch) + size(t->rch) + 1; t->sum = sum(t->lch) + sum(t->rch) + t->val; return t; } inline int lowerBound(node_t* t, VAL val) { if (!t) return 0; if (val <= t->val) return lowerBound(t->lch, val); else return size(t->lch) + lowerBound(t->rch, val) + 1; } inline int lowerBound(VAL val) {return this->lowerBound(this->root, val);} inline int upperBound(node_t* t, VAL val) { return lowerBound(t, val+1); } inline int upperBound(VAL val) {return this->lowerBound(this->root, val+1);} inline int count(VAL val) {return this->lowerBound(this->root, val+1) - this->lowerBound(this->root, val);} inline VAL get(node_t* t, int k) { if (!t) return -1; if (k == size(t->lch)) return t->val; if (k < size(t->lch)) return get(t->lch, k); else return get(t->rch, k - size(t->lch) - 1); } inline VAL get(int k) {return get(this->root, k);} node_t* merge(node_t* l, node_t* r) { if (!l || !r) return !l ?r :l; if (randInt() % (l->size + r->size) < l->size) { l->rch = merge(l->rch, r); return update(l); } else { r->lch = merge(l, r->lch); return update(r); } } void merge(Tree add) {this->root = this->merge(this->root, add.root);} pair<node_t*, node_t*> split(node_t* t, int k) { // [0, k), [k, n) if (!t) return make_pair(t, t); if (k <= size(t->lch)) { pair<node_t*, node_t*> s = split(t->lch, k); t->lch = s.first; return make_pair(update(t), s.second); } else { pair<node_t*, node_t*> s = split(t->rch, k - size(t->lch) - 1); t->rch = s.second; return make_pair(s.first, update(t)); } } Tree split(int k) { pair<node_t*, node_t*> s = split(this->root, k); this->root = s.first; return Tree(s.second); } void insert(VAL val) { pair<node_t*, node_t*> s = this->split(this->root, this->lowerBound(val)); this->root = this->merge(this->merge(s.first, new node_t(val)), s.second); } void erase(VAL val) { if (!(this->upperBound(val) - this->lowerBound(val))) return; pair<node_t*, node_t*> s = this->split(this->root, this->lowerBound(val)); this->root = this->merge(s.first, this->split(s.second, 1).second); } }; int main() { int q, k; cin >> q >> k; Tree tree; for (int i = 0; i < q; i++) { int t; cin >> t; if (t == 1) { long long val; cin >> val; tree.insert(val); } else { if (tree.size() < k) { cout << -1 << endl; continue; } long long val = tree.get(k-1); cout << val << endl; tree.erase(val); } } }