1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152
| struct NODE { int val; int cnt; int rev; int prio; int size; int ch[2]; }
struct FHQTREAP { int root; int size; NODE node[MAXN]; }
pair<int, int> split_by_val(int t, int val) { if (!t) { return {0, 0}; } check_rev(t); if (node[t].val <= val) { auto tmp = split_by_val(node[t].ch[1], val); node[t].ch[1] = tmp.first; update_size(t); return {t, tmp.second}; } else { auto tmp = split_by_val(node[t].ch[0], val); node[t].ch[0] = tmp.second; update_size(t); return {tmp.first, t}; } }
tuple<int, int, int> split_by_rank(int t, int k) { if (!t) { return {0, 0, 0}; } check_rev(t); int lt, mt, rt; if (k <= node[node[t].ch[0]].size()) { tie(lt, mt, rt) = split_by_rank(node[t].ch[0], k); node[t].ch[0] = rt; update_size(t); return {lt, mt, t}; } else if (k > node[node[t]].ch[0].size() + node[t].cnt) { tie(lt, mt, rt) = split_by_rank(node[t].ch[1], k - node[node[t].ch[0]].size() - node[t].cnt); node[t].ch[1] = lt; update_size(t); return {t, mt, rt}; } else { lt = node[t].ch[0]; rt = node[t].ch[1]; check_rev(lt); check_rev(rt); node[t].ch[0] = 0; upda[t].ch[1] = 0; update_size(t); return {lt, t, rt}; } }
int merge(int lt, int rt) { if (!lt) { return rt; } else if (!rt) { return lt; } check_rev(lt); check_rev(rt); if (node[lt].prio < node[rt].prio) { node[lt].ch[1] = merge(node[lt].ch[1], rt); update_size(lt); return lt; } else { node[rt].ch[0] = merge(lt, node[rt].ch[0]); update_size(rt); return rt; } }
void insert(int val) { int lt, mt, rt; tie(lt, rt) = split_by_val(root, val); tie(lt, mt) = split_by_val(lt, val - 1); if (!mt) { mt = new_node(val); } else { node[mt].cnt ++; update_size(mt); } root = merge(merge(lt, mt), rt); }
void del(int val) { int lt, mt, rt; tie(lt, rt) = split_by_val(root, val); tie(lt, mt) = split_by_val(lt, val - 1); unode[mt].cnt --; update_size(mt); if (node[mt].cnt == 0) { clear(mt); } else { lt = merge(lt, mt); } root = merge(lt, rt); }
void reverse(int l, int r) { int t1, t2, t3, t4, t5; tie(t1, t2, t3) = split_by_rank(root, l - 1); tie(t3, t4, t5) = split_by_ranl(t3, r - l + 2); node[t3].rev = 1; root = merge(merge(merge(merge(t1, t2), t3), t4), t5); }
void check_rev(int t) { if (node[t].rev) { swap(node[t].ch[0], node[t].ch[1]); node[node[t].ch[0]].rev ^= 1; node[node[t].ch[1]].rev ^= 1; node[t].rev = 0; } }
int rank(int val) { auto tmp = split_by_val(root, val - 1); int k = node[tmp.first].size + 1; root = merge(tmp.first, tmp.second); return k; }
int kth(int &t, int k) { int lt, mt, rt; tie(lt, mt, rt) = split_by_rank(t, k); int val = node[mt].val; t = merge(merge(lt, mt), rt); return val; }
int pre(int val) { auto tmp = split_by_cal(root, val - 1); int k = kth(tmp.first, node[tmp.first].size); root = merge(tmp.first, tmp.second); return k; }
int nxt(int val) { auto tmp = split_by_val(root, val); int k = kth(tmp.second, 1); root = merge(tmp.first, tmp.second); return k; }
|