0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 19:08:47 +00:00

Compare commits

...

3 Commits

24 changed files with 571 additions and 348 deletions

View File

@ -5,274 +5,261 @@ using std::cin;
using std::cout; using std::cout;
const char endl = '\n'; const char endl = '\n';
template <typename T> const int N = 1e5 + 5;
class Splay { class Splay {
private: private:
size_t root, cnt;
struct node { struct node {
T value; size_t l, r, f, c, s;
node *lchild, *rchild, *parent, **root; int v;
std::size_t size, count;
node() node()
: value(0), lchild(nullptr), rchild(nullptr), parent(nullptr), root(nullptr), size(0), count(0) {} : l(0), r(0), f(0), c(0), s(0), v(0) {}
node(const T &_value, node *_parent, node **_root) node(int _v, int _f)
: value(_value), lchild(nullptr), rchild(nullptr), parent(_parent), root(_root), size(1), count(1) {} : l(0), r(0), f(_f), c(1), s(1), v(_v) {}
~node() { size_t &child(unsigned x) {
if (lchild != nullptr) delete lchild; return !x ? l : r;
if (rchild != nullptr) delete rchild;
} }
} tr[N];
node *&child(unsigned int x) { // 上传信息
return !x ? lchild : rchild; void pushup(size_t u) {
tr[u].s = tr[tr[u].l].s + tr[tr[u].r].s + tr[u].c;
}
unsigned relation(size_t u) {
// 如果当前节点是其父亲节点的左儿子则返回 0否则返回 1
return u == tr[tr[u].f].l ? 0 : 1;
}
void rotate(size_t u) {
// 旧的父节点
size_t p = tr[u].f;
// 当前节点与父节点之间的关系
unsigned x = relation(u);
// 当前节点 <-> 父节点的父节点
if (tr[p].f) {
tr[tr[p].f].child(relation(p)) = u;
} }
tr[u].f = tr[p].f;
unsigned int relation() const { // 原先的另一个子节点 <-> 父节点
// 如果当前节点是其父亲节点的左儿子则返回 0否则返回 1 if (tr[u].child(x ^ 1)) {
return this == parent->lchild ? 0 : 1; tr[tr[u].child(x ^ 1)].f = p;
} }
tr[p].child(x) = tr[u].child(x ^ 1);
// 左儿子大小 // 原先的父节点 -> 子节点
std::size_t lsize() const { tr[u].child(x ^ 1) = p;
return lchild == nullptr ? 0 : lchild->size; tr[p].f = u;
}
// 右儿子大小 // 更新节点信息
std::size_t rsize() const { pushup(p);
return rchild == nullptr ? 0 : rchild->size; pushup(u);
} }
// 上传信息 // Splay
void pushup() { //
size = lsize() + count + rsize(); // 旋转到给定的位置target默认行为为旋转为根节点
} void splay(size_t u, size_t t = 0) {
while (tr[u].f != t) {
// 旋转 if (tr[tr[u].f].f == t) {
void rotate() { rotate(u);
node *old = parent; } else if (relation(u) == relation(tr[u].f)) {
unsigned int x = relation(); rotate(tr[u].f);
rotate(u);
if (old->parent != nullptr) {
old->parent->child(old->relation()) = this;
}
parent = old->parent;
old->child(x) = child(x ^ 1);
if (child(x ^ 1) != nullptr) {
child(x ^ 1)->parent = old;
}
child(x ^ 1) = old;
old->parent = this;
old->pushup();
pushup();
if (parent == nullptr) *root = this;
}
// Splay
void splay(node *target = nullptr) {
while (parent != target) {
if (parent->parent == target) { // 父节点是目标节点
rotate();
} else if (relation() == parent->relation()) { // 关系相同
parent->rotate();
rotate();
} else {
rotate();
rotate();
}
}
}
// 前驱:左子树的最右点
node *predecessor() {
node *pred = lchild;
while (pred->rchild != nullptr) {
pred = pred->rchild;
}
return pred;
}
// 后继:右子树的最左点
node *successor() {
node *succ = rchild;
while (succ->lchild != nullptr) {
succ = succ->lchild;
}
return succ;
}
} * root;
// 插入(内部函数)
node *_insert(const T &value) {
node **target = &root, *parent = nullptr;
while (*target != nullptr && (*target)->value != value) {
parent = *target;
parent->size++;
// 根据大小向左右子树迭代
if (value < parent->value) {
target = &parent->lchild;
} else { } else {
target = &parent->rchild; rotate(u);
rotate(u);
} }
} }
if (*target == nullptr) { // 更新根节点
*target = new node(value, parent, &root); if (!t) root = u;
} else { }
(*target)->count++;
(*target)->size++; // 前驱
//
// 左子树的最右点
size_t _predecessor(size_t u) {
size_t cur = tr[u].l;
while (tr[cur].r) {
cur = tr[cur].r;
} }
(*target)->splay(); return cur;
}
// 后继
//
// 右子树的最左点
size_t _successor(size_t u) {
size_t cur = tr[u].r;
while (tr[cur].l) {
cur = tr[cur].l;
}
return cur;
}
size_t _find(const int &v) {
size_t u = root;
while (u && tr[u].v != v) {
// 根据数值大小向左右子树迭代
u = v < tr[u].v ? tr[u].l : tr[u].r;
}
if (u) splay(u);
return u;
}
size_t _insert(const int &v) {
size_t u = root, f = 0;
while (u && tr[u].v != v) {
f = u;
// 根据数值大小向左右子树迭代
u = v < tr[u].v ? tr[u].l : tr[u].r;
}
if (u) {
tr[u].c++;
tr[u].s++;
} else {
tr[u = ++cnt] = node(v, f);
if (f) tr[f].child(v > tr[f].v) = u;
}
splay(u);
return root; return root;
} }
// 查找指定的值对应的节点 void _erase(size_t u) {
node *find(const T &value) { if (!u) return;
node *node = root; // 从根节点开始查找
while (node != nullptr && value != node->value) { if (tr[u].c > 1) { // 存在重复的数
if (value < node->value) { splay(u);
node = node->lchild; tr[u].c--;
} else { tr[u].s--;
node = node->rchild;
}
}
if (node != nullptr) {
node->splay();
}
return node;
}
// 删除
void erase(node *u) {
if (u == nullptr) return;
if (u->count > 1) { // 存在重复的数
u->splay();
u->count--;
u->size--;
return; return;
} }
node *pred = u->predecessor(), size_t pred = _predecessor(u),
*succ = u->successor(); succ = _successor(u);
pred->splay(); splay(pred); // 将前驱旋转到根节点
succ->splay(pred); splay(succ, pred); // 将后继旋转到根节点的右儿子
delete succ->lchild; tr[succ].l = 0; // 此时要删的节点为根节点的左儿子且为叶子节点
succ->lchild = nullptr;
succ->pushup(); // 更新节点信息
pred->pushup(); pushup(succ);
pushup(pred);
} }
public: public:
Splay() Splay()
: root(nullptr) { : root(0), cnt(0) {
insert(std::numeric_limits<T>::min()); // 插入哨兵节点
insert(std::numeric_limits<T>::max()); insert(std::numeric_limits<int>::min());
} insert(std::numeric_limits<int>::max());
~Splay() {
delete root;
} }
// 插入 // 插入
void insert(const T &value) { void insert(const int &v) {
_insert(value); _insert(v);
} }
// 删除 // 删除
void erase(const T &value) { void erase(const int &v) {
node *node = find(value); _erase(_find(v));
if (node == nullptr) return;
erase(node);
} }
// 排名 // 排名
unsigned int rank(const T &value) { unsigned rank(const int &v) {
node *node = find(value); size_t u = _find(v);
if (node == nullptr) { if (!u) { // 不存在则插入一个方便查找
node = _insert(value); u = _insert(v);
// 此时 node 已经成为根节点,直接计算即可
int res = node->lsize(); // 由于「哨兵」的存在,此处无需 -1
erase(node);
return res; // 此时 u 已经成为根节点,直接取左子树大小即可
unsigned r = tr[tr[u].l].s;
_erase(u);
return r;
} }
// 此时 node 已经成为根节点,直接计算即可 return tr[tr[u].l].s;
return node->lsize();
} }
// 选择 // 选择
const T &select(int k) { const int &select(unsigned k) {
node *node = root; size_t u = root;
while (k < node->lsize() || k >= node->lsize() + node->count) { while (k < tr[tr[u].l].s || k >= tr[tr[u].l].s + tr[u].c) {
if (k < node->lsize()) { // 所需的节点在左子树中 if (k < tr[tr[u].l].s) {
node = node->lchild; u = tr[u].l;
} else { } else {
k -= node->lsize() + node->count; k -= tr[tr[u].l].s + tr[u].c;
node = node->rchild; u = tr[u].r;
} }
} }
node->splay(); splay(u);
return node->value; return tr[u].v;
} }
// 前驱 // 前驱
const T &predecessor(const T &value) { const int &predecessor(const int &v) {
node *node = find(value); size_t u = _find(v);
if (node == nullptr) { if (!u) { // 不存在则插入一个方便查找
node = _insert(value); u = _insert(v);
const T &result = node->predecessor()->value;
erase(node); const int &r = tr[_predecessor(u)].v;
return result;
_erase(u); // 删除
return r;
} }
return node->predecessor()->value; return tr[_predecessor(u)].v;
} }
// 后继 // 后继
const T &successor(const T &value) { const int &successor(const int &v) {
node *node = find(value); size_t u = _find(v);
if (node == nullptr) { if (!u) { // 不存在则插入一个方便查找
node = _insert(value); u = _insert(v);
const T &result = node->successor()->value;
erase(node); const int &r = tr[_successor(u)].v;
return result;
_erase(u); // 删除
return r;
} }
return node->successor()->value; return tr[_successor(u)].v;
} }
}; };
int n; int n;
Splay<int> tree; Splay tree;
int main() { int main() {
std::ios::sync_with_stdio(false); std::ios::sync_with_stdio(false);
@ -280,42 +267,23 @@ int main() {
cin >> n; cin >> n;
for (int i = 1; i <= n; i++) { while (n--) {
int op, x; int op, x;
cin >> op >> x; cin >> op >> x;
switch (op) { if (op == 1) {
case 1: { tree.insert(x);
tree.insert(x); } else if (op == 2) {
tree.erase(x);
break; } else if (op == 3) {
} cout << tree.rank(x) << endl;
case 2: { } else if (op == 4) {
tree.erase(x); cout << tree.select(x) << endl;
} else if (op == 5) {
break; cout << tree.predecessor(x) << endl;
} } else { // op == 6
case 3: { cout << tree.successor(x) << endl;
cout << tree.rank(x) << endl;
break;
}
case 4: {
cout << tree.select(x) << endl;
break;
}
case 5: {
cout << tree.predecessor(x) << endl;
break;
}
case 6: {
cout << tree.successor(x) << endl;
break;
}
} }
} }

View File

@ -1,6 +1,4 @@
#include <iostream> #include <iostream>
#include <algorithm>
#include <cstdlib>
#include <stack> #include <stack>
using std::cin; using std::cin;
@ -9,171 +7,158 @@ const char endl = '\n';
const int N = 1e5 + 5; const int N = 1e5 + 5;
// Link-Cut Tree
class LinkCutTree { class LinkCutTree {
private: private:
std::stack<bool> st;
struct node { struct node {
int p, // 父亲节点 size_t l, r, f;
l, // 左儿子 unsigned v, s;
r; // 右儿子 bool rev;
int pre;
int val, // 节点值
sum; // 异或和
int key; // 权值
bool rev; // 翻转标记
node() node()
: p(0), l(0), r(0), pre(0), val(0), sum(0), key(rand()), rev(false) {} : l(0), r(0), f(0), s(0), v(0), rev(false) {}
node(unsigned _v, size_t _f)
: l(0), r(0), f(_f), s(_v), v(_v), rev(false) {}
size_t &child(unsigned x) {
return !x ? l : r;
}
} tr[N]; } tr[N];
void pushup(int u) { inline void pushup(size_t u) {
// 计算异或和 tr[u].s = tr[tr[u].l].s ^ tr[u].v ^ tr[tr[u].r].s;
tr[u].sum = tr[tr[u].l].sum ^ tr[u].val ^ tr[tr[u].r].sum;
// 标记父亲节点
if (tr[u].l) tr[tr[u].l].p = u;
if (tr[u].r) tr[tr[u].r].p = u;
} }
void pushdown(int u) { inline void pushdown(const size_t &u) {
if (!tr[u].rev) return; if (!tr[u].rev) return;
tr[u].rev = false;
std::swap(tr[u].l, tr[u].r); std::swap(tr[u].l, tr[u].r);
tr[tr[u].l].rev ^= 1; tr[tr[u].l].rev = !tr[tr[u].l].rev;
tr[tr[u].r].rev ^= 1; tr[tr[u].r].rev = !tr[tr[u].r].rev;
tr[u].rev = false;
} }
std::pair<int, int> split(int u) { unsigned relation(const size_t &u) {
if (st.empty()) { return u == tr[tr[u].f].l ? 0 : 1;
pushdown(u); }
auto t = std::make_pair(u, tr[u].r);
tr[u].r = 0;
pushup(u);
return t; bool isRoot(const size_t &u) {
return tr[tr[u].f].l != u && tr[tr[u].f].r != u;
}
void rotate(size_t u) {
size_t p = tr[u].f;
unsigned x = relation(u);
if (!isRoot(p)) {
tr[tr[p].f].child(relation(p)) = u;
} }
tr[u].f = tr[p].f;
bool d = st.top() ^ tr[u].rev; if (tr[u].child(x ^ 1)) {
st.pop(); tr[tr[u].child(x ^ 1)].f = p;
pushdown(u);
if (d) {
auto t = split(tr[u].l);
tr[u].l = t.second;
pushup(u);
return std::make_pair(t.first, u);
} }
tr[p].child(x) = tr[u].child(x ^ 1);
auto t = split(tr[u].r); tr[u].child(x ^ 1) = p;
tr[u].r = t.first; tr[p].f = u;
pushup(p);
pushup(u); pushup(u);
return std::make_pair(u, t.second);
} }
// 合并 void splay(size_t u) {
int merge(int x, int y) { std::stack<size_t> st;
if (!x || !y) return x | y;
if (tr[x].key < tr[y].key) { size_t cur = u;
pushdown(x); st.push(cur);
tr[x].r = merge(tr[x].r, y); while (!isRoot(cur)) {
pushup(x); st.push(tr[cur].f);
return x; cur = tr[cur].f;
} }
pushdown(y); while (!st.empty()) {
tr[y].l = merge(x, tr[y].l); pushdown(st.top());
pushup(y); st.pop();
return y; }
}
// 是否是根节点
bool isRoot(int u) {
return !tr[u].p || (tr[tr[u].p].l != u && tr[tr[u].p].r != u);
}
// 查找根节点
int findRoot(int u) {
while (!st.empty()) st.pop();
while (!isRoot(u)) { while (!isRoot(u)) {
// pushdown(u); if (isRoot(tr[u].f)) {
st.push(tr[tr[u].p].l == u); rotate(u);
u = tr[u].p; } else if (relation(u) == relation(tr[u].f)) {
rotate(tr[u].f);
rotate(u);
} else {
rotate(u);
rotate(u);
}
} }
return u;
} }
int findLeft(int u) { void access(size_t u) {
u = findRoot(u); for (size_t f = 0; u; u = tr[f = u].f) {
pushdown(u); splay(u);
tr[u].r = f;
pushup(u);
}
}
void makeRoot(const size_t &u) {
access(u);
splay(u);
tr[u].rev = !tr[u].rev;
}
size_t findRoot(size_t u) {
access(u);
splay(u);
while (tr[u].l) { while (tr[u].l) {
u = tr[u].l; u = tr[u].l;
pushdown(u);
} }
return u; return u;
} }
int access(int u) { void split(const size_t &x, const size_t &y) {
int lst = 0; makeRoot(x);
access(y);
while (u) { splay(y);
auto t = split(findRoot(u));
tr[findLeft(lst)].pre = 0;
lst = merge(t.first, lst);
tr[findLeft(t.second)].pre = u;
u = tr[findLeft(lst)].pre;
}
return lst;
}
void makeRoot(int u) {
tr[access(u)].rev ^= 1;
} }
public: public:
int getRoot(int u) { void set(int p, int v) {
return findLeft(access(u)); tr[p].s = tr[p].v = v;
} }
void link(int x, int y) { unsigned query(int x, int y) {
split(x, y);
return tr[y].s;
}
void link(const int &x, const int &y) {
makeRoot(x); makeRoot(x);
tr[x].pre = y;
if (findRoot(y) != x) {
tr[x].f = y;
}
} }
void cut(int x, int y) { void cut(int x, int y) {
makeRoot(x); split(x, y);
access(y);
access(x); if (tr[y].l == x) {
tr[y].pre = 0; tr[y].l = 0;
tr[x].f = 0;
}
} }
int query(int x, int y) { void change(int p, int v) {
makeRoot(x); access(p);
access(y); splay(p);
tr[p].v = v;
auto t = split(findRoot(y)); pushup(p);
int res = tr[t.first].sum;
merge(t.first, t.second);
return res;
}
void change(int u, int val) {
makeRoot(u);
auto t = split(findRoot(u));
tr[u].val = val;
merge(t.first, t.second);
}
void set(int u, int val) {
tr[u].sum = tr[u].val = val;
} }
} lct; } lct;
@ -203,9 +188,7 @@ int main() {
break; break;
} }
case 1: { case 1: {
if (lct.getRoot(x) != lct.getRoot(y)) { lct.link(x, y);
lct.link(x, y);
}
break; break;
} }

209
S2OJ/102/102.cpp Normal file
View File

@ -0,0 +1,209 @@
#include <iostream>
#include <stack>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 3e5 + 5;
class LinkCutTree {
private:
struct node {
size_t l, r, f;
unsigned v, s;
bool rev;
node()
: l(0), r(0), f(0), s(0), v(0), rev(false) {}
node(unsigned _v, size_t _f)
: l(0), r(0), f(_f), s(_v), v(_v), rev(false) {}
size_t &child(unsigned x) {
return !x ? l : r;
}
} tr[N];
inline void pushup(size_t u) {
tr[u].s = tr[tr[u].l].s ^ tr[u].v ^ tr[tr[u].r].s;
}
inline void pushdown(const size_t &u) {
if (!tr[u].rev) return;
std::swap(tr[u].l, tr[u].r);
tr[tr[u].l].rev = !tr[tr[u].l].rev;
tr[tr[u].r].rev = !tr[tr[u].r].rev;
tr[u].rev = false;
}
unsigned relation(const size_t &u) {
return u == tr[tr[u].f].l ? 0 : 1;
}
bool isRoot(const size_t &u) {
return tr[tr[u].f].l != u && tr[tr[u].f].r != u;
}
void rotate(size_t u) {
size_t p = tr[u].f;
unsigned x = relation(u);
if (!isRoot(p)) {
tr[tr[p].f].child(relation(p)) = u;
}
tr[u].f = tr[p].f;
if (tr[u].child(x ^ 1)) {
tr[tr[u].child(x ^ 1)].f = p;
}
tr[p].child(x) = tr[u].child(x ^ 1);
tr[u].child(x ^ 1) = p;
tr[p].f = u;
pushup(p);
pushup(u);
}
void splay(size_t u) {
std::stack<size_t> st;
size_t cur = u;
st.push(cur);
while (!isRoot(cur)) {
st.push(tr[cur].f);
cur = tr[cur].f;
}
while (!st.empty()) {
pushdown(st.top());
st.pop();
}
while (!isRoot(u)) {
if (isRoot(tr[u].f)) {
rotate(u);
} else if (relation(u) == relation(tr[u].f)) {
rotate(tr[u].f);
rotate(u);
} else {
rotate(u);
rotate(u);
}
}
}
void access(size_t u) {
for (size_t f = 0; u; u = tr[f = u].f) {
splay(u);
tr[u].r = f;
pushup(u);
}
}
void makeRoot(const size_t &u) {
access(u);
splay(u);
tr[u].rev = !tr[u].rev;
}
size_t findRoot(size_t u) {
access(u);
splay(u);
while (tr[u].l) {
u = tr[u].l;
}
return u;
}
void split(const size_t &x, const size_t &y) {
makeRoot(x);
access(y);
splay(y);
}
public:
void set(int p, int v) {
tr[p].s = tr[p].v = v;
}
unsigned query(int x, int y) {
split(x, y);
return tr[y].s;
}
void link(const int &x, const int &y) {
makeRoot(x);
if (findRoot(y) != x) {
tr[x].f = y;
}
}
void cut(int x, int y) {
split(x, y);
if (tr[y].l == x) {
tr[y].l = 0;
tr[x].f = 0;
}
}
void change(int p, int v) {
access(p);
splay(p);
tr[p].v = v;
pushup(p);
}
} lct;
int n, m;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 1, x; i <= n; i++) {
cin >> x;
lct.set(i, x);
}
while (m--) {
int op, x, y;
cin >> op >> x >> y;
switch (op) {
case 0: {
cout << lct.query(x, y) << endl;
break;
}
case 1: {
lct.link(x, y);
break;
}
case 2: {
lct.cut(x, y);
break;
}
case 3: {
lct.change(x, y);
break;
}
}
}
return 0;
}

BIN
S2OJ/102/data/problem.conf (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree1.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree1.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree10.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree10.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree2.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree2.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree3.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree3.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree4.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree4.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree5.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree5.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree6.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree6.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree7.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree7.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree8.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree8.in (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree9.ans (Stored with Git LFS) Normal file

Binary file not shown.

BIN
S2OJ/102/data/tree9.in (Stored with Git LFS) Normal file

Binary file not shown.