This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_9_C
#include "../../template/template.hpp"
#include "../../structure/heap/leftist-heap.hpp"
int main() {
string s;
LeftistHeap< int, false > que;
auto root = que.make_root();
while(cin >> s, s != "end") {
if(s == "insert") {
int x;
cin >> x;
root = que.push(root, x);
} else {
cout << root->key << "\n";
root = que.pop(root);
}
}
}
#line 1 "test/verify/aoj-alds-1-9-c.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_9_C
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-alds-1-9-c.test.cpp"
#line 1 "structure/heap/leftist-heap.hpp"
/**
* @brief Leftist-Heap
*/
template <typename T, bool isMin = true>
struct LeftistHeap {
struct Node {
Node *l, *r;
int s;
T key;
int idx;
explicit Node(const T &key, int idx)
: key(key), s(1), l(nullptr), r(nullptr), idx(idx) {}
};
LeftistHeap() = default;
virtual Node *clone(Node *t) { return t; }
Node *alloc(const T &key, int idx = -1) { return new Node(key, idx); }
Node *meld(Node *a, Node *b) {
if (!a || !b) return a ? a : b;
if ((a->key < b->key) ^ isMin) swap(a, b);
a = clone(a);
a->r = meld(a->r, b);
if (!a->l || a->l->s < a->r->s) swap(a->l, a->r);
a->s = (a->r ? a->r->s : 0) + 1;
return a;
}
Node *push(Node *t, const T &key, int idx = -1) {
return meld(t, alloc(key, idx));
}
Node *pop(Node *t) {
assert(t != nullptr);
return meld(t->l, t->r);
}
Node *make_root() { return nullptr; }
};
#line 6 "test/verify/aoj-alds-1-9-c.test.cpp"
int main() {
string s;
LeftistHeap< int, false > que;
auto root = que.make_root();
while(cin >> s, s != "end") {
if(s == "insert") {
int x;
cin >> x;
root = que.push(root, x);
} else {
cout << root->key << "\n";
root = que.pop(root);
}
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 2.in | AC | 6 ms | 4 MB |
g++ | 3.in | AC | 6 ms | 4 MB |
g++ | 4.in | AC | 6 ms | 4 MB |
g++ | 5.in | AC | 640 ms | 74 MB |
clang++ | 2.in | AC | 6 ms | 4 MB |
clang++ | 3.in | AC | 6 ms | 4 MB |
clang++ | 4.in | AC | 7 ms | 4 MB |
clang++ | 5.in | AC | 745 ms | 74 MB |