不难的动态树,多了一个在splay中查询第k大。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 10005
#define maxm 20005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head
struct node *null;
struct node
{
int key, sum, num, id;
node *fa, *ch[2];
inline bool d()
{
return fa->ch[1] == this;
}
inline bool isroot()
{
return fa == null || fa->ch[0] != this && fa->ch[1] != this;
}
inline void setc(node *p, int d)
{
ch[d] = p;
p->fa = this;
}
inline void pushup()
{
num = 1 + ch[0]->num + ch[1]->num;
sum = key + ch[0]->sum + ch[1]->sum;
}
void rot()
{
node *f = fa, *ff = fa->fa;
int c = d(), cc = fa->d();
f->setc(ch[!c], c);
this->setc(f, !c);
if(ff->ch[cc] == f) ff->setc(this, cc);
else this->fa = ff;
f->pushup();
}
node* splay()
{
while(!isroot()) {
if(!fa->isroot()) d() == fa->d() ? fa->rot() : rot();
rot();
}
pushup();
return this;
}
node* access()
{
for(node* p = this, *q = null; p != null; q = p, p = p->fa) {
p->splay()->setc(q, 1);
p->pushup();
}
return splay();
}
};
struct Edge
{
int v, w;
Edge *next;
}E[maxm], *H[maxn], *edges;
node *Node[maxn];
node pool[maxn];
node *tail;
queue<int> q;
int vis[maxn];
char s[100];
int n;
void addedges(int u, int v, int w)
{
edges->v = v;
edges->w = w;
edges->next = H[u];
H[u] = edges++;
}
void init()
{
tail = pool;
null = tail++;
null->fa = null->ch[0] = null->ch[1] = null;
null->key = null->sum = null->num = 0;
edges = E;
memset(H, 0, sizeof H);
memset(vis, 0, sizeof vis);
}
void read()
{
int u, v, w;
scanf("%d", &n);
for(int i = 1; i < n; i++) {
scanf("%d%d%d", &u, &v, &w);
addedges(u, v, w);
addedges(v, u, w);
}
for(int i = 1; i <= n; i++) {
tail->fa = tail->ch[0] = tail->ch[1] = null;
tail->key = tail->sum = 0;
tail->num = 1, tail->id = i;
Node[i] = tail++;
}
}
void bfs()
{
vis[1] = 1;
q.push(1);
while(!q.empty()) {
int u = q.front();
q.pop();
for(Edge *e = H[u]; e; e = e->next) {
int v = e->v, w = e->w;
if(vis[v]) continue;
vis[v] = 1;
q.push(v);
Node[v]->fa = Node[u];
Node[v]->key = Node[v]->sum = w;
}
}
}
int query(node *a, node *b)
{
a->access();
for(a = null; b != null; a = b, b = b->fa) {
b->splay();
if(b->fa == null) return b->ch[1]->sum + a->sum;
b->setc(a, 1);
b->pushup();
}
}
int kth(node *a, node *b, int k)
{
a->access();
for(a = null; b != null; a = b, b = b->fa) {
b->splay();
if(b->fa == null) {
if(b->ch[1]->num + 1>= k) {
while(1) {
if(k == b->ch[1]->num + 1) return b->id;
if(k > b->ch[1]->num) k -= b->ch[1]->num + 1, b = b->ch[0];
else b = b->ch[1];
}
}
else {
k -= b->ch[1]->num + 1;
while(1) {
if(k == a->ch[0]->num + 1) return a->id;
if(k > a->ch[0]->num) k -= a->ch[0]->num + 1, a = a->ch[1];
else a = a->ch[0];
}
}
}
b->setc(a, 1);
b->pushup();
}
}
void work()
{
int a, b, k;
bfs();
while(scanf("%s", s)!=EOF) {
if(strcmp(s, "DONE") == 0) break;
if(s[0] == 'D') {
scanf("%d%d", &a, &b);
printf("%d\n", query(Node[a], Node[b]));
}
else {
scanf("%d%d%d", &a, &b, &k);
printf("%d\n", kth(Node[a], Node[b], k));
}
}
}
int main(void)
{
int _;
scanf("%d", &_);
while(_--) {
init();
read();
work();
}
return 0;
}