传送门1
传送门2
写在前面:被旁边的小恐龙嘲讽半天指针,最后一遍A让他目瞪口呆
思路:原本这个splay模板是用来打别的题的,但打完才发现那道题根本和splay没关系……这道题就是求一个k小值和合并树,这里我YY了一下启发式合并(之前没写过也没看过),搞了个并查集,想了半天存根的方法,后来放到了两个数组里去
#include<bits/stdc++.h>
using namespace std;
int q,n,m,root,x,y,tot;
char ch;
queue<int> team;
int father[100010],roots[100010];
struct os
{
int sz,ch[2],fa,data;
}a[100010];
inline int find(int x)
{
if (father[x]!=x) father[x]=find(father[x]);
return father[x];
}
inline int in()
{
int f=1,t=0;
char ch=getchar();
while ((ch>'9'||ch<'0')&&ch!='-') ch=getchar();
if (ch=='-') f=-1,ch=getchar();
while (ch>='0'&&ch<='9') t=t*10+ch-'0',ch=getchar();
return f*t;
}
inline void ct(int now)
{
a[now].sz=1+a[a[now].ch[0]].sz+a[a[now].ch[1]].sz;
}
inline void rorate(int now,bool flag)
{
int pa=a[now].fa;
a[a[now].ch[flag]].fa=pa;
a[pa].ch[!flag]=a[now].ch[flag];
a[now].fa=a[pa].fa;
if (a[a[pa].fa].ch[0]==pa) a[a[pa].fa].ch[0]=now;
else a[a[pa].fa].ch[1]=now;
a[pa].fa=now;
a[now].ch[flag]=pa;
ct(pa);
ct(now);
}
inline void splay(int now,int goal)
{
int pa;
while (a[now].fa!=goal)
{
pa=a[now].fa;
if (a[pa].fa==goal)
{
if (a[pa].ch[0]==now) rorate(now,1);
else rorate(now,0);
}
else if (a[a[pa].fa].ch[0]==pa)
{
if (a[pa].ch[0]==now) rorate(pa,1);
else rorate(now,0);
rorate(now,1);
}
else
{
if (a[pa].ch[1]==now) rorate(pa,0);
else rorate(now,1);
rorate(now,0);
}
}
if (!goal) roots[find(now)]=now;
}
inline void insert(int x,int y)
{
int now=roots[y];
a[x].ch[0]=a[x].ch[1]=0;
a[x].sz=1;
while (now)
{
a[now].sz++;
if (a[now].data>a[x].data)
{
if (!a[now].ch[0]) {a[x].fa=now;a[now].ch[0]=x;break;}
else now=a[now].ch[0];
}
else
{
if (!a[now].ch[1]) {a[x].fa=now;a[now].ch[1]=x;break;}
else now=a[now].ch[1];
}
}
splay(x,0);
}
inline int findk(int x,int k)
{
int now=roots[find(x)];
while (now)
{
if (k>a[a[now].ch[0]].sz&&k<=a[a[now].ch[0]].sz+1) {
splay(now,0);
return now;}
if (k<=a[a[now].ch[0]].sz) now=a[now].ch[0];
else k-=(1+a[a[now].ch[0]].sz),now=a[now].ch[1];
}
return -1;
}
inline void unions(int x,int y)
{
if (x==y) return;
if (a[x].sz>a[y].sz) swap(x,y);
team.push(x);
father[x]=y;
while (!team.empty())
{
x=team.front();
team.pop();
if (a[x].ch[0]) team.push(a[x].ch[0]);
if (a[x].ch[1]) team.push(a[x].ch[1]);
insert(x,y);
}
}
main()
{
n=in();m=in();
for (int i=1;i<=n;i++) father[i]=i;
for (int i=1;i<=n;i++)
{
a[i].data=in();
a[i].sz=1;
roots[i]=i;
}
for (int i=1;i<=m;i++)
x=in(),y=in(),
x=find(x),y=find(y),
unions(x,y);
q=in();
while (q--)
{
ch=getchar();
while (ch!='B'&&ch!='Q') ch=getchar();
x=in();y=in();
if (ch=='B')
{
x=find(x);y=find(y);
unions(x,y);
}
else printf("%d\n",findk(x,y));
}
}